We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming.
- Authors
Zhang, Rui-Jin; Liu, Xin-Wei; Dai, Yu-Hong
- Abstract
We propose IPRQP, an enhanced primal-dual interior-point relaxation method (IPRM), for solving convex quadratic programming. This method is based on a smoothing barrier augmented Lagrangian function for convex quadratic programming. IPRQP inherits the advantages of IPRM, including not requiring iterative points to be interior points, which makes IPRQP suitable for the warm-starting of combinatorial optimization problems. Compared to IPRM, the customized starting points allow the line search of IPRQP to contain only vector operations. In addition, IPRQP improves the updating scheme of the barrier parameter and provides a certificate of infeasibility. Some results on global convergence are presented. We implement the algorithm on convex quadratic programming problems from Maros-Mészaros and the benchmark problem sets NETLIB and Kennington, which contain feasible and infeasible linear programming problems. The numerical results show that our algorithm is reliable for feasible problems and efficient for detecting the infeasibility of infeasible problems.
- Subjects
INTERIOR-point methods; CONVEX programming; QUADRATIC programming; LINEAR programming; ALGORITHMS; LAGRANGIAN functions
- Publication
Journal of Global Optimization, 2023, Vol 87, Issue 2-4, p1027
- ISSN
0925-5001
- Publication type
Article
- DOI
10.1007/s10898-023-01314-8