A class of approximate inverse preconditioners based on Krylov-subspace methods for large-scale nonconvex optimization
From MaRDI portal
Publication:5116544
DOI10.1137/19M1256907zbMATH Open1480.90169OpenAlexW3045707078MaRDI QIDQ5116544FDOQ5116544
Andrea Caliciotti, Mehiddin Al-Baali, Giovanni Fasano, Massimo Roma
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
Recommendations
- Preconditioning Newton-Krylov methods in nonconvex large scale optimization
- A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization
- Inertia-revealing preconditioning for large-scale nonconvex constrained optimization
- Preconditioners for Indefinite Systems Arising in Optimization
- Preconditioning indefinite systems in interior point methods for optimization
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)
Cites Work
- Algorithm 809: PREQN
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- MINRES-QLP: A Krylov Subspace Method for Indefinite or Singular Symmetric Systems
- Preconditioning techniques for large linear systems: A survey
- Title not available (Why is that?)
- Title not available (Why is that?)
- Benchmarking optimization software with performance profiles.
- Updating Quasi-Newton Matrices with Limited Storage
- Title not available (Why is that?)
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Trust Region Methods
- Title not available (Why is that?)
- Title not available (Why is that?)
- Accuracy and Stability of Numerical Algorithms
- A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. II: Application
- Efficient tridiagonal preconditioner for the matrix-free truncated Newton method
- 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
- Preconditioning of Truncated-Newton Methods
- Preconditioning Newton-Krylov methods in nonconvex large scale optimization
- Solution of Sparse Indefinite Systems of Linear Equations
- Title not available (Why is that?)
- Automatic Preconditioning by Limited Memory Quasi-Newton Updating
- Preconditioners for Indefinite Systems Arising in Optimization
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- Iterative Krylov Methods for Large Linear Systems
- Preconditioner updates for solving sequences of linear systems in matrix-free environment
- Efficient Preconditioning of Sequences of Nonsymmetric Linear Systems
- A Matrix-Free Preconditioner for Sparse Symmetric Positive Definite Systems and Least-Squares Problems
- Incremental spectral preconditioners for sequences of linear systems
- Extra updates for the bfgs method∗
- A survey of truncated-Newton methods
- Title not available (Why is that?)
- Adaptively Preconditioned GMRES Algorithms
- Solution of sparse rectangular systems using LSQR and Craig
- A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization
- Stability of block LDL\(^T\) factorization of a symmetric tridiagonal matrix
- Robust approximate inverse preconditioning for the conjugate gradient method
- Sparse approximate inverse preconditioners on high performance GPU platforms
- Sparse matrix test problems
- Parallel quasi-Newton methods for unconstrained optimization
- Exploiting damped techniques for nonlinear conjugate gradient methods
- Partial Pivoting Strategies for Symmetric Matrices
- Limited memory block preconditioners for fast solution of fractional partial differential equations
- Optimization Methods for Large-Scale Machine Learning
- On solving sparse symmetric linear systems whose definiteness is unknown
- A pivoting strategy for symmetric tridiagonal matrices
- A new preconditioner update strategy for the solution of sequences of linear systems in structural mechanics: application to saddle point problems in elasticity
- Limited memory preconditioners for symmetric indefinite problems with application to structural mechanics
- GMRES convergence for perturbed coefficient matrices, with application to approximate deflation preconditioning
- Conjugate gradient (CG)-type method for the solution of Newton's equation within optimization frameworks
- An adaptive truncation criterion, for linesearch-based truncated Newton methods in large scale nonconvex optimization
- BFGS‐like updates of constraint preconditioners for sequences of KKT linear systems in quadratic programming
- A simplified pivoting strategy for symmetric tridiagonal matrices
Cited In (1)
Uses Software
This page was built for publication: A class of approximate inverse preconditioners based on Krylov-subspace methods for large-scale nonconvex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5116544)
