Steplength selection in interior-point methods for quadratic programming
From MaRDI portal
Publication:2455431
DOI10.1016/j.aml.2006.05.020zbMath1161.90452OpenAlexW2070265719MaRDI QIDQ2455431
Frank E. Curtis, Nocedal, Jorge
Publication date: 24 October 2007
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2006.05.020
Related Items
Uses Software
Cites Work
- Unnamed Item
- An interior-point algorithm for nonconvex nonlinear programming
- Steplengths in interior-point algorithms of quadratic programming
- On the Implementation of a Primal-Dual Interior Point Method
- Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives
- LOQO:an interior point code for quadratic programming
- A repository of convex quadratic programming problems
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- Linear programming. Foundations and extensions
- Benchmarking optimization software with performance profiles.