Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy
From MaRDI portal
Publication:5057773
DOI10.1137/21M1416552MaRDI QIDQ5057773
Publication date: 19 December 2022
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.12916
Computational methods for sparse matrices (65F50) Numerical mathematical programming methods (65K05) Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matrix-free interior point method
- Sparsity preserving preconditioners for linear systems in interior-point methods
- Preconditioners for saddle point linear systems with highly singular \((1,1)\) blocks
- On the augmented system approach to sparse least-squares problems
- Inexact interior-point method
- On an iterative method for saddle point problems
- Improving the preconditioning of linear systems from interior point methods
- Fast interior point solution of quadratic programming problems arising from PDE-constrained optimization
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
- A class of iterative methods for solving saddle point problems
- Inertia-controlling factorizations for optimization algorithms
- Preconditioning indefinite systems in interior point methods for optimization
- The convergence rate of the minimal residual method for the Stokes problem
- Software for simplified Lanczos and QMR algorithms
- An interior point-proximal method of multipliers for convex quadratic programming
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Improving an interior-point approach for large block-angular problems by hybrid preconditioners
- A comparison of reduced and unreduced KKT systems arising from interior point methods
- Dynamic non-diagonal regularization in interior point methods for linear and convex quadratic programming
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On the interia of some classes of partitioned matrices
- Using constraint preconditioners with regularized saddle-point problems
- On Block Preconditioners for Nonsymmetric Saddle Point Problems
- Convergence of a Class of Inexact Interior-Point Algorithms for Linear Programs
- On the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization
- Direct Methods for Sparse Matrices
- Updating Constraint Preconditioners for KKT Systems in Quadratic Programming Via Low-Rank Corrections
- Spectral estimates for unreduced symmetric KKT systems arising from Interior Point methods
- Block preconditioners for symmetric indefinite linear systems
- Uzawa-Type and Augmented Lagrangian Methods for Double Saddle Point Systems
- SOLVING SPARSE TRIANGULAR LINEAR SYSTEMS ON PARALLEL COMPUTERS
- Preconditioners for the discretized time-harmonic Maxwell equations in mixed form
- Numerical solution of saddle point problems
- Iterative Solution of Augmented Systems Arising in Interior Methods
- Preconditioning indefinite systems in interior point methods for large scale linear optimisation
- A Preconditioner for Linear Systems Arising From Interior Point Optimization Methods
- Augmentation block preconditioners for saddle point-type matrices with singular (1, 1) blocks
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Preconditioners for Indefinite Systems Arising in Optimization
- Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- Solution of Sparse Indefinite Systems of Linear Equations
- Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†
- Fast Iterative Solution of Stabilised Stokes Systems Part II: Using General Block Preconditioners
- Approximate Inverse Techniques for Block-Partitioned Matrices
- On Solving Block-Structured Indefinite Linear Systems
- Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
- A repository of convex quadratic programming problems
- Constraint Preconditioning for Indefinite Linear Systems
- A Dual-Dual Formulation for the Coupling of Mixed-FEM and BEM in Hyperelasticity
- Iterative Methods for Double Saddle Point Systems
- Optimal Preconditioning for Raviart--Thomas Mixed Formulation of Second-Order Elliptic Problems
- 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
- Augmentation Block Triangular Preconditioners for Regularized Saddle Point Problems
- A Preconditioned Nullspace Method for Liquid Crystal Director Modeling
- A new preconditioning approach for an interior point‐proximal method of multipliers for linear and convex quadratic programming
- Bounds on Eigenvalues of Matrices Arising from Interior-Point Methods
- An Augmented Lagrangian Preconditioner for the 3D Stationary Incompressible Navier--Stokes Equations at High Reynolds Number
- Preconditioning methods for linear systems arising in constrained optimization problems
- Indefinitely preconditioned conjugate gradient method for large sparse equality and inequality constrained quadratic problems
- An Augmented Lagrangian‐Based Approach to the Oseen Problem
- Object-oriented software for quadratic programming
- An Algebraic Analysis of a Block Diagonal Preconditioner for Saddle Point Systems
- On Block Elimination for Sparse Linear Systems
- Methods of conjugate gradients for solving linear systems
- Schur complement preconditioners for multiple saddle point problems of block tridiagonal form with application to optimization problems
- Uniform preconditioners for the time dependent Stokes problem
- Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming
