• Corpus ID: 231894630

An echelon form of weakly infeasible semidefinite programs and bad projections of the psd cone

  title={An echelon form of weakly infeasible semidefinite programs and bad projections of the psd cone},
  author={G{\'a}bor Pataki and Aleksandr Touzov},
A weakly infeasible semidefinite program (SDP) has no feasible solution, but it has approximate solutions whose constraint violation is arbitrarily small. These SDPs are ill-posed and numerically often unsolvable. They are also closely related to “bad” linear projections that map the cone of positive semidefinite matrices to a nonclosed set. We describe a simple echelon form of weakly infeasible SDPs with the following properties: (i) it is obtained by elementary row operations and congruence… 


Exact Duality in Semidefinite Programming Based on Elementary Reformulations
This work obtains an exact, short certificate of infeasibility in SDP by an elementary approach: it reformulate any equality constrained semidefinite system using only elementary row operations, and rotations, and concludes that when a system is infeasible, the reformulated system is trivially infeasable.
Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs
  • G. Pataki
  • Computer Science, Mathematics
    SIAM Rev.
  • 2019
This work characterize pathological semidefinite systems by certain excluded matrices, which makes their pathological behavior easy to verify, and introduces readers to a fundamental issue in convex analysis: the linear image of a closed convex set may not be closed, and often simple conditions are available to verify the closedness, or lack of it.
How to generate weakly infeasible semidefinite programs via Lasserre’s relaxations for polynomial optimization
  • Hayato Waki
  • Mathematics, Computer Science
    Optim. Lett.
  • 2012
This note shows how to use Lasserre’s semidefinite programming relaxations for polynomial optimization in order to generate examples of weakly infeasible SDP and observes that SDP solvers do not detect the infeasibility and that values returned by SDPsolvers are equal to the optimal value of the instance due to numerical round-off errors.
An exact duality theory for semidefinite programming and its complexity implications
  • M. Ramana
  • Mathematics, Computer Science
    Math. Program.
  • 1997
In this paper, an exact dual is derived for Semidefinite Programming (SDP), for which strong duality properties hold without any regularity assumptions, and the dual is then applied to derive certain complexity results for SDP.
Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
This work describes exact duals, and certificates of infeasible and weak infeasibility for conic LPs which are nearly as simple as the Lagrange dual, but do not rely on any constraint qualification.
Strong duality in Lasserre’s hierarchy for polynomial optimization
It is shown that there is no duality gap between each primal and dual SDP problem in Lasserre’s hierarchy, provided one of the constraints in the description of set K is a ball constraint.
A structural geometrical analysis of weakly infeasible SDPs
It is shown that for a weakly infeasible problem over $n\times n$ matrices, at most $n-1 directions are required to approach the positive semidefinite cone.
Bad Semidefinite Programs: They All Look the Same
  • G. Pataki
  • Mathematics, Computer Science
    SIAM J. Optim.
  • 2017
The main motivation is the striking similarity of badly behaved semidefinite systems in the literature; it characterize such systems by certain excluded matrices, which are easy to spot in all published examples.
DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
DSOS and SDSOS optimization are introduced as linear programming and second-order cone programming-based alternatives to sum of squares optimization that allow one to trade off computation time with solution quality.
Sum-of-Squares Optimization without Semidefinite Programming
A homogeneous primal-dual interior-point method to solve sum-of-squares optimization problems by combining non-symmetric conic optimization techniques and polynomial interpolation, which has substantially lower theoretical time and space complexity than the conventional SDP-based approach.