An exact duality theory for semidefinite programming and its complexity implications
From MaRDI portal
Publication:1373732
zbMATH Open0890.90144MaRDI QIDQ1373732FDOQ1373732
Authors: Motakuri V. Ramana 
Publication date: 16 July 1998
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Recommendations
Cited In (85)
- Tropical spectrahedra
- The tracial moment problem and trace-optimization of polynomials
- Tractability conditions for numeric CSPs
- Randomized interior point methods for sampling and optimization
- A finite steps algorithm for solving convex feasibility problems
- Constraint Satisfaction Problems over Numeric Domains
- Characterizing the universal rigidity of generic frameworks
- A semidefinite hierarchy for containment of spectrahedra
- Exact algorithms for semidefinite programs with degenerate feasible set
- Application of facial reduction to H ∞ state feedback control problem
- Linear vs. semidefinite extended formulations
- A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms
- Conic programming: infeasibility certificates and projective geometry
- Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs
- Infeasibility detection in the alternating direction method of multipliers for convex optimization
- Semidefinite programming
- On the Central Path of Semidefinite Optimization: Degree and Worst-Case Convergence Rate
- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
- Bad Semidefinite Programs: They All Look the Same
- Reduction of SISO H-infinity output feedback control problem
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- Preprocessing and regularization for degenerate semidefinite programs
- Numerical algebraic geometry and semidefinite programming
- Semidefinite programming and matrix scaling over the semidefinite cone.
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding
- Cuts, matrix completions and graph rigidity
- Solving generic nonarchimedean semidefinite programs using stochastic game algorithms
- An infeasible interior point method for the monotone SDLCP based on a transformation of the central path
- SOS Is Not Obviously Automatizable, Even Approximately
- Facial reduction algorithms for conic optimization problems
- Iterative universal rigidity
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey
- On polyhedral and second-order cone decompositions of semidefinite optimization problems
- Strong duality and minimal representations for cone optimization
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion
- Strong Duality for Semidefinite Programming
- Immobile indices and CQ-free optimality criteria for linear copositive programming problems
- Spectrahedral Shadows
- Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms
- Duality formulations in semidefinite programming
- A facial reduction approach for the single source localization problem
- Generating and measuring instances of hard semidefinite programs
- On the identification of the optimal partition for semidefinite optimization
- An exact explicit dual for the linear copositive programming problem
- On the Turing model complexity of interior point methods for semidefinite programming
- Perfect duality in semi-infinite and semidefinite programming
- The minimal cone for conic linear programming
- Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity
- Counterexample-Guided Refinement of Template Polyhedra
- \(\mathcal{UV}\)-theory of a class of semidefinite programming and its applications
- A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions
- Second-Order Cone Representation for Convex Sets in the Plane
- Facially Dual Complete (Nice) Cones and Lexicographic Tangents
- Some geometric results in semidefinite programming
- Complexity aspects of local minima and related notions
- Strong duality for standard convex programs
- Semidefinite programming and sums of Hermitian squares of noncommutative polynomials
- Complexity of the positive semidefinite matrix completion problem with a rank constraint
- An exact duality theory for semidefinite programming based on sums of squares
- Refining the partition for multifold conic optimization problems
- Exact Duality in Semidefinite Programming Based on Elementary Reformulations
- Universal rigidity of complete bipartite graphs
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- Introduction to Semidefinite, Conic and Polynomial Optimization
- Semidefinite programming and arithmetic circuit evaluation
- Three-monotone interpolation
- The truncated moment problem on curves y = q ( x ) and yx ℓ = 1
- A polyhedral approximation algorithm for recession cones of spectrahedral shadows
- On equivalent representations and properties of faces of the cone of copositive matrices
- Deciding polyhedrality of spectrahedra
- Complexity, exactness, and rationality in polynomial optimization
- Complexity, exactness, and rationality in polynomial optimization
- A guide to conic optimisation and its applications
- Title not available (Why is that?)
- Some Recent Developments in Spectrahedral Computation
- Empirical Properties of Optima in Free Semidefinite Programs
- Conic linear optimization for computer-assisted proofs. Abstracts from the workshop held April 10--16, 2022
- Reflection groups and cones of sums of squares
- A note on the computational complexity of the moment-SOS hierarchy for polynomial optimization
- Lagrangian duality in convex conic programming with simple proofs
- Beyond the Existential Theory of the Reals
- Closing duality gaps of SDPs completely through perturbation when singularity degree is one
- A simplified treatment of Ramana's exact dual for semidefinite programming
- Linear semidefinite programming problems: regularisation and strong dual formulations
- On the complexity of analyticity in semi-definite optimization
This page was built for publication: An exact duality theory for semidefinite programming and its complexity implications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1373732)
