Convergence analysis of an inexact potential reduction method for convex quadratic programming
From MaRDI portal
Publication:2483035
DOI10.1007/S10957-007-9264-3zbMATH Open1146.90049OpenAlexW1994720245WikidataQ58832847 ScholiaQ58832847MaRDI QIDQ2483035FDOQ2483035
Authors: Sonia Cafieri, V. De Simone, D. di Serafino, Gerardo Toraldo, M. D'Apuzzo 
Publication date: 5 May 2008
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-007-9264-3
Recommendations
- Convergence analysis of an inexact feasible interior point method for convex quadratic programming
- Convergence analysis of inexact infeasible-interior-point algorithms for solving linear programming problems
- Stopping criteria for inner iterations in inexact potential reduction methods: a computational study
- scientific article; zbMATH DE number 2059753
- Global convergence of an inexact interior-point method for convex quadratic symmetric cone programming
Cites Work
- Numerical solution of saddle point problems
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- Potential-reduction methods in mathematical programming
- A Centered Projective Algorithm for Linear Programming
- Title not available (Why is that?)
- Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
- Convergence analysis of inexact infeasible-interior-point algorithms for solving linear programming problems
- Interior-point solver for large-scale quadratic programming problems with bound constraints
- Title not available (Why is that?)
- Stopping criteria for inner iterations in inexact potential reduction methods: a computational study
- Large-Scale Scientific Computing
Cited In (13)
- Block preconditioners for linear systems in interior point methods for convex constrained optimization
- Interior point methods 25 years later
- Semi-supervised generalized eigenvalues classification
- Convergence analysis of an inexact feasible interior point method for convex quadratic programming
- A New Stopping Criterion for Krylov Solvers Applied in Interior Point Methods
- Updating constraint preconditioners for KKT systems in quadratic programming via low-rank corrections
- Sparse approximations with interior point methods
- Starting-point strategies for an infeasible potential reduction method
- On the update of constraint preconditioners for regularized KKT systems
- Stopping criteria for inner iterations in inexact potential reduction methods: a computational study
- Inexact log-domain interior-point methods for quadratic programming
- An exterior point polynomial-time algorithm for convex quadratic programming
- On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods
Uses Software
This page was built for publication: Convergence analysis of an inexact potential reduction method for convex quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2483035)
