Starting-point strategies for an infeasible potential reduction method
From MaRDI portal
Publication:845561
DOI10.1007/S11590-009-0150-9zbMATH Open1181.90210OpenAlexW2009695216WikidataQ58832837 ScholiaQ58832837MaRDI QIDQ845561FDOQ845561
Authors: M. D'Apuzzo, V. De Simone, D. 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
Recommendations
- Stopping criteria for inner iterations in inexact potential reduction methods: a computational study
- Potential-reduction methods in mathematical programming
- An infeasible point method for minimizing the Lennard-Jones potential
- scientific article; zbMATH DE number 1047677
- Infeasible potential reduction algorithms for semidefinite programming
- A constructive approach to quasi-steady state reductions
- scientific article; zbMATH DE number 1532777
- scientific article; zbMATH DE number 3931150
- A starting point strategy for nonlinear interior methods.
- An interior point potential reduction method for constrained equations
Cites Work
- Title not available (Why is that?)
- LOQO:an interior point code for quadratic programming
- Object-oriented software for quadratic programming
- CUTEr and SifDec
- On the Implementation of a Primal-Dual Interior Point Method
- Title not available (Why is that?)
- Benchmarking optimization software with performance profiles.
- Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
- Convergence analysis of an inexact potential reduction method for convex quadratic programming
- 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
- A starting point strategy for nonlinear interior methods.
- Stopping criteria for inner iterations in inexact potential reduction methods: a computational study
Cited In (5)
- Interior point methods 25 years later
- Convex optimization techniques in compliant assembly simulation
- Updating constraint preconditioners for KKT systems in quadratic programming via low-rank corrections
- On the update of constraint preconditioners for regularized KKT systems
- An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods
Uses Software
This page was built for publication: Starting-point strategies for an infeasible potential reduction method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845561)
