Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone

Abstract

We develop a practical semidefinite programming (SDP) facial reduction procedure that utilizes computationally efficient approximations of the positive semidefinite cone. The proposed method simplifies SDPs with no strictly feasible solution (a frequent output of parsers) by solving a sequence of easier optimization problems and could be a useful pre-processing technique for SDP solvers. We demonstrate effectiveness of the method on SDPs arising in practice, and describe our publicly-available software implementation. We also show how to find maximum rank matrices in our PSD cone approximations (which helps us find maximal simplifications), and we give a post-processing procedure for dual solution recovery that generally applies to facial-reduction-based pre-processing techniques. Finally, we show how approximations can be chosen to preserve problem sparsity.

Expanded computational results, added results on sparsity, and revised dual solution recovery section

References in corpus (1)

• Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank

Cited by in corpus (11)

• Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs
• Amenable cones: error bounds without constraint qualifications
• Evolving Scientific Discovery by Unifying Data and Background Knowledge with AI Hilbert
• Douglas--Rachford Splitting and ADMM for Pathological Convex Optimization
• On Polyhedral and Second-Order Cone Decompositions of Semidefinite Optimization Problems
• Solving SDP Completely with an Interior Point Oracle
• A new perspective on low-rank optimization
• Learning of Linear Dynamical Systems as a Non-Commutative Polynomial Optimization Problem
• High-Precision Bootstrap of Multimatrix Quantum Mechanics
• Evaluating approximations of the semidefinite cone with trace normalized distance
• CaΣoS: A nonlinear sum-of-squares optimization suite