A polynomial predictor-corrector interior-point algorithm for convex quadratic programming
From MaRDI portal
Publication:2495533
DOI10.1016/S0252-9602(06)60048-9zbMath1092.90034MaRDI QIDQ2495533
Qian Yu, Yan Jiang, Chong-Chao Huang
Publication date: 30 June 2006
Published in: Acta Mathematica Scientia. Series B. (English Edition) (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Interior-point methods (90C51)
Related Items (5)
A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints ⋮ A new primal-dual interior-point algorithm for convex quadratic optimization ⋮ Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier ⋮ Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems ⋮ A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function
This page was built for publication: A polynomial predictor-corrector interior-point algorithm for convex quadratic programming
