Convex optimization algorithms
Material type: TextPublication details: Massachusetts Athena Scientific 2015Description: xii, 564pISBN:- 9781886529281 (hb.)
- 519.6 BER
Item type | Current library | Collection | Call number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|
Book | Plaksha University Library | Mathematics | 519.6 BER (Browse shelf(Opens below)) | Available | 002994 |
Browsing Plaksha University Library shelves, Collection: Mathematics Close shelf browser (Hides shelf browser)
519.55 JAM Time series analysis | 519.55 JAM Time series analysis | 519.55 TUN Models for dependent time series | 519.6 BER Convex optimization algorithms | 519.6 BOY Convex optimization | 519.6 NOC Numerical optimization | 519.6 VAN Linear programming : foundations and extensions |
http://www.athenasc.com/convexalgorithms.html
This book aims at an up-to-date and accessible development of algorithms for solving convex optimization problems. The book covers almost all the major classes of convex optimization algorithms. Principal among these are gradient, subgradient, polyhedral approximation, proximal, and interior point methods. Most of these methods rely on convexity (but not necessarily differentiability) in the cost and constraint functions, and are often connected in various ways to duality. The book contains numerous examples describing in detail applications to specially structured problems.
There are no comments on this title.