Lectures on Nonsmooth Optimization
Series: Texts in Applied Mathematics; 82;
- Publisher's listprice EUR 181.89
-
77 157 Ft (73 483 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 20% (cc. 15 431 Ft off)
- Discounted price 61 726 Ft (58 786 Ft + 5% VAT)
77 157 Ft
Availability
Not yet published.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher Springer
- Date of Publication 14 July 2025
- Number of Volumes 1 pieces, Book
- ISBN 9783031914164
- Binding Hardback
- No. of pages475 pages
- Size 235x155 mm
- Language English
- Illustrations X, 475 p. Illustrations, black & white 700
Categories
Short description:
This book provides an in-depth exploration of nonsmooth optimization, covering foundational algorithms, theoretical insights, and a wide range of applications. Nonsmooth optimization, characterized by nondifferentiable objective functions or constraints, plays a crucial role across various fields, including machine learning, imaging, inverse problems, statistics, optimal control, and engineering. Its scope and relevance continue to expand, as many real-world problems are inherently nonsmooth or benefit significantly from nonsmooth regularization techniques. This book covers a variety of algorithms for solving nonsmooth optimization problems, which are foundational and recent. It first introduces basic facts on convex analysis and subdifferetial calculus, various algorithms are then discussed, including subgradient methods, mirror descent methods, proximal algorithms, alternating direction method of multipliers, primal dual splitting methods and semismooth Newton methods. Moreover, error bound conditions are discussed and the derivation of linear convergence is illustrated. A particular chapter is delved into first order methods for nonconvex optimization problems satisfying the Kurdyka-Lojasiewicz condition. The book also addresses the rapid evolution of stochastic algorithms for large-scale optimization. This book is written for a wide-ranging audience, including senior undergraduates, graduate students, researchers, and practitioners who are interested in gaining a comprehensive understanding of nonsmooth optimization.
MoreLong description:
This book provides an in-depth exploration of nonsmooth optimization, covering foundational algorithms, theoretical insights, and a wide range of applications. Nonsmooth optimization, characterized by nondifferentiable objective functions or constraints, plays a crucial role across various fields, including machine learning, imaging, inverse problems, statistics, optimal control, and engineering. Its scope and relevance continue to expand, as many real-world problems are inherently nonsmooth or benefit significantly from nonsmooth regularization techniques. This book covers a variety of algorithms for solving nonsmooth optimization problems, which are foundational and recent. It first introduces basic facts on convex analysis and subdifferetial calculus, various algorithms are then discussed, including subgradient methods, mirror descent methods, proximal algorithms, alternating direction method of multipliers, primal dual splitting methods and semismooth Newton methods. Moreover, error bound conditions are discussed and the derivation of linear convergence is illustrated. A particular chapter is delved into first order methods for nonconvex optimization problems satisfying the Kurdyka-Lojasiewicz condition. The book also addresses the rapid evolution of stochastic algorithms for large-scale optimization. This book is written for a wide-ranging audience, including senior undergraduates, graduate students, researchers, and practitioners who are interested in gaining a comprehensive understanding of nonsmooth optimization.
MoreTable of Contents:
Preface.- Introduction.- Convex sets and convex functions.- Subgradient and mirror descent methods.- Proximal algorithms.- Karush-Kuhn-Tucker theory and Lagrangian duality.- ADMM: alternating direction method of multipliers.- Primal dual splitting algorithms.- Error bound conditions and linear convergence.- Optimization with Kurdyka- Lojasiewicz property.- Semismooth Newton methods.- Stochastic algorithms.- References.- Index.
More
Lectures on Nonsmooth Optimization
Subcribe now and receive a favourable price.
Subscribe
77 157 HUF
Network Optimization: An Introduction to the Network Reconstruction Approach: Network Reconstruction Approach to optimization
Subcribe now and receive a favourable price.
Subscribe
50 604 HUF
Modern Computational Methods for Fractional Differential Equations
Subcribe now and receive a favourable price.
Subscribe
63 262 HUF
Imo Problems, Theorems, And Methods: Number Theory
Subcribe now and receive a favourable price.
Subscribe
27 835 HUF
Imo Problems, Theorems, And Methods: Number Theory
Subcribe now and receive a favourable price.
Subscribe
17 713 HUF
Concise Guide to Fault Tree Analysis: Models, Methods and Algorithms
Subcribe now and receive a favourable price.
Subscribe
29 498 HUF
New Trends and Challenges in Optimization Theory Applied to Space Engineering: OTSE Conference Proceedings, 13?15 December 2023, L'Aquila (Italy)
Subcribe now and receive a favourable price.
Subscribe
90 774 HUF
Practical Construction Planning and Control Using Microsoft Project: An Illustrative Guide
Subcribe now and receive a favourable price.
Subscribe
46 556 HUF
