Strong Duality for Semidefinite Programming
From MaRDI portal
Publication:4377577
DOI10.1137/S1052623495288350zbMath0891.90129OpenAlexW2092569137MaRDI QIDQ4377577
Henry Wolkowicz, Tunçel, Levent, Motakuri V. Ramana
Publication date: 10 February 1998
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623495288350
symmetric positive semidefinite matricesstrong dualityLöwner partial ordersemidefinite linear programming
Convex programming (90C25) Linear programming (90C05) Miscellaneous inequalities involving matrices (15A45) Convex sets and cones of operators (47L07)
Related Items
Embedding methods for semidefinite programming, Modularity maximization using completely positive programming, On equivalent representations and properties of faces of the cone of copositive matrices, Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs, On strong duality in linear copositive programming, Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster, A solution method for combined semi-infinite and semi-definite programming, Eigenvalue-constrained faces, Facial reduction algorithms for conic optimization problems, Immobile indices and CQ-free optimality criteria for linear copositive programming problems, Strong duality and minimal representations for cone optimization, A facial reduction algorithm for finding sparse SOS representations, A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms, An exact explicit dual for the linear copositive programming problem, Strong duality and dual pricing properties in semi-infinite linear programming: a non-Fourier-Motzkin elimination approach, A simplified treatment of Ramana's exact dual for semidefinite programming, New dual constraint qualifications characterizing zero duality gaps of convex programs and semidefinite programs, Optimality theorems for convex semidefinite vector optimization problems, Bad Semidefinite Programs: They All Look the Same, Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming, Constraint qualifications characterizing Lagrangian duality in convex optimization, A regularized strong duality for nonsymmetric semidefinite least squares problem, Best ellipsoidal relaxation to solve a nonconvex problem., Strong duality for inexact linear programming, Reduction of SISO H-infinity output feedback control problem, Numerical algebraic geometry and semidefinite programming, Refining the partition for multifold conic optimization problems, A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions, Necessary conditions and duality for inexact nonlinear semi-infinite programming problems, Cone-LP's and semidefinite programs: Geometry and a simplex-type method, Revisiting some rules of convex analysis, Conic programming: infeasibility certificates and projective geometry, Optimality criteria without constraint qualifications for linear semidefinite problems, \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints, A closedness condition and its applications to DC programs with convex constraints, Semidefinite programming for discrete optimization and matrix completion problems, Application of facial reduction to H ∞ state feedback control problem, Preprocessing and Regularization for Degenerate Semidefinite Programs, A note on the minimal cone for conic linear programming, Sequential Lagrangian conditions for convex programs with applications to semidefinite programming, A relaxed cutting plane method for semi-infinite semi-definite programming, Validating numerical semidefinite programming solvers for polynomial invariants, Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone, A proximal DC approach for quadratic assignment problem, Douglas-Rachford splitting and ADMM for pathological convex optimization, Understanding linear semi-infinite programming via linear programming over cones, Euclidean Distance Matrices and Applications, Solving semidefinite programs using preconditioned conjugate gradients, Duality for inexact semi-infinite linear programming, FLOW ON DATA NETWORK AND A POSITIVE SEMIDEFINITE REPRESENTABLE DELAY FUNCTION, Duality for semi-definite and semi-infinite programming, The minimal cone for conic linear programming, Strong duality for standard convex programs, Characterization of the barrier parameter of homogeneous convex cones, Solving SDP completely with an interior point oracle, Unnamed Item, Exact Duality in Semidefinite Programming Based on Elementary Reformulations, Knowledge-based semidefinite linear programming classifiers, On the Slater condition for the SDP relaxations of nonconvex sets, Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming
