对称锥规划的邻域跟踪算法

DOI10.1360/012011-577zbMath1488.90138OpenAlexW2616746796MaRDI QIDQ5017863

No author found.

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

interior-point methodpolynomial complexityEuclidean Jordan algebrawide neighborhoodsymmetric cone programmingneighborhood-following algorithm

Mathematics Subject Classification ID

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

Related Items (3)

A new infeasible-interior-point algorithm based on wide neighborhoods 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

This page was built for publication: 对称锥规划的邻域跟踪算法