Foundations and Trends® in Optimization >
Vol 3 > Issue 2

Dmitriy Drusvyatskiy and Henry Wolkowicz (2017), "The Many Faces of Degeneracy in Conic Optimization", Foundations and Trends® in Optimization: Vol. 3: No. 2, pp 77-170. http://dx.doi.org/10.1561/2400000011

© 2017 D. Drusvyatskiy and H. Wolkowicz

Optimization, Computational geometry, Computational biology, Operations research, Denoising, Information theory and computer science, Information theory and statistics, Pattern recognition and learning, Modeling and Analysis: Sensor Networks

Download article
**In this article:**

1. What this monograph is about

Part I: Theory

2. Convex geometry

3. Virtues of strict feasibility

4. Facial reduction

Part II: Applications and illustrations

5. Introduction

6. Matrix completions

7. Hard combinatorial problems

Acknowledgements

Index

References

Slater’s condition – existence of a “strictly feasible solution” – is a common assumption in conic optimization. Without strict feasibility, first-order optimality conditions may be meaningless, the dual problem may yield little information about the primal, and small changes in the data may render the problem infeasible. Hence, failure of strict feasibility can negatively impact off-the-shelf numerical methods, such as primal-dual interior point methods, in particular. New optimization modeling techniques and convex relaxations for hard nonconvex problems have shown that the loss of strict feasibility is a more pronounced phenomenon than has previously been realized. In this text, we describe various reasons for the loss of strict feasibility, whether due to poor modeling choices or (more interestingly) rich underlying structure, and discuss ways to cope with it and, in many pronounced cases, how to use it as an advantage. In large part, we emphasize the facial reduction preprocessing technique due to its mathematical elegance, geometric transparency, and computational potential.

114 pp. $80.00

Buy book
114 pp. $135.00

Buy E-book (.pdf)
1. What this monograph is about

Part I: Theory

2. Convex geometry

3. Virtues of strict feasibility

4. Facial reduction

Part II: Applications and illustrations

5. Introduction

6. Matrix completions

7. Hard combinatorial problems

Acknowledgements

Index

References

Slater’s condition – existence of a “strictly feasible solution” – is a common assumption in conic optimization. Without strict feasibility, first-order optimality conditions may be meaningless, the dual problem may yield little information about the primal, and small changes in the data may render the problem infeasible. Hence, failure of strict feasibility can negatively impact off-the-shelf numerical methods, such as primal-dual interior point methods, in particular. New optimization modeling techniques and convex relaxations for hard nonconvex problems have shown that the loss of strict feasibility is a more pronounced phenomenon than has previously been realized.

*The Many Faces of Degeneracy in Conic Optimization* describes various reasons for the loss of strict feasibility, whether due to poor modeling choices or (more interestingly) rich underlying structure, and discusses ways to cope with it and, in many pronounced cases, how to use it as an advantage. In large part, it emphasizes the facial reduction preprocessing technique due to its mathematical elegance, geometric transparency, and computational potential.

*The Many Faces of Degeneracy in Conic Optimization* is divided into two parts. Part I presents the necessary theoretical grounding in conic optimization, including basic optimality and duality theory, connections of Slater’s condition to the distance to infeasibility and sensitivity theory, the facial reduction procedure, and the singularity degree. Part II focuses on illustrative examples and applications, including matrix completion problems (semidefinite, low-rank, and Euclidean distance), relaxations of hard combinatorial problems (quadratic assignment and max-cut), and sum of squares relaxations of polynomial optimization problems.