Strict complementarity in semidefinite optimization with elliptopes including the maxcut SDP
From MaRDI portal
Recommendations
- Vertices of spectrahedra arising from the elliptope, the theta body, and their relatives
- On a positive semidefinite relaxation of the cut polytope
- scientific article; zbMATH DE number 2196288
- Geometry of semidefinite Max-Cut relaxations via matrix ranks
- Semidefinite programming for discrete optimization and matrix completion problems
Cites work
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- An introduction to polynomial and semi-algebraic optimization
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- Characterizing the universal rigidity of generic frameworks
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Complementarity and nondegeneracy in semidefinite programming
- Cube Slices, Pictorial Triangles, and Probability
- Error Bounds for Linear Matrix Inequalities
- Generalized inverses. Theory and applications.
- Generic nondegeneracy in convex optimization
- Geometry of cuts and metrics
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 3121284 (Why is no real title available?)
- scientific article; zbMATH DE number 3163858 (Why is no real title available?)
- scientific article; zbMATH DE number 1226899 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 1534289 (Why is no real title available?)
- scientific article; zbMATH DE number 1534290 (Why is no real title available?)
- scientific article; zbMATH DE number 1859212 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
- Laplacian eigenvalues and the maximum cut problem
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- Local Superlinear Convergence of Polynomial-Time Interior-Point Methods for Hyperbolicity Cone Optimization Problems
- On a Conjecture of Klee and Martin for Convex Bodies
- On a positive semidefinite relaxation of the cut polytope
- On the cone of positive semidefinite matrices
- On the Convergence of the Central Path in Semidefinite Optimization
- On the Facial Structure of the Set of Correlation Matrices
- On the generic properties of convex optimization problems in conic form
- On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Semidefinite relaxation and nonconvex quadratic optimization
- Singularity degree of the positive semidefinite matrix completion problem
- Strong duality and minimal representations for cone optimization
- Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
- Vertices of spectrahedra arising from the elliptope, the theta body, and their relatives
Cited in
(4)- Characterizing the universal rigidity of generic tensegrities
- Vertices of spectrahedra arising from the elliptope, the theta body, and their relatives
- Accelerated first-order methods for a class of semidefinite programs
- Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope
This page was built for publication: Strict complementarity in semidefinite optimization with elliptopes including the maxcut SDP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5242927)
