Updating Constraint Preconditioners for KKT Systems in Quadratic Programming Via Low-Rank Corrections
From MaRDI portal
Publication:2947227
DOI10.1137/130947155zbMath1323.65064arXiv1312.0047OpenAlexW2964263181WikidataQ58832740 ScholiaQ58832740MaRDI QIDQ2947227
Valentina De Simone, Daniela di Serafino, Benedetta Morini, Stefania Bellavia
Publication date: 22 September 2015
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.0047
numerical examplesSchur complementconvex quadratic programminginterior point methodsKKT systemsconstraint preconditionersmatrix updatesKarush-Kuhn-Tucker (KKT) linear systems
Numerical mathematical programming methods (65K05) Convex programming (90C25) Quadratic programming (90C20) Interior-point methods (90C51) Preconditioners for iterative methods (65F08)
Related Items (11)
Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy ⋮ On preconditioner updates for sequences of saddle-point linear systems ⋮ On the update of constraint preconditioners for regularized KKT systems ⋮ A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization ⋮ Limited memory preconditioners for symmetric indefinite problems with application to structural mechanics ⋮ Preconditioners for Krylov subspace methods: An overview ⋮ Parameterized approximate block LU preconditioners for generalized saddle point problems ⋮ A matrix-free smoothing algorithm for large-scale support vector machines ⋮ Non-interior-point smoothing Newton method for CP revisited and its application to support vector machines ⋮ On partial Cholesky factorization and a variant of quasi-Newton preconditioners for symmetric positive definite matrices ⋮ 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
- Preconditioning Newton-Krylov methods in nonconvex large scale optimization
- Interior point methods 25 years later
- Adaptive preconditioners for nonlinear systems of equations
- Starting-point strategies for an infeasible potential reduction method
- Quasi-Newton preconditioners for the inexact Newton method
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Inexact interior-point method
- Approximate inverse preconditioning for shifted linear systems
- Preconditioning indefinite systems in interior point methods for optimization
- Software for simplified Lanczos and QMR algorithms
- Spectral analysis of inexact constraint preconditioning for symmetric saddle point matrices
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods
- Incremental spectral preconditioners for sequences of linear systems
- 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
- On the eigenvalues of a class of saddle point matrices
- Inexact constraint preconditioners for linear systems arising in interior point methods
- Stopping criteria for inner iterations in inexact potential reduction methods: a computational study
- On the Incomplete Cholesky Decomposition of a Class of Perturbed Matrices
- Incremental incomplete LU factorizations with applications
- Efficient Preconditioner Updates for Shifted Linear Systems
- On A Class of Limited Memory Preconditioners For Large Scale Linear Systems With Multiple Right-Hand Sides
- Nonsymmetric Preconditioner Updates in Newton–Krylov Methods for Nonlinear Systems
- Iterative Solution of Augmented Systems Arising in Interior Methods
- Efficient Preconditioning of Sequences of Nonsymmetric Linear Systems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- QMRPACK
- A Class of Spectral Two-Level Preconditioners
- Constraint Preconditioning for Indefinite Linear Systems
- Automatic Preconditioning by Limited Memory Quasi-Newton Updating
- Block-diagonal and indefinite symmetric preconditioners for mixed finite element formulations
- A Preconditioning Framework for Sequences of Diagonally Modified Linear Systems Arising in Optimization
- On eigenvalue distribution of constraint‐preconditioned symmetric saddle point matrices
- Constraint-Style Preconditioners for Regularized Saddle Point Problems
- Indefinitely preconditioned conjugate gradient method for large sparse equality and inequality constrained quadratic problems
- Approximate Factorization Constraint Preconditioners for Saddle-Point Matrices
- Implicit-Factorization Preconditioning and Iterative Solvers for Regularized Saddle-Point Systems
- New updates of incomplete LU factorizations and applications to large nonlinear systems
- Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming
This page was built for publication: Updating Constraint Preconditioners for KKT Systems in Quadratic Programming Via Low-Rank Corrections
