Starting-point strategies for an infeasible potential reduction method
From MaRDI portal
Publication:845561
DOI10.1007/s11590-009-0150-9zbMath1181.90210OpenAlexW2009695216WikidataQ58832837 ScholiaQ58832837MaRDI QIDQ845561
Valentina De Simone, Marco D'apuzzo, Daniela di Serafino
Publication date: 29 January 2010
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-009-0150-9
Related Items
On the update of constraint preconditioners for regularized KKT systems ⋮ Updating Constraint Preconditioners for KKT Systems in Quadratic Programming Via Low-Rank Corrections ⋮ Interior point methods 25 years later ⋮ Convex optimization techniques in compliant assembly simulation
Uses Software
Cites Work
- A starting point strategy for nonlinear interior methods.
- Interior-point solver for large-scale quadratic programming problems with bound constraints
- On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems
- Convergence analysis of an inexact potential reduction method for convex quadratic programming
- Stopping criteria for inner iterations in inexact potential reduction methods: a computational study
- On the Implementation of a Primal-Dual Interior Point Method
- LOQO:an interior point code for quadratic programming
- Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
- Object-oriented software for quadratic programming
- CUTEr and SifDec
- Benchmarking optimization software with performance profiles.
- Unnamed Item
- Unnamed Item
