Starting-point strategies for an infeasible potential reduction method

DOI10.1007/S11590-009-0150-9MaRDI QIDQ845561zbMATH OpenOpenAlexWikidataFDO

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

Mathematics Subject Classification ID

Quadratic programming (90C20) Convex programming (90C25)

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

• scientific article; zbMATH DE number 5066287 (Why is no real title available?)
• scientific article; zbMATH DE number 964349 (Why is no real title available?)
• A starting point strategy for nonlinear interior methods.
• Benchmarking optimization software with performance profiles.
• CUTEr and SifDec
• Convergence analysis of an inexact potential reduction method for convex quadratic programming
• Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
• Interior-point solver for large-scale quadratic programming problems with bound constraints
• LOQO:an interior point code for quadratic programming
• Object-oriented software for quadratic programming
• On the Implementation of a Primal-Dual Interior Point Method
• On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems
• Stopping criteria for inner iterations in inexact potential reduction methods: a computational study

Cited in

(5)

• 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
• Convex optimization techniques in compliant assembly simulation
• Updating constraint preconditioners for KKT systems in quadratic programming via low-rank corrections
• Interior point methods 25 years later

Describes a project that uses

Uses Software

• KNITRO
• LOQO
• CUTEr
• SIFDecode
• OOQP

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)