Lectures on Convex Optimization (inbunden)
Fler böcker inom
Format
Inbunden (Hardback)
Språk
Engelska
Antal sidor
589
Utgivningsdatum
2018-12-01
Upplaga
2nd ed. 2018
Förlag
Springer International Publishing AG
Originalspråk
English
Illustratör/Fotograf
Bibliographie
Illustrationer
1 Illustrations, black and white; XXIII, 589 p. 1 illus.
Dimensioner
242 x 158 x 40 mm
Vikt
1071 g
Antal komponenter
1
Komponenter
1 Hardback
ISBN
9783319915777

Lectures on Convex Optimization

av Yurii Nesterov
Inbunden,  Engelska, 2018-12-01
797
Köp
Spara som favorit
  • Skickas från oss inom 7-10 vardagar.
  • Fri frakt över 249 kr för privatkunder i Sverige.
Finns även som
Visa alla 1 format & utgåvor
This book provides a comprehensive, modern introduction to convex optimization, a field that is becoming increasingly important in applied mathematics, economics and finance, engineering, and computer science, notably in data science and machine learning. Written by a leading expert in the field, this book includes recent advances in the algorithmic theory of convex optimization, naturally complementing the existing literature. It contains a unified and rigorous presentation of the acceleration techniques for minimization schemes of first- and second-order. It provides readers with a full treatment of the smoothing technique, which has tremendously extended the abilities of gradient-type methods. Several powerful approaches in structural optimization, including optimization in relative scale and polynomial-time interior-point methods, are also discussed in detail. Researchers in theoretical optimization as well as professionals working on optimization problems will findthis book very useful. It presents many successful examples of how to develop very fast specialized minimization algorithms. Based on the authors lectures, it can naturally serve as the basis for introductory and advanced courses in convex optimization for students in engineering, economics, computer science and mathematics.
Visa hela texten

Passar bra ihop

  1. Lectures on Convex Optimization
  2. +
  3. The Anxious Generation

De som köpt den här boken har ofta också köpt The Anxious Generation av Jonathan Haidt (inbunden).

Köp båda 2 för 1086 kr

Kundrecensioner

Har du läst boken? Sätt ditt betyg »

Fler böcker av Yurii Nesterov

  • Interior Point Polynomial Algorithms in Convex Programming

    Interior Point Polynomial Algorithms in Convex Programming

    Yurii Nesterov

    Written for specialists working in optimization, mathematical programming, or control theory. The general theory of path-following and potential reduction interior point polynomial time methods, interior point methods, interior point methods for l...

    1380
    Köp
    Skickas inom vardagar.

Recensioner i media

It is a must-read for both students involved in the operations research programs, as well as the researchers in the area of nonlinear programming, in particular in convex optimization. (Marcin Anholcer, zbMATH 1427.90003, 2020)

Övrig information

Yurii Nesterov is a well-known specialist in optimization. He is an author of pioneering works related to fast gradient methods, polynomial-time interior-point methods, smoothing technique, regularized Newton methods, and others. He is a winner of several prestigious international prizes, including George Danzig prize (2000), von Neumann Theory prize (2009), SIAM Outstanding Paper Award (20014), and Euro Gold Medal (2016).

Innehållsförteckning

Introduction.- Part I Black-Box Optimization.- 1 Nonlinear Optimization.- 2 Smooth Convex Optimization.- 3 Nonsmooth Convex Optimization.- 4 Second-Order Methods.- Part II Structural Optimization.- 5 Polynomial-time Interior-Point Methods.- 6 Primal-Dual Model of Objective Function.- 7 Optimization in Relative Scale.- Bibliographical Comments.- Appendix A. Solving some Auxiliary Optimization Problems.- References.- Index.

Du kanske gillar