An exact duality theory for semidefinite programming and its complexity implications
From MaRDI portal
Publication:1373732
zbMath0890.90144MaRDI QIDQ1373732
Publication date: 16 July 1998
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Related Items (70)
On the identification of the optimal partition for semidefinite optimization ⋮ Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms ⋮ On equivalent representations and properties of faces of the cone of copositive matrices ⋮ SOS Is Not Obviously Automatizable, Even Approximately ⋮ Semidefinite programming and sums of Hermitian squares of noncommutative polynomials ⋮ Some Recent Developments in Spectrahedral Computation ⋮ Initialization in semidefinite programming via a self-dual skew-symmetric embedding ⋮ Cuts, matrix completions and graph rigidity ⋮ Facial reduction algorithms for conic optimization problems ⋮ Immobile indices and CQ-free optimality criteria for linear copositive programming problems ⋮ Solving generic nonarchimedean semidefinite programs using stochastic game algorithms ⋮ Strong duality and minimal representations for cone optimization ⋮ Deciding Polyhedrality of Spectrahedra ⋮ A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms ⋮ A facial reduction approach for the single source localization problem ⋮ An exact explicit dual for the linear copositive programming problem ⋮ A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization ⋮ Reflection groups and cones of sums of squares ⋮ Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems ⋮ On the complexity of analyticity in semi-definite optimization ⋮ The tracial moment problem and trace-optimization of polynomials ⋮ Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022 ⋮ A simplified treatment of Ramana's exact dual for semidefinite programming ⋮ Spectrahedral Shadows ⋮ Lagrangian duality in convex conic programming with simple proofs ⋮ Bad Semidefinite Programs: They All Look the Same ⋮ Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming ⋮ Semidefinite programming and matrix scaling over the semidefinite cone. ⋮ Constraint Satisfaction Problems over Numeric Domains ⋮ Reduction of SISO H-infinity output feedback control problem ⋮ Exact algorithms for semidefinite programs with degenerate feasible set ⋮ A guide to conic optimisation and its applications ⋮ A finite steps algorithm for solving convex feasibility problems ⋮ The complexity of optimizing over a simplex, hypercube or sphere: a short survey ⋮ Counterexample-Guided Refinement of Template Polyhedra ⋮ Numerical algebraic geometry and semidefinite programming ⋮ Semidefinite programming and arithmetic circuit evaluation ⋮ Refining the partition for multifold conic optimization problems ⋮ A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions ⋮ Tropical spectrahedra ⋮ Tractability conditions for numeric CSPs ⋮ Universal rigidity of complete bipartite graphs ⋮ Conic programming: infeasibility certificates and projective geometry ⋮ Application of facial reduction to H ∞ state feedback control problem ⋮ Preprocessing and Regularization for Degenerate Semidefinite Programs ⋮ Infeasibility detection in the alternating direction method of multipliers for convex optimization ⋮ An infeasible interior point method for the monotone SDLCP based on a transformation of the central path ⋮ Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone ⋮ Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity ⋮ Introduction to Semidefinite, Conic and Polynomial Optimization ⋮ Complexity, exactness, and rationality in polynomial optimization ⋮ On polyhedral and second-order cone decompositions of semidefinite optimization problems ⋮ Characterizing the universal rigidity of generic frameworks ⋮ Complexity, exactness, and rationality in polynomial optimization ⋮ On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming ⋮ The minimal cone for conic linear programming ⋮ Facially Dual Complete (Nice) Cones and Lexicographic Tangents ⋮ Complexity aspects of local minima and related notions ⋮ Strong duality for standard convex programs ⋮ Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs ⋮ Exact Duality in Semidefinite Programming Based on Elementary Reformulations ⋮ Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint ⋮ Second-Order Cone Representation for Convex Sets in the Plane ⋮ A Semidefinite Hierarchy for Containment of Spectrahedra ⋮ Unnamed Item ⋮ On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate ⋮ Semidefinite programming ⋮ Iterative universal rigidity ⋮ Three-monotone interpolation ⋮ Randomized interior point methods for sampling and optimization
This page was built for publication: An exact duality theory for semidefinite programming and its complexity implications
