A stable interior point method for convex quadratic programming
From MaRDI portal
Recommendations
- A New Practically Efficient Interior Point Method for Convex Quadratic Programming
- An interior Newton method for quadratic programming
- An interior point method for quadratic programs based on conjugate projected gradients
- An interior point method for general large-scale quadratic programming problems
- scientific article; zbMATH DE number 938989
Cited in
(26)- An interior point method for quadratic programs based on conjugate projected gradients
- A new linesearch method for quadratically constrained convex programming
- An interior Newton method for quadratic programming
- Fast interior point solution of quadratic programming problems arising from PDE-constrained optimization
- An interior point method for general large-scale quadratic programming problems
- Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems
- FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming
- Steplength selection in interior-point methods for quadratic programming
- A primal-dual interior-point algorithm for quadratic programming
- Solving quadratically constrained convex optimization problems with an interior-point method
- scientific article; zbMATH DE number 446510 (Why is no real title available?)
- scientific article; zbMATH DE number 5015748 (Why is no real title available?)
- Stable computation of interior point solutions for a class of nonlinear convex programming problems
- A New Practically Efficient Interior Point Method for Convex Quadratic Programming
- Numerically stable LDLT factorizations in interior point methods for convex quadratic programming
- scientific article; zbMATH DE number 3928729 (Why is no real title available?)
- scientific article; zbMATH DE number 1279834 (Why is no real title available?)
- scientific article; zbMATH DE number 1942620 (Why is no real title available?)
- LOQO:an interior point code for quadratic programming
- scientific article; zbMATH DE number 938989 (Why is no real title available?)
- A stable and efficient method for solving a convex quadratic program with application to optimal control
- Two interior point continuous trajectory models for convex quadratic programming with bound constraints
- An interior point algorithm for convex quadratic programming with strict equilibrium constraints
- IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming
- Log-domain interior-point methods for convex quadratic programming
- A new full-Newton step feasible interior point method for convex quadratic programming
This page was built for publication: A stable interior point method for convex quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5320362)
