Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity
From MaRDI portal
Publication:5198048
DOI10.1080/10556788.2018.1528249zbMath1428.90176OpenAlexW2896895332MaRDI QIDQ5198048
Tamás Terlaky, Ali Mohammad Nezhad
Publication date: 2 October 2019
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2018.1528249
optimal partitionquadratic convergencesecond-order conic optimizationnondegeneracy conditionsmaximally complementary optimal solution
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polynomial primal-dual affine scaling algorithm for symmetric conic optimization
- Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming
- On the finite convergence of interior-point algorithms for linear programming
- A one-step smoothing Newton method for second-order cone programming
- Applications of second-order cone programming
- Finding an interior point in the optimal face of linear programs
- Complementarity and nondegeneracy in semidefinite programming
- An exact duality theory for semidefinite programming and its complexity implications
- Second-order cone programming
- Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
- Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity
- Generating and measuring instances of hard semidefinite programs
- Perturbation analysis of second-order cone programming problems
- Lectures on Modern Convex Optimization
- Graph Implementations for Nonsmooth Convex Programs
- Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
- A non-interior continuation method for second-order cone programming
- On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Error Bounds for Linear Matrix Inequalities
- On the Identification of the Optimal Partition of Second Order Cone Optimization Problems
- On the Local Convergence of Semismooth Newton Methods for Linear and Nonlinear Second-Order Cone Programs Without Strict Complementarity
- Quadratic Convergence of a Nonsmooth Newton-Type Method for Semidefinite Programs Without Strict Complementarity
- On the identification of the optimal partition for semidefinite optimization
