Strong duality and minimal representations for cone optimization
type: Item
instance of: scholarly article
title: Strong duality and minimal representations for cone optimization
zbMATH Open document ID: 1284.90080
author: Henry Wolkowicz
author: Levent Tunçel
published in: Computational Optimization and Applications
publication date: 2013-01-04T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C22
zbMATH DE Number: 6121902
zbMATH Keywords: cone optimization
zbMATH Keywords: duality
zbMATH Keywords: preprocessing
zbMATH Keywords: constraint qualification
zbMATH Keywords: duality gap
zbMATH Keywords: semidefinite programming
zbMATH Keywords: strict complementarity
zbMATH Keywords: nice cones
zbMATH Keywords: devious cones
zbMATH Keywords: facially dual complete cones
MaRDI profile type: Publication
full work available at URL: s10589-012-9480-0
OpenAlex ID: W1964916956
cites work: Technical Note—Optimality Conditions and Recession Cones
cites work: Second-order cone programming
cites work: Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
cites work: Notes on Duality in Second Order and p -Order Cone Optimization
cites work: Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
cites work: Q4779970
cites work: The lattice of faces of a finite dimensional cone
cites work: Faces and duality in convex cones
cites work: Q3902815
cites work: Cones, matrices and mathematical programming
cites work: Set intersection theorems and existence of optimal solutions
cites work: Q5852055
cites work: Q3923971
cites work: Regularizing the abstract convex program
cites work: Characterizations of optimality without constraint qualification for the abstract convex program
cites work: Q4051229
cites work: Preprocessing and Regularization for Degenerate Semidefinite Programs
cites work: Relating Homogeneous Cones and Positive Definite Cones via T-Algebras
cites work: Invariance and efficiency of convex representations
cites work: Optimization and nonsmooth analysis
cites work: Q4250283
cites work: Q3236244
cites work: On Nesterov's approach to semi-infinite programming
cites work: Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems
cites work: Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
cites work: Preprocessing sparse semidefinite programs via matrix completion
cites work: Q3236242
cites work: Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
cites work: A stable primal-dual approach for linear programming under nondegeneracy assumptions
cites work: Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
cites work: On the Convergence of the Central Path in Semidefinite Optimization
cites work: Semidefinite programming
cites work: Q4104377
cites work: Complete characterizations of stable Farkas' lemma and cone-convex programming duality
cites work: Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
cites work: On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming
cites work: Semidefinite Approximations for Global Unconstrained Polynomial Optimization
cites work: Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
cites work: Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
cites work: Q5717954
cites work: Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
cites work: Q4050413
cites work: On the existence and nonexistence of Lagrange multipliers in Banach spaces
cites work: Applications of second-order cone programming
cites work: Q5566063
cites work: Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
cites work: Addendum to ``Presolve analysis of linear programs prior to applying an interior point method''
cites work: First- and second-order methods for semidefinite programming
cites work: Cone extreme points and faces
cites work: On the Closedness of the Linear Image of a Closed Convex Cone
cites work: Superlinear convergence of a predictor-corrector method for semidefinite programming without shrinking central path neighborhood
cites work: An exact duality theory for semidefinite programming and its complexity implications
cites work: Strong Duality for Semidefinite Programming
cites work: Some perturbation theory for linear programming
cites work: Incorporating Condition Measures into the Complexity Theory of Linear Programming
cites work: Linear programming, complexity theory and elementary functional analysis

Strong duality and minimal representations for cone optimization (cites work)
cites work: Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems

Strong duality and minimal representations for cone optimization (cites work)
cites work: Q4517099

Strong duality and minimal representations for cone optimization (cites work)
cites work: Semidefinite optimization

Strong duality and minimal representations for cone optimization (cites work)
cites work: On the Slater condition for the SDP relaxations of nonconvex sets

Strong duality and minimal representations for cone optimization (cites work)
cites work: Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity

Strong duality and minimal representations for cone optimization (cites work)
cites work: On point classification in convex sets.

Strong duality and minimal representations for cone optimization (cites work)
cites work: Generating and measuring instances of hard semidefinite programs

Strong duality and minimal representations for cone optimization (cites work)
cites work: Some applications of optimization in matrix theory

Strong duality and minimal representations for cone optimization (cites work)
cites work: Handbook of semidefinite programming. Theory, algorithms, and applications

Strong duality and minimal representations for cone optimization (cites work)
cites work: Semidefinite programming relaxations for the graph partitioning problem

Strong duality and minimal representations for cone optimization (cites work)
cites work: Semidefinite programming relaxations for the quadratic assignment problem

Strong duality and minimal representations for cone optimization (cites work)
cites work: Regularity and stability for the mathematical programming problem in Banach spaces

Strong duality and minimal representations for cone optimization (cites work)
cites work: LMI Approximations for Cones of Positive Semidefinite Forms

Strong duality and minimal representations for cone optimization (DOI)
DOI: 10.1007/S10589-012-9480-0