Steplength selection in interior-point methods for quadratic programming
From MaRDI portal
Publication:2455431
DOI10.1016/J.AML.2006.05.020zbMATH Open1161.90452OpenAlexW2070265719MaRDI QIDQ2455431FDOQ2455431
Authors: Frank E. Curtis, Jorge Nocedal 
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
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
- LOQO:an interior point code for quadratic programming
- Linear programming. Foundations and extensions
- On the Implementation of a Primal-Dual Interior Point Method
- A repository of convex quadratic programming problems
- Title not available (Why is that?)
- Benchmarking optimization software with performance profiles.
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- An interior-point algorithm for nonconvex nonlinear programming
- Steplengths in interior-point algorithms of quadratic programming
- Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives
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
Uses Software
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)
