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.
arXiv comment18 pages
References in corpus (15)
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Sparsity and Incoherence in Compressive Sampling
- Regularized estimation of large-scale gene association networks using graphical Gaussian models
- Low-rank optimization for semidefinite convex problems
- Geometry of Power Flows and Optimization in Distribution Networks
- New Formulation and Strong MISOCP Relaxations for AC Optimal Transmission Switching Problem
- Stability Approach to Regularization Selection (StARS) for High Dimensional Graphical Models
- Inexactness of SDP Relaxation and Valid Inequalities for Optimal Power Flow
- Truncated K-moment problems in several variables
- Optimal Power Flow as a Polynomial Optimization Problem
- Exact covariance thresholding into connected components for large-scale Graphical Lasso
- Exploiting symmetries in SDP-relaxations for polynomial optimization
- Fast ADMM for Semidefinite Programs with Chordal Sparsity
- The QC Relaxation: Theoretical and Computational Results on Optimal Power Flow
- Modified Interior-Point Method for Large-and-Sparse Low-Rank Semidefinite Programs