Arc-Search Techniques for Interior-Point Methods
From MaRDI portal
Publication:5113827
DOI10.1201/9781003042518zbMath1448.90002OpenAlexW3045501478MaRDI QIDQ5113827
Publication date: 18 June 2020
Full work available at URL: https://doi.org/10.1201/9781003042518
Semidefinite programming (90C22) Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20) Linear programming (90C05) Interior-point methods (90C51) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Related Items (3)
An efficient arc-search interior-point algorithm for convex quadratic programming with box constraints ⋮ 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
This page was built for publication: Arc-Search Techniques for Interior-Point Methods