Strong duality and minimal representations for cone optimization
From MaRDI portal
Publication:1928754
DOI10.1007/S10589-012-9480-0zbMath1284.90080OpenAlexW1964916956MaRDI QIDQ1928754
Henry Wolkowicz, Tunçel, Levent
Publication date: 4 January 2013
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-012-9480-0
semidefinite programmingstrict complementaritydualityduality gapconstraint qualificationpreprocessingcone optimizationdevious conesfacially dual complete conesnice cones
Cites Work
- Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
- A stable primal-dual approach for linear programming under nondegeneracy assumptions
- Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems
- Set intersection theorems and existence of optimal solutions
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- Cone extreme points and faces
- Applications of second-order cone programming
- Regularizing the abstract convex program
- Some applications of optimization in matrix theory
- On the existence and nonexistence of Lagrange multipliers in Banach spaces
- Regularity and stability for the mathematical programming problem in Banach spaces
- Some perturbation theory for linear programming
- An exact duality theory for semidefinite programming and its complexity implications
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- Semidefinite programming relaxations for the quadratic assignment problem
- First- and second-order methods for semidefinite programming
- Second-order cone programming
- Semidefinite programming
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- On the Slater condition for the SDP relaxations of nonconvex sets
- On Nesterov's approach to semi-infinite programming
- Linear programming, complexity theory and elementary functional analysis
- Generating and measuring instances of hard semidefinite programs
- Semidefinite programming relaxations for the graph partitioning problem
- Invariance and efficiency of convex representations
- The lattice of faces of a finite dimensional cone
- Cones, matrices and mathematical programming
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
- Addendum to "Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method"
- Preprocessing sparse semidefinite programs via matrix completion
- Semidefinite optimization
- Optimization and nonsmooth analysis
- Characterizations of optimality without constraint qualification for the abstract convex program
- Technical Note—Optimality Conditions and Recession Cones
- On point classification in convex sets.
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- Faces and duality in convex cones
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
- Strong Duality for Semidefinite Programming
- Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
- Relating Homogeneous Cones and Positive Definite Cones via T-Algebras
- Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
- On the Convergence of the Central Path in Semidefinite Optimization
- Notes on Duality in Second Order and p -Order Cone Optimization
- Incorporating Condition Measures into the Complexity Theory of Linear Programming
- On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming
- On the Closedness of the Linear Image of a Closed Convex Cone
- Semidefinite Approximations for Global Unconstrained Polynomial Optimization
- LMI Approximations for Cones of Positive Semidefinite Forms
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- Preprocessing and Regularization for Degenerate Semidefinite Programs
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
Related Items (23)
On equivalent representations and properties of faces of the cone of copositive matrices ⋮ Status determination by interior-point methods for convex optimization problems in domain-driven form ⋮ On strong duality in linear copositive programming ⋮ Kurdyka-Łojasiewicz exponent via inf-projection ⋮ Immobile indices and CQ-free optimality criteria for linear copositive programming problems ⋮ Facial Reduction and Partial Polyhedrality ⋮ An exact explicit dual for the linear copositive programming problem ⋮ Optimization under uncertainty and risk: quadratic and copositive approaches ⋮ Lagrangian duality in convex conic programming with simple proofs ⋮ Bad Semidefinite Programs: They All Look the Same ⋮ A complementarity partition theorem for multifold conic systems ⋮ Amenable cones: error bounds without constraint qualifications ⋮ Refining the partition for multifold conic optimization problems ⋮ Preprocessing and Regularization for Degenerate Semidefinite Programs ⋮ Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone ⋮ Douglas-Rachford splitting and ADMM for pathological convex optimization ⋮ Optimality conditions for linear copositive programming problems with isolated immobile indices ⋮ Linear semidefinite programming problems: regularisation and strong dual formulations ⋮ Facially Dual Complete (Nice) Cones and Lexicographic Tangents ⋮ Strict Complementarity in Semidefinite Optimization with Elliptopes Including the MaxCut SDP ⋮ Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs ⋮ Solving SDP completely with an interior point oracle ⋮ A search for quantum coin-flipping protocols using optimization techniques
This page was built for publication: Strong duality and minimal representations for cone optimization
