Strong Duality for Semidefinite Programming
From MaRDI portal
Recommendations
- Duality formulations in semidefinite programming
- A new proof of the strong duality theorem for semidefinite programming
- Strong duality conditions in semidefinite programming
- An exact duality theory for semidefinite programming and its complexity implications
- scientific article; zbMATH DE number 1031414
Cited in
(76)- Linear programming with positive semi-definite matrices
- Characterization of the barrier parameter of homogeneous convex cones
- An exact duality theory for semidefinite programming and its complexity implications
- Eigenvalue-constrained faces
- Best ellipsoidal relaxation to solve a nonconvex problem.
- On the Slater condition for the SDP relaxations of nonconvex sets
- Modularity maximization using completely positive programming
- Strong duality and dual pricing properties in semi-infinite linear programming: a non-Fourier-Motzkin elimination approach
- Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
- A new proof of the strong duality theorem for semidefinite programming
- Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- Strong duality and minimal representations for cone optimization
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Generating and measuring instances of hard semidefinite programs
- Numerical algebraic geometry and semidefinite programming
- Conic programming: infeasibility certificates and projective geometry
- A note on the minimal cone for conic linear programming
- A proximal DC approach for quadratic assignment problem
- Strong duality for standard convex programs
- Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming
- On strong duality in linear copositive programming
- Immobile indices and CQ-free optimality criteria for linear copositive programming problems
- Reduction of SISO H-infinity output feedback control problem
- Douglas-Rachford splitting and ADMM for pathological convex optimization
- A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions
- Necessary conditions and duality for inexact nonlinear semi-infinite programming problems
- A relaxed cutting plane method for semi-infinite semi-definite programming
- An exact explicit dual for the linear copositive programming problem
- A simplified treatment of Ramana's exact dual for semidefinite programming
- Strong duality for inexact linear programming
- Euclidean distance matrices and applications
- Embedding methods for semidefinite programming
- Bad semidefinite programs: they all look the same
- Understanding linear semi-infinite programming via linear programming over cones
- Computational results of a semidefinite branch-and-bound algorithm for k-cluster
- Knowledge-based semidefinite linear programming classifiers
- A closedness condition and its applications to DC programs with convex constraints
- FLOW ON DATA NETWORK AND A POSITIVE SEMIDEFINITE REPRESENTABLE DELAY FUNCTION
- Facial reduction algorithms for conic optimization problems
- New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs
- Optimality theorems for convex semidefinite vector optimization problems
- Duality for semi-definite and semi-infinite programming
- Cone-LP's and semidefinite programs: geometry and a simplex-type method
- A solution method for combined semi-infinite and semi-definite programming
- Solving SDP completely with an interior point oracle
- On equivalent representations and properties of faces of the cone of copositive matrices
- scientific article; zbMATH DE number 7306855 (Why is no real title available?)
- Refining the partition for multifold conic optimization problems
- Solving semidefinite programs using preconditioned conjugate gradients
- Duality for inexact semi-infinite linear programming
- scientific article; zbMATH DE number 5036103 (Why is no real title available?)
- Strong duality conditions in semidefinite programming
- Exact Duality in Semidefinite Programming Based on Elementary Reformulations
- Application of facial reduction to H_ state feedback control problem
- Preprocessing and regularization for degenerate semidefinite programs
- Validating numerical semidefinite programming solvers for polynomial invariants
- A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms
- Strong duality in parametric robust semi-definite linear programming and exact relaxations
- A facial reduction algorithm for finding sparse SOS representations
- Duality formulations in semidefinite programming
- A regularized strong duality for nonsymmetric semidefinite least squares problem
- On the uniform duality in copositive optimization
- Closing duality gaps of SDPs completely through perturbation when singularity degree is one
- Linear semidefinite programming problems: regularisation and strong dual formulations
- Revisiting some rules of convex analysis
- A minimal face constant rank constraint qualification for reducible conic programming
- Optimality criteria without constraint qualifications for linear semidefinite problems
- Semidefinite programming for discrete optimization and matrix completion problems
- Linear copositive programming: strong dual formulations and their properties
- Strong duality of a conic optimization problem with a single hyperplane and two cone constraints
- The minimal cone for conic linear programming
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
- Universal duality in conic convex optimization
- Uniform LP duality for semidefinite and semi-infinite programming
- \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints
This page was built for publication: Strong Duality for Semidefinite Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4377577)
