Arc-search techniques for interior-point methods

DOI10.1201/9781003042518MaRDI QIDQ5113827zbMATH OpenOpenAlexFDO

Authors Ya-Guang Yang

Publication date 18 June 2020

Full work available at URL https://doi.org/10.1201/9781003042518

Mathematics Subject Classification ID

Quadratic programming (90C20) Linear programming (90C05) Interior-point methods (90C51) Semidefinite programming (90C22) Abstract computational complexity for mathematical programming problems (90C60) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Recommendations

• scientific article; zbMATH DE number 1131479
• scientific article; zbMATH DE number 1017028
• An arc-search \({\mathcal {O}}(nL)\) infeasible-interior-point algorithm for linear programming
• The arc-search interior-point algorithm
• Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming

Cited in

(4)

• A polynomial time infeasible interior-point arc-search algorithm for convex optimization
• A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization
• An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints
• An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems

This page was built for publication: Arc-search techniques for interior-point methods

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