A class of approximate inverse preconditioners based on Krylov-subspace methods for large-scale nonconvex optimization
From MaRDI portal
Publication:5116544
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
Cites work
- scientific article; zbMATH DE number 3881771 (Why is no real title available?)
- scientific article; zbMATH DE number 1012640 (Why is no real title available?)
- scientific article; zbMATH DE number 1049350 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization
- A matrix-free preconditioner for sparse symmetric positive definite systems and least-squares problems
- A new preconditioner update strategy for the solution of sequences of linear systems in structural mechanics: application to saddle point problems in elasticity
- A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization
- A pivoting strategy for symmetric tridiagonal matrices
- A simplified pivoting strategy for symmetric tridiagonal matrices
- A survey of truncated-Newton methods
- Accuracy and Stability of Numerical Algorithms
- Adaptively Preconditioned GMRES Algorithms
- Algorithm 809: PREQN
- An adaptive truncation criterion, for linesearch-based truncated Newton methods in large scale nonconvex optimization
- Automatic Preconditioning by Limited Memory Quasi-Newton Updating
- BFGS-like updates of constraint preconditioners for sequences of KKT linear systems in quadratic programming.
- Benchmarking optimization software with performance profiles.
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Conjugate gradient (CG)-type method for the solution of Newton's equation within optimization frameworks
- Dynamic scaling based preconditioning for truncated Newton methods in large scale unconstrained optimization
- Efficient Preconditioning of Sequences of Nonsymmetric Linear Systems
- Efficient tridiagonal preconditioner for the matrix-free truncated Newton method
- Exploiting damped techniques for nonlinear conjugate gradient methods
- Extra updates for the bfgs method∗
- GMRES convergence for perturbed coefficient matrices, with application to approximate deflation preconditioning
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Incremental spectral preconditioners for sequences of linear systems
- Iterative Krylov Methods for Large Linear Systems
- Limited memory block preconditioners for fast solution of fractional partial differential equations
- Limited memory preconditioners for symmetric indefinite problems with application to structural mechanics
- MINRES-QLP: a Krylov subspace method for indefinite or singular symmetric systems
- Matrix mathematics. Theory, facts, and formulas
- On A Class of Limited Memory Preconditioners For Large Scale Linear Systems With Multiple Right-Hand Sides
- On solving sparse symmetric linear systems whose definiteness is unknown
- Optimization methods for large-scale machine learning
- Parallel quasi-Newton methods for unconstrained optimization
- Partial Pivoting Strategies for Symmetric Matrices
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. II: Application
- Preconditioner updates for solving sequences of linear systems in matrix-free environment
- Preconditioners for Indefinite Systems Arising in Optimization
- Preconditioning Newton-Krylov methods in nonconvex large scale optimization
- Preconditioning of Truncated-Newton Methods
- Preconditioning techniques for large linear systems: A survey
- Robust approximate inverse preconditioning for the conjugate gradient method
- Solution of Sparse Indefinite Systems of Linear Equations
- Solution of sparse rectangular systems using LSQR and Craig
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- Sparse approximate inverse preconditioners on high performance GPU platforms
- Sparse matrix test problems
- Stability of block LDL^T factorization of a symmetric tridiagonal matrix
- Trust Region Methods
- Updating Quasi-Newton Matrices with Limited Storage
Cited in
(4)- A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization
- Preconditioning Newton-Krylov methods in nonconvex large scale optimization
- Inertia-revealing preconditioning for large-scale nonconvex constrained optimization
- A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization
Describes a project that uses
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)
