Optimization Models

Emphasizing practical understanding over the technicalities of specific algorithms, this elegant textbook is an accessible introduction to the field of optimization, focusing on powerful and reliable convex optimization techniques. Students and practitioners will learn how to recognize, simplify, model and solve optimization problems – and apply these basic principles to their own projects. A clear and self-contained introduction to linear algebra, accompanied by relevant real-world examples, demonstrates core mathematical concepts in a way that is easy to follow, and helps students to understand their practical relevance. Requiring only a basic understanding of geometry, calculus, probability and statistics, and striking a careful balance between accessibility and mathematical rigor, it enables students to quickly understand the material, without being overwhelmed by complex mathematics. Accompanied by numerous end-of-chapter problems, an online solutions manual for instructors, and examples from a diverse range of fields including engineering, data science, economics, finance, and management, this is the perfect introduction to optimization for both undergraduate and graduate students.

[1]  Yurii Nesterov,et al.  Introductory Lectures on Convex Optimization - A Basic Course , 2014, Applied Optimization.

[2]  Venkat Chandrasekaran,et al.  Recovery of Sparse Probability Measures via Convex Programming , 2012, NIPS.

[3]  Pieter Abbeel,et al.  Geometric Programming for Aircraft Design Optimization , 2012, AIAA Journal.

[4]  Giuseppe Carlo Calafiore,et al.  Random convex programs: Dealing with the non-existing solution nuisance , 2010, 49th IEEE Conference on Decision and Control (CDC).

[5]  Yi Ma,et al.  Robust principal component analysis? , 2009, JACM.

[6]  Giuseppe Carlo Calafiore,et al.  Multi-period portfolio optimization with linear control policies , 2008, Autom..

[7]  Takao Watanabe,et al.  A unified algebraic approach to linear control design: Robert E. Skelton, Tetsuya Iwasaki and Karolos M. Grigoriadis; Copyright Taylor & Francis, 1998, ISBN: 0-7484-0592-5 , 2003, Autom..

[8]  Abdo Y. Alfakih,et al.  On the uniqueness of Euclidean distance matrix completions , 2003 .

[9]  Laurent El Ghaoui,et al.  Worst-Case Value-At-Risk and Robust Portfolio Optimization: A Conic Programming Approach , 2003, Oper. Res..

[10]  P. Tseng.  Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization , 2001 .

[11]  Y. Nesterov.  Quality of semidefinite relaxation for nonconvex quadratic optimization , 1997 .

[12]  Marc Teboulle,et al.  A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems , 2009, SIAM J. Imaging Sci..

[13]  A. Ruszczynski,et al.  Nonlinear Optimization , 2006 .

[14]  A. Banerjee.  Convex Analysis and Optimization , 2006 .

[15]  Aharon Ben-Tal,et al.  Lectures on modern convex optimization , 1987 .