東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Lectures on nonsmooth optimization

Jin, Qinian.

Linked to FindBook

Google Book

Amazon

博客來

Lectures on nonsmooth optimization

Record Type:	Electronic resources : Monograph/item
Title/Author:	Lectures on nonsmooth optimization/ by Qinian Jin.
Author:	Jin, Qinian.
Published:	Cham :Springer Nature Switzerland : : 2025.,
Description:	xiii, 560 p. :ill., digital ;24 cm.
[NT 15003449]:	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.
Contained By:	Springer Nature eBook
Subject:	Nonsmooth optimization. -
Online resource:	https://doi.org/10.1007/978-3-031-91417-1
ISBN:	9783031914171

Lectures on nonsmooth optimization
Jin, Qinian.

Lectures on nonsmooth optimization[electronic resource] /by Qinian Jin. - Cham :Springer Nature Switzerland :2025. - xiii, 560 p. :ill., digital ;24 cm. - Texts in applied mathematics,v. 822196-9949 ;. - Texts in applied mathematics ;volume 82..

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.

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.

ISBN: 9783031914171

Standard No.: 10.1007/978-3-031-91417-1doiSubjects--Topical Terms:

709245
Nonsmooth optimization.

LC Class. No.: QA402.5

Dewey Class. No.: 519.6

Lectures on nonsmooth optimization
LDR:03002nmm a2200337 a 4500 001 2413982
003 DE-He213
005 20250704131713.0
006 m d
007 cr nn 008maaau
008 260205s2025 sz s 0 eng d
020 $a 9783031914171 $q (electronic bk.)
020 $a 9783031914164 $q (paper)
024 7 $a 10.1007/978-3-031-91417-1 $2 doi
035 $a 978-3-031-91417-1
040 $a GP $c GP
041 0 $a eng
050 4 $a QA402.5
072 7 $a PBU $2 bicssc
072 7 $a MAT042000 $2 bisacsh
072 7 $a PBU $2 thema
082 0 4 $a 519.6 $2 23
090 $a QA402.5 $b .J61 2025
100 1 $a Jin, Qinian. $3 3790408
245 1 0 $a Lectures on nonsmooth optimization $h [electronic resource] / $c by Qinian Jin.
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2025.
300 $a xiii, 560 p. : $b ill., digital ; $c 24 cm.
490 1 $a Texts in applied mathematics, $x 2196-9949 ; $v v. 82
505 0 $a 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.
520 $a 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.
650 0 $a Nonsmooth optimization. $3 709245
650 1 4 $a Optimization. $3 891104
650 2 4 $a Continuous Optimization. $3 1566748
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Texts in applied mathematics ; $v volume 82. $3 3790409
856 4 0 $u https://doi.org/10.1007/978-3-031-91417-1
950 $a Mathematics and Statistics (SpringerNature-11649)