Strong duality and minimal representations for cone optimization
From MaRDI portal
Publication:1928754
DOI10.1007/S10589-012-9480-0zbMATH Open1284.90080OpenAlexW1964916956MaRDI QIDQ1928754FDOQ1928754
Authors: Henry Wolkowicz, Levent Tunçel 
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
Recommendations
semidefinite programmingdualityduality gapconstraint qualificationpreprocessingstrict complementaritycone optimizationdevious conesfacially dual complete conesnice cones
Cites Work
- Explicit sensor network localization using semidefinite representations and facial reductions
- Regularity and stability for the mathematical programming problem in Banach spaces
- Optimization and nonsmooth analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Applications of second-order cone programming
- Some perturbation theory for linear programming
- An exact duality theory for semidefinite programming and its complexity implications
- Second-order cone programming
- Semidefinite optimization
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Incorporating Condition Measures into the Complexity Theory of Linear Programming
- LMI Approximations for Cones of Positive Semidefinite Forms
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Title not available (Why is that?)
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- Stability of closedness of convex cones under linear mappings
- Semidefinite programming relaxations for the quadratic assignment problem
- Regularizing the abstract convex program
- Title not available (Why is that?)
- Title not available (Why is that?)
- The lattice of faces of a finite dimensional cone
- Set intersection theorems and existence of optimal solutions
- On the Closedness of the Linear Image of a Closed Convex Cone
- Strong Duality for Semidefinite Programming
- On the Convergence of the Central Path in Semidefinite Optimization
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
- Semidefinite programming relaxations for the graph partitioning problem
- Cones, matrices and mathematical programming
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- Some applications of optimization in matrix theory
- Semidefinite programming
- Invariance and efficiency of convex representations
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
- On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming
- Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
- Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
- On Nesterov's approach to semi-infinite programming
- Title not available (Why is that?)
- Relating Homogeneous Cones and Positive Definite Cones via T-Algebras
- Linear programming, complexity theory and elementary functional analysis
- Title not available (Why is that?)
- Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
- Semidefinite Approximations for Global Unconstrained Polynomial Optimization
- Title not available (Why is that?)
- Notes on Duality in Second Order and p -Order Cone Optimization
- On the existence and nonexistence of Lagrange multipliers in Banach spaces
- First- and second-order methods for semidefinite programming
- Superlinear convergence of a predictor-corrector method for semidefinite programming without shrinking central path neighborhood
- A stable primal-dual approach for linear programming under nondegeneracy assumptions
- Preprocessing and regularization for degenerate semidefinite programs
- Characterizations of optimality without constraint qualification for the abstract convex program
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- On point classification in convex sets.
- Title not available (Why is that?)
- Faces and duality in convex cones
- Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems
- Title not available (Why is that?)
- Preprocessing sparse semidefinite programs via matrix completion
- Title not available (Why is that?)
- Cone extreme points and faces
- Technical Note—Optimality Conditions and Recession Cones
- On the Slater condition for the SDP relaxations of nonconvex sets
- Generating and measuring instances of hard semidefinite programs
- Addendum to ``Presolve analysis of linear programs prior to applying an interior point method
- Title not available (Why is that?)
Cited In (27)
- Douglas-Rachford splitting and ADMM for pathological convex optimization
- Optimality conditions for linear copositive programming problems with isolated immobile indices
- A search for quantum coin-flipping protocols using optimization techniques
- Facially dual complete (nice) cones and lexicographic tangents
- The orthogonal complement of faces for cones associated with the cone of positive semidefinite matrices
- On equivalent representations and properties of faces of the cone of copositive matrices
- Amenable cones: error bounds without constraint qualifications
- Preprocessing and regularization for degenerate semidefinite programs
- Kurdyka-Łojasiewicz exponent via inf-projection
- The strong conical hull intersection property for convex programming
- On strong duality in linear copositive programming
- Status determination by interior-point methods for convex optimization problems in domain-driven form
- Characterizing bad semidefinite programs: normal forms and short proofs
- Immobile indices and CQ-free optimality criteria for linear copositive programming problems
- An exact explicit dual for the linear copositive programming problem
- The minimal cone for conic linear programming
- Lagrangian duality in convex conic programming with simple proofs
- Strict complementarity in semidefinite optimization with elliptopes including the maxcut SDP
- Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints
- A complementarity partition theorem for multifold conic systems
- Optimization under uncertainty and risk: quadratic and copositive approaches
- Solving SDP completely with an interior point oracle
- Linear semidefinite programming problems: regularisation and strong dual formulations
- Refining the partition for multifold conic optimization problems
- Bad semidefinite programs: they all look the same
- Facial reduction and partial polyhedrality
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
This page was built for publication: Strong duality and minimal representations for cone optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928754)
