Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity
type: Item
instance of: scholarly article
title: Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity
zbMATH Open document ID: 1428.90176
DOI: 10.1080/10556788.2018.1528249
author: Ali Mohammad Nezhad
author: Tamás Terlaky
publication date: 2019-10-02T00:00:00Z
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 7111870
zbMATH Keywords: second-order conic optimization
zbMATH Keywords: optimal partition
zbMATH Keywords: quadratic convergence
zbMATH Keywords: maximally complementary optimal solution
zbMATH Keywords: nondegeneracy conditions
describes a project that uses: SeDuMi
describes a project that uses: CVX
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1080/10556788.2018.1528249
OpenAlex ID: W2896895332
cites work: Second-order cone programming
cites work: Complementarity and nondegeneracy in semidefinite programming
cites work: Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
cites work: Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
cites work: Perturbation analysis of second-order cone programming problems
cites work: Q4503250
cites work: Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
cites work: A non-interior continuation method for second-order cone programming
cites work: A one-step smoothing Newton method for second-order cone programming
cites work: Q3702408
cites work: Graph Implementations for Nonsmooth Convex Programs
cites work: Quadratic Convergence of a Nonsmooth Newton-Type Method for Semidefinite Programs Without Strict Complementarity
cites work: On the Local Convergence of Semismooth Newton Methods for Linear and Nonlinear Second-Order Cone Programs Without Strict Complementarity
cites work: Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity
cites work: Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming
cites work: Applications of second-order cone programming
cites work: Finding an interior point in the optimal face of linear programs
cites work: On the identification of the optimal partition for semidefinite optimization
cites work: A polynomial primal-dual affine scaling algorithm for symmetric conic optimization
cites work: Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
cites work: Q4324980
cites work: Self-Scaled Barriers and Interior-Point Methods for Convex Programming
cites work: Primal-Dual Interior-Point Methods for Self-Scaled Cones
cites work: Q5491447
cites work: An exact duality theory for semidefinite programming and its complexity implications
cites work: On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae
cites work: Q3998482
cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
cites work: Error Bounds for Linear Matrix Inequalities
cites work: On the Identification of the Optimal Partition of Second Order Cone Optimization Problems
cites work: A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
cites work: Generating and measuring instances of hard semidefinite programs
cites work: On the finite convergence of interior-point algorithms for linear programming
published in: Optimization Methods \& Software
description: scientific article; zbMATH DE number 7111870