Convexity plays a central role in the design and analysis of modern and highly successful algorithms for solving real-world optimization problems. The lecture (in English) on convex optimization will treat in a balanced manner theory (convex analysis, optimality conditions) and algorithms for convex optimization.
Starting with basic results on convex sets and functions, with a particular emphasis on semidefinite sets, we develop a self-contained duality theory for convex optimization problems. As instrumental tools in the theory of Lagrange multipliers and optimality conditions for convex optimization problems, we introduce the notions of subdifferential and conjugate functions. The course will be illustrated by many applications in accordance with the interests of the audience.
On the algorithmic part, we cover several classes of optimization methods, from the simple subgradient method to mirror-descent schemes and Interior-Point Methods. Several exercise sessions will be devoted to the familiarization of software to solve efficiently some semidefinite optimization problems.
The lecture will follow mostly albeit loosely the textbook by S. Boyd and L. Vandenberghe, Convex Optimization, made available on the net (download)
References
A. Barvinok, A Course in Convexity. American Mathematical Society, 2003.
This
well-written book covers convex analysis, with a particular emphasis on
the interactions between convex analysis and combinatorial optimization
problems.
A. Ben-Tal and A. Nemirovski,
Lectures on Modern Convex Optimization - Analysis, Algorithms, and
Engineering Applications, MPS-SIAM Series on Optimization, MPS-SIAM.
This
authoritative work displays a great variety of applications of convex
optimization. It constitutes an ideal complement to the book of Boyd and
Vandenberghe. Available upon request.
D. P. Bertsekas, A. Nedic and A. E. Ozdaglar, Convex Analysis and Optimization, Athena Scientific, 2003.
D. Bertsimas and J. N. Tsitsiklis, Introduction to Linear Optimization, Athena Scientific, 1997.
S. Boyd, L. Vandenberghe, Convex Optimization, Cambridge University Press, 2004.
This
thick book serves as one of the main references for the course. The
authors deal with a number of applications of convex optimization in an
impressive variety of fields. Click on the link to download.
S. Boyd, L. El Ghaoui, E. Feron and V. Balakrishnan, Linear Matrix Inequalities in System and Control Theory. SIAM, 1994.
E. de Klerk, Aspects of Semidefinite Programming: Interior Point
Algorithms and Selected Applications, Book Series: APPLIED OPTIMIZATION,
Vol. 65. Kluwer Academic Publishers.
Y.
Nesterov, Introductory Lectures on Convex Optimization: A Basic Course,
Book Series: APPLIED OPTIMIZATION, Vol. 87. Kluwer Academic Publishers.
This
important book emerged from the lecture notes of Pr. Yurii Nesterov. It
focuses on the study of algorithms for convex optimization, and, among
others, interior-point methods. Available upon request..
R. A. Horn and C. R. Johnson, Matrix Analysis, Cambridge University Press, 1985.
This well-known book is an excellent reference on linear algebra. Its sequel "Topics in Matrix Analysis" is also a classic. Available upon request.
J. Renegar, A Mathematical View of Interior-Point Methods in Convex Optimization, MPS-SIAM Series on Optimization.
This
short book has been developed from a graduate course of Jim Renegar. It
contains an original analysis of interior-point methods, which
complements beautifully the book of Nesterov. Available upon request.
R.T. Rockafellar, Convex Analysis, Princeton University Press, 1997.
This is a classical and rather complete reference on convexity. Available upon request.
H. Wolkowicz, R. Saigal and L. Vandenberghe, Handbook of Semidefinite
Programming: Theory, Algorithms, and Applications, Kluwer Academic
Publishers.
This book is a collection of
well-written reviews on a variety of aspects of semidefinite
programming, including a discussion on its numerical behavior and the
development of a robustness analysis.
A. Nemirovski and D. Yudin, Problem Complexity and Method Efficiency in Optimization, John Wiley, 1983.
This dense work focuses on the question "How efficient can optimization algorithms be?". Available upon request..
Y. Nesterov and A. Nemirovski, Interior Point Polynomial Algorithms in
Convex Programming, Studies in Applied Mathematics Vol. 13, SIAM, 1993.
This
authoritative but hard book was the first to introduce the concept of
self-concordance. It would be difficult to overestimate its importance
and its influence on Convex Optimization during the last 15 years.
