Steplength selection in interior-point methods for quadratic programming
From MaRDI portal
Publication:2455431
Recommendations
- Steplengths in interior-point algorithms of quadratic programming
- scientific article; zbMATH DE number 679874
- A primal-dual interior-point algorithm for quadratic programming
- A stable interior point method for convex quadratic programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
Cites work
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- A repository of convex quadratic programming problems
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- An interior-point algorithm for nonconvex nonlinear programming
- Benchmarking optimization software with performance profiles.
- Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives
- LOQO:an interior point code for quadratic programming
- Linear programming. Foundations and extensions
- On the Implementation of a Primal-Dual Interior Point Method
- Steplengths in interior-point algorithms of quadratic programming
Cited in
(3)- Steplength selection in gradient projection methods for box-constrained quadratic programs
- PNKH-B: A Projected Newton--Krylov Method for Large-Scale Bound-Constrained Optimization
- An iterative solver-based long-step infeasible primal-dual path-following algorithm for convex QP based on a class of preconditioners
This page was built for publication: Steplength selection in interior-point methods for quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2455431)