Strong duality and minimal representations for cone optimization
From MaRDI portal
Publication:1928754
Recommendations
Cites work
- scientific article; zbMATH DE number 3121284 (Why is no real title available?)
- scientific article; zbMATH DE number 3121286 (Why is no real title available?)
- scientific article; zbMATH DE number 3711742 (Why is no real title available?)
- scientific article; zbMATH DE number 3737415 (Why is no real title available?)
- scientific article; zbMATH DE number 3465111 (Why is no real title available?)
- scientific article; zbMATH DE number 3466135 (Why is no real title available?)
- scientific article; zbMATH DE number 3525695 (Why is no real title available?)
- scientific article; zbMATH DE number 1303653 (Why is no real title available?)
- scientific article; zbMATH DE number 1534290 (Why is no real title available?)
- scientific article; zbMATH DE number 1821400 (Why is no real title available?)
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- scientific article; zbMATH DE number 2246591 (Why is no real title available?)
- A stable primal-dual approach for linear programming under nondegeneracy assumptions
- Addendum to ``Presolve analysis of linear programs prior to applying an interior point method
- An exact duality theory for semidefinite programming and its complexity implications
- Applications of second-order cone programming
- Behavioral measures and their correlation with IPM iteration counts on semi-definite programming problems
- Characterizations of optimality without constraint qualification for the abstract convex program
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm
- Cone extreme points and faces
- Cones, matrices and mathematical programming
- Explicit sensor network localization using semidefinite representations and facial reductions
- Faces and duality in convex cones
- First- and second-order methods for semidefinite programming
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- Generating and measuring instances of hard semidefinite programs
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Incorporating Condition Measures into the Complexity Theory of Linear Programming
- Invariance and efficiency of convex representations
- LMI Approximations for Cones of Positive Semidefinite Forms
- Linear programming, complexity theory and elementary functional analysis
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- Notes on Duality in Second Order and p -Order Cone Optimization
- On Nesterov's approach to semi-infinite programming
- On point classification in convex sets.
- On the Closedness of the Linear Image of a Closed Convex Cone
- On the Convergence of the Central Path in Semidefinite Optimization
- On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming
- On the Slater condition for the SDP relaxations of nonconvex sets
- On the existence and nonexistence of Lagrange multipliers in Banach spaces
- Optimization and nonsmooth analysis
- Preprocessing and regularization for degenerate semidefinite programs
- Preprocessing sparse semidefinite programs via matrix completion
- Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
- Regularity and stability for the mathematical programming problem in Banach spaces
- Regularizing the abstract convex program
- Relating Homogeneous Cones and Positive Definite Cones via T-Algebras
- Second-order cone programming
- Semidefinite Approximations for Global Unconstrained Polynomial Optimization
- Semidefinite optimization
- Semidefinite programming
- Semidefinite programming relaxations for the graph partitioning problem
- Semidefinite programming relaxations for the quadratic assignment problem
- Set intersection theorems and existence of optimal solutions
- Some applications of optimization in matrix theory
- Some perturbation theory for linear programming
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- Stability of closedness of convex cones under linear mappings
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
- Strong Duality for Semidefinite Programming
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming
- Superlinear convergence of a predictor-corrector method for semidefinite programming without shrinking central path neighborhood
- Technical Note—Optimality Conditions and Recession Cones
- The lattice of faces of a finite dimensional cone
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
- Immobile indices and CQ-free optimality criteria for linear copositive programming problems
- Characterizing bad semidefinite programs: normal forms and short proofs
- 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
- Dual approaches to the minimization of strongly convex functionals with a simple structure under affine constraints
- Strict complementarity in semidefinite optimization with elliptopes including the maxcut SDP
- 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
- Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
- Facial reduction and partial polyhedrality
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)
