A Class of Approximate Inverse Preconditioners Based on Krylov-Subspace Methods for Large-Scale Nonconvex Optimization
From MaRDI portal
Publication:5116544
DOI10.1137/19M1256907zbMath1480.90169OpenAlexW3045707078MaRDI QIDQ5116544
Andrea Caliciotti, Giovanni Fasano, Massimo Roma, Mehiddin Al-Baali
Publication date: 18 August 2020
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/19m1256907
preconditioningiterative methodsconjugate gradient methodslarge-scale nonconvex optimizationKrylov-subspace methodsLanczos-based solverslarge indefinite linear systems
Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient tridiagonal preconditioner for the matrix-free truncated Newton method
- Preconditioning Newton-Krylov methods in nonconvex large scale optimization
- A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization
- Sparse approximate inverse preconditioners on high performance GPU platforms
- Exploiting damped techniques for nonlinear conjugate gradient methods
- Parallel quasi-Newton methods for unconstrained optimization
- Stability of block LDL\(^T\) factorization of a symmetric tridiagonal matrix
- A survey of truncated-Newton methods
- Limited memory block preconditioners for fast solution of fractional partial differential equations
- A new preconditioner update strategy for the solution of sequences of linear systems in structural mechanics: application to saddle point problems in elasticity
- Preconditioning techniques for large linear systems: A survey
- Solution of sparse rectangular systems using LSQR and Craig
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Incremental spectral preconditioners for sequences of linear systems
- A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization
- An adaptive truncation criterion, for linesearch-based truncated Newton methods in large scale nonconvex optimization
- On solving sparse symmetric linear systems whose definiteness is unknown
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. II: Application
- Robust Approximate Inverse Preconditioning for the Conjugate Gradient Method
- GMRES Convergence for Perturbed Coefficient Matrices, with Application to Approximate Deflation Preconditioning
- Limited memory preconditioners for symmetric indefinite problems with application to structural mechanics
- Preconditioner updates for solving sequences of linear systems in matrix-free environment
- MINRES-QLP: A Krylov Subspace Method for Indefinite or Singular Symmetric Systems
- On A Class of Limited Memory Preconditioners For Large Scale Linear Systems With Multiple Right-Hand Sides
- Dynamic scaling based preconditioning for truncated Newton methods in large scale unconstrained optimization
- Efficient Preconditioning of Sequences of Nonsymmetric Linear Systems
- A pivoting strategy for symmetric tridiagonal matrices
- A simplified pivoting strategy for symmetric tridiagonal matrices
- Preconditioning of Truncated-Newton Methods
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Sparse matrix test problems
- Updating Quasi-Newton Matrices with Limited Storage
- Preconditioners for Indefinite Systems Arising in Optimization
- Solution of Sparse Indefinite Systems of Linear Equations
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- Adaptively Preconditioned GMRES Algorithms
- Extra updates for the bfgs method∗
- Trust Region Methods
- Automatic Preconditioning by Limited Memory Quasi-Newton Updating
- BFGS‐like updates of constraint preconditioners for sequences of KKT linear systems in quadratic programming
- Optimization Methods for Large-Scale Machine Learning
- Conjugate gradient (CG)-type method for the solution of Newton's equation within optimization frameworks
- Accuracy and Stability of Numerical Algorithms
- Iterative Krylov Methods for Large Linear Systems
- A Matrix-Free Preconditioner for Sparse Symmetric Positive Definite Systems and Least-Squares Problems
- Algorithm 809: PREQN
- Partial Pivoting Strategies for Symmetric Matrices
- Benchmarking optimization software with performance profiles.
