Lectures on Nonsmooth Optimization

· Texts in Applied Mathematics Книга 82 · Springer Nature
Π•-ΠΊΠ½ΠΈΠ³Π°
560
Π‘Ρ‚Ρ€Π°Π½ΠΈΡ†ΠΈ
ΠžΡ†Π΅Π½ΠΈΡ‚Π΅ ΠΈ Ρ€Π΅Ρ†Π΅Π½Π·ΠΈΠΈΡ‚Π΅ Π½Π΅ сС ΠΏΠΎΡ‚Π²Ρ€Π΄Π΅Π½ΠΈ Β Π”ΠΎΠ·Π½Π°Ρ˜Ρ‚Π΅ повСќС

Π—Π° Π΅-ΠΊΠ½ΠΈΠ³Π°Π²Π°

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.

Π—Π° Π°Π²Ρ‚ΠΎΡ€ΠΎΡ‚

Qinian Jin graduated from Anhui Normal University in China with a bachelor degree and obtained his PhD degree from the Department of Mathematics at Rutgers University, New Brunswick, USA. He then joined the Mathematical Sciences Institute at Australian National University in 2011. His research was supported by Australian Research Council (ARC) and he was awarded the Future Fellowship from ARC. His research interest covers inverse problems, numerical analysis, optimization, partial differential equations, geometric analysis. In particular his recent research focuses on using nonsmooth optimization technique to design algorithms for solving ill-posed inverse problems. He has published about 70 papers on international journals.

ΠžΡ†Π΅Π½Π΅Ρ‚Π΅ ја Π΅-ΠΊΠ½ΠΈΠ³Π°Π²Π°

ΠšΠ°ΠΆΠ΅Ρ‚Π΅ Π½ΠΈ ΡˆΡ‚ΠΎ мислитС.

Π˜Π½Ρ„ΠΎΡ€ΠΌΠ°Ρ†ΠΈΠΈ Π·Π° Ρ‡ΠΈΡ‚Π°ΡšΠ΅

ΠŸΠ°ΠΌΠ΅Ρ‚Π½ΠΈ Ρ‚Π΅Π»Π΅Ρ„ΠΎΠ½ΠΈ ΠΈ Ρ‚Π°Π±Π»Π΅Ρ‚ΠΈ
Π˜Π½ΡΡ‚Π°Π»ΠΈΡ€Π°Ρ˜Ρ‚Π΅ ја Π°ΠΏΠ»ΠΈΠΊΠ°Ρ†ΠΈΡ˜Π°Ρ‚Π° Google Play Books Π·Π° Android ΠΈ iPad/iPhone. Автоматски сС синхронизира со смСтката ΠΈ Π²ΠΈ ΠΎΠ²ΠΎΠ·ΠΌΠΎΠΆΡƒΠ²Π° Π΄Π° Ρ‡ΠΈΡ‚Π°Ρ‚Π΅ онлајн ΠΈΠ»ΠΈ ΠΎΡ„Π»Π°Ρ˜Π½ ΠΊΠ°Π΄Π΅ ΠΈ Π΄Π° стС.
Π›Π°ΠΏΡ‚ΠΎΠΏΠΈ ΠΈ ΠΊΠΎΠΌΠΏΡ˜ΡƒΡ‚Π΅Ρ€ΠΈ
МоТС Π΄Π° ΡΠ»ΡƒΡˆΠ°Ρ‚Π΅ Π°ΡƒΠ΄ΠΈΠΎΠΊΠ½ΠΈΠ³ΠΈ ΠΊΡƒΠΏΠ΅Π½ΠΈ ΠΎΠ΄ Google Play со ΠΊΠΎΡ€ΠΈΡΡ‚Π΅ΡšΠ΅ Π½Π° Π²Π΅Π±-прСлистувачот Π½Π° ΠΊΠΎΠΌΠΏΡ˜ΡƒΡ‚Π΅Ρ€ΠΎΡ‚.
Π•-Ρ‡ΠΈΡ‚Π°Ρ‡ΠΈ ΠΈ Π΄Ρ€ΡƒΠ³ΠΈ ΡƒΡ€Π΅Π΄ΠΈ
Π—Π° Π΄Π° Ρ‡ΠΈΡ‚Π°Ρ‚Π΅ Π½Π° ΡƒΡ€Π΅Π΄ΠΈ со Π΅-мастило, ΠΊΠ°ΠΊΠΎ ΡˆΡ‚ΠΎ сС Π΅-Ρ‡ΠΈΡ‚Π°Ρ‡ΠΈΡ‚Π΅ Kobo, ќС Ρ‚Ρ€Π΅Π±Π° Π΄Π° ΠΏΡ€Π΅Π·Π΅ΠΌΠ΅Ρ‚Π΅ Π΄Π°Ρ‚ΠΎΡ‚Π΅ΠΊΠ° ΠΈ Π΄Π° ја ΠΏΡ€Π΅Ρ„Ρ€Π»ΠΈΡ‚Π΅ Π½Π° ΡƒΡ€Π΅Π΄ΠΎΡ‚. Π‘Π»Π΅Π΄Π΅Ρ‚Π΅ Π³ΠΈ Π΄Π΅Ρ‚Π°Π»Π½ΠΈΡ‚Π΅ упатства Π²ΠΎ Π¦Π΅Π½Ρ‚Π°Ρ€ΠΎΡ‚ Π·Π° помош Π·Π° ΠΏΡ€Π΅Ρ„Ρ€Π»Π°ΡšΠ΅ Π½Π° Π΄Π°Ρ‚ΠΎΡ‚Π΅ΠΊΠΈΡ‚Π΅ Π½Π° ΠΏΠΎΠ΄Π΄Ρ€ΠΆΠ°Π½ΠΈ Π΅-Ρ‡ΠΈΡ‚Π°Ρ‡ΠΈ.