Convex Analysis and Variational Problems
Part of the Classics in Applied Mathematics series
No one working in duality should be without a copy of this book.
It contains different developments of infinite dimensional convex programming in the context of convex analysis, including duality, minmax and Lagrangians, and convexification of nonconvex optimization problems in the calculus of variations (infinite dimension).
It also includes the theory of convex duality applied to partial differential equations; no other reference presents this in a systematic way.
The minmax theorems contained in this book have many useful applications, in particular the robust control of partial differential equations in finite time horizon.
This SIAM Classics in Applied Mathematics edition contains the original text along with a new preface and some additional references.