A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization
From MaRDI portal
Publication:2397822
DOI10.1007/s10589-015-9765-1zbMath1369.90166OpenAlexW778979106MaRDI QIDQ2397822
Publication date: 23 May 2017
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-015-9765-1
preconditionersKrylov-subspace methodslarge positive definite linear systemslarge scale convex optimization
Related Items
Efficient tridiagonal preconditioner for the matrix-free truncated Newton method, An adaptive truncation criterion, for linesearch-based truncated Newton methods in large scale nonconvex optimization, Preconditioned nonlinear conjugate gradient methods based on a modified secant equation, A Class of Approximate Inverse Preconditioners Based on Krylov-Subspace Methods for Large-Scale Nonconvex Optimization, Exploiting damped techniques for nonlinear conjugate gradient methods, On a conjugate directions method for solving strictly convex QP problem, Novel preconditioners based on quasi-Newton updates for nonlinear conjugate gradient methods, On partial Cholesky factorization and a variant of quasi-Newton preconditioners for symmetric positive definite matrices
Uses Software
Cites Work
- Preconditioning Newton-Krylov methods in nonconvex large scale optimization
- Matrix-free interior point method
- A comparative study of sparse approximate inverse preconditioners
- The linear algebra of block quasi-Newton algorithms
- A survey of truncated-Newton methods
- Preconditioning techniques for large linear systems: A survey
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Iterative computation of negative curvature directions in large scale optimization
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory
- Robust Approximate Inverse Preconditioning for the Conjugate Gradient Method
- On A Class of Limited Memory Preconditioners For Large Scale Linear Systems With Multiple Right-Hand Sides
- A Relationship between the BFGS and Conjugate Gradient Algorithms and Its Implications for New Algorithms
- Adaptively Preconditioned GMRES Algorithms
- Numerical Optimization
- Trust Region Methods
- Automatic Preconditioning by Limited Memory Quasi-Newton Updating
- A Matrix-Free Preconditioner for Sparse Symmetric Positive Definite Systems and Least-Squares Problems
- Benchmarking optimization software with performance profiles.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
