IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming
From MaRDI portal
Publication:6064060
DOI10.1007/s10898-023-01314-8zbMath1528.90178MaRDI QIDQ6064060
Xin-Wei Liu, Yu-Hong Dai, Rui-Jin Zhang
Publication date: 8 November 2023
Published in: Journal of Global Optimization (Search for Journal in Brave)
convex quadratic programminginfeasibility detectioninterior-point relaxation methodsmoothing barrier augmented Lagrangian
Derivative-free methods and methods using generalized derivatives (90C56) Quadratic programming (90C20) Interior-point methods (90C51)
Cites Work
- Unnamed Item
- Unnamed Item
- OSQP: An Operator Splitting Solver for Quadratic Programs
- Matrix-free interior point method
- qpOASES: a parametric active-set algorithm for~quadratic programming
- A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs
- Warm start of the primal-dual method applied in the cutting-plane scheme
- Recent advances in quadratic programming algorithms for nonlinear model predictive control
- An interior point-proximal method of multipliers for convex quadratic programming
- A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs
- FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming
- Infeasibility detection in the alternating direction method of multipliers for convex optimization
- The polynomial solvability of convex quadratic programming
- On the Implementation of a Primal-Dual Interior Point Method
- A repository of convex quadratic programming problems
- Computational Experience with an Interior Point Cutting Plane Algorithm
- A globally convergent primal-dual interior-point relaxation method for nonlinear programs
- Object-oriented software for quadratic programming
- A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints
- Benchmarking optimization software with performance profiles.
This page was built for publication: IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming
