Two new predictor-corrector algorithms for second-order cone programming
From MaRDI portal
Publication:536560
DOI10.1007/s10483-011-1435-xzbMath1220.90093MaRDI QIDQ536560
Chun-Ming Tang, You-fang Zeng, Jin-Bao Jian, Yan-Qin Bai
Publication date: 19 May 2011
Published in: Applied Mathematics and Mechanics. (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10483-011-1435-x
global convergence; predictor-corrector algorithm; complexity analysis; second-order cone programming; infeasible interior-point algorithm
Related Items
Uses Software
Cites Work
- An infeasible-interior-point predictor-corrector algorithm for the second-order cone program
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
- Applications of second-order cone programming
- Second-order cone programming
- Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
- Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs
- Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems
- A semismooth Newton method for SOCCPs based on a one-parametric class of SOC complementarity functions
- Lower bound limit analysis of cohesive-frictional materials using second-order cone programming
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Large‐deformation and friction analysis of non‐linear elastic cable networks by second‐order cone programming
- Two Infeasible Interior-Point Predictor-Corrector Algorithms for Linear Programming
