Conic Optimization Theory: Convexification Techniques and Numerical Algorithms
arXiv:1709.08841 · doi:10.1016/j.arcontrol.2018.11.002
Abstract
Optimization is at the core of control theory and appears in several areas of this field, such as optimal control, distributed control, system identification, robust control, state estimation, model predictive control and dynamic programming. The recent advances in various topics of modern optimization have also been revamping the area of machine learning. Motivated by the crucial role of optimization theory in the design, analysis, control and operation of real-world systems, this tutorial paper offers a detailed overview of some major advances in this area, namely conic optimization and its emerging applications. First, we discuss the importance of conic optimization in different areas. Then, we explain seminal results on the design of hierarchies of convex relaxations for a wide range of nonconvex problems. Finally, we study different numerical algorithms for large-scale conic optimization problems.
18 pages
References in corpus (5)
- Sparsity and Incoherence in Compressive Sampling
- Stability Approach to Regularization Selection (StARS) for High Dimensional Graphical Models
- Truncated K-moment problems in several variables
- Fast ADMM for Semidefinite Programs with Chordal Sparsity
- Modified Interior-Point Method for Large-and-Sparse Low-Rank Semidefinite Programs