A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming

DOI10.1080/10556788.2022.2060970OpenAlexW4280511887MaRDI QIDQ5058407

No author found.

Publication date: 20 December 2022

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556788.2022.2060970

zbMATH Keywords

Euclidean Jordan algebrawide neighbourhoodsymmetric cone programminginfeasible-interior-point algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Cites Work

• Unnamed Item
• A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones
• A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood
• A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization
• A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
• A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming
• Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming
• Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
• Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
• A new primal-dual path-following interior-point algorithm for semidefinite optimization
• Linear systems in Jordan algebras and primal-dual interior-point algorithms
• Extension of primal-dual interior point algorithms to symmetric cones
• Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
• A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization
• An arc-search predictor-corrector infeasible-interior-point algorithm for \(P_\ast(\kappa)\)-SCLCPs
• Neighborhood-following algorithms for linear programming
• Two wide neighborhood interior-point methods for symmetric cone optimization
• On the Nesterov--Todd Direction in Semidefinite Programming
• Barrier Functions in Interior Point Methods
• Primal-Dual Interior-Point Methods for Self-Scaled Cones
• An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
• Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones

This page was built for publication: A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming