A corrector–predictor path-following method for second-order cone optimization
From MaRDI portal
Publication:2958275
DOI10.1080/00207160.2015.1085028zbMath1355.90106OpenAlexW2310020878MaRDI QIDQ2958275
Publication date: 1 February 2017
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2015.1085028
Related Items (6)
A logarithmic barrier interior-point method based on majorant functions for second-order cone programming ⋮ A new corrector-predictor interior-point method for symmetric cone optimization ⋮ Corrector-predictor interior-point method with new search direction for semidefinite optimization ⋮ A corrector-predictor interior-point method with new search direction for linear optimization ⋮ Unnamed Item ⋮ A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function
Cites Work
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
- Applications of second-order cone programming
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- Second-order cone programming
- Geometric means on symmetric cones
- A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
- A corrector-predictor path-following method for convex quadratic symmetric cone optimization
- On the coerciveness of some merit functions for complementarity problems over symmetric cones
- A corrector–predictor path-following algorithm for semidefinite optimization
- A predictor-corrector path-following algorithm for symmetric optimization based on Darvay's technique
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
- A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function
This page was built for publication: A corrector–predictor path-following method for second-order cone optimization
