Stopping criteria for inner iterations in inexact potential reduction methods: a computational study
From MaRDI portal
Publication:2643619
DOI10.1007/s10589-006-9007-7zbMath1148.90348OpenAlexW2087015041WikidataQ58832855 ScholiaQ58832855MaRDI QIDQ2643619
Daniela di Serafino, Sonia Cafieri, Valentina De Simone, Marco D'apuzzo
Publication date: 27 August 2007
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-006-9007-7
Related Items
Starting-point strategies for an infeasible potential reduction method ⋮ On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods ⋮ On the update of constraint preconditioners for regularized KKT systems ⋮ A comparison of reduced and unreduced KKT systems arising from interior point methods ⋮ Updating Constraint Preconditioners for KKT Systems in Quadratic Programming Via Low-Rank Corrections ⋮ A New Stopping Criterion for Krylov Solvers Applied in Interior Point Methods ⋮ General-purpose preconditioning for regularized interior point methods ⋮ Stability and accuracy of inexact interior point methods for convex quadratic programming ⋮ Switching preconditioners using a hybrid approach for linear systems arising from interior point methods for linear programming ⋮ Convergence analysis of an inexact potential reduction method for convex quadratic programming ⋮ Block preconditioners for linear systems in interior point methods for convex constrained optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Potential-reduction methods in mathematical programming
- Inexact interior-point method
- Preconditioning indefinite systems in interior point methods for optimization
- 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
- A Centered Projective Algorithm for Linear Programming
- Numerical solution of saddle point problems
- Iterative Solution of Augmented Systems Arising in Interior Methods
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- Inexact Newton Methods
- Constraint Preconditioning for Indefinite Linear Systems
- Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
- Krylov Subspace Methods for Saddle Point Problems with Indefinite Preconditioning
- Interior Methods for Nonlinear Optimization
- Block-diagonal and indefinite symmetric preconditioners for mixed finite element formulations
- Preconditioning Mixed Finite Element Saddle-point Elliptic Problems
- Constraint-Style Preconditioners for Regularized Saddle Point Problems
- Indefinitely preconditioned conjugate gradient method for large sparse equality and inequality constrained quadratic problems
- Implicit-Factorization Preconditioning and Iterative Solvers for Regularized Saddle-Point Systems
- Large-Scale Scientific Computing
- Benchmarking optimization software with performance profiles.
This page was built for publication: Stopping criteria for inner iterations in inexact potential reduction methods: a computational study
