Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP

DOI10.1137/18M1193657zbMath1434.90122OpenAlexW2981781020MaRDI QIDQ5242927

Tunçel, Levent, Marcel Kenji De Carli Silva

Publication date: 8 November 2019

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/18m1193657

zbMATH Keywords

strict complementarityHausdorff dimensionHausdorff measuresemidefinite optimizationgraph Laplacianelliptope

Mathematics Subject Classification ID

Semidefinite programming (90C22) Optimality conditions and duality in mathematical programming (90C46)

Related Items (1)

Characterizing the universal rigidity of generic tensegrities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimality conditions and finite convergence of Lasserre's hierarchy
• Characterizing the universal rigidity of generic frameworks
• Laplacian eigenvalues and the maximum cut problem
• Complementarity and nondegeneracy in semidefinite programming
• Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
• Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
• On the cone of positive semidefinite matrices
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Generalized inverses. Theory and applications.
• On a positive semidefinite relaxation of the cut polytope
• Strong duality and minimal representations for cone optimization
• A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
• An Introduction to Polynomial and Semi-Algebraic Optimization
• Vertices of Spectrahedra arising from the Elliptope, the Theta Body, and Their Relatives
• Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems
• Cube Slices, Pictorial Triangles, and Probability
• Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
• An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
• Semidefinite relaxation and nonconvex quadratic optimization
• Error Bounds for Linear Matrix Inequalities
• On the Convergence of the Central Path in Semidefinite Optimization
• On the Facial Structure of the Set of Correlation Matrices
• On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming
• Generic nondegeneracy in convex optimization
• On a Conjecture of Klee and Martin for Convex Bodies
• Singularity Degree of the Positive Semidefinite Matrix Completion Problem
• Geometry of cuts and metrics
• On the generic properties of convex optimization problems in conic form

This page was built for publication: Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP