Neighborhood-following algorithms for symmetric cone programming

DOI10.1360/012011-577MaRDI QIDQ5017863zbMATH OpenOpenAlexFDO

Authors

Publication date 17 December 2021

Published in SCIENTIA SINICA Mathematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1360/012011-577

zbMATH Keywords

Euclidean Jordan algebrainterior-point methodneighborhood-following algorithmpolynomial complexitysymmetric cone programmingwide neighborhood

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Interior-point methods (90C51)

Recommendations

• A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming
• Two wide neighborhood interior-point methods for symmetric cone optimization
• A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
• A new infeasible-interior-point algorithm for linear programming over symmetric cones
• Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions

Cited in

(5)

• Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions
• Neighborhood-following algorithms for linear programming
• Two wide neighborhood interior-point methods for symmetric cone optimization
• A new infeasible-interior-point algorithm for linear programming over symmetric cones
• A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming

This page was built for publication: Neighborhood-following algorithms for symmetric cone programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5017863)