A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization
From MaRDI portal
Publication:2397822
Recommendations
- A sparse approximate inverse preconditioner for nonsymmetric positive definite matrices
- Approximate inverse preconditionings for sparse linear systems
- Pseudoinverse preconditioners and iterative methods for large dense linear least-squares problems
- A new scheme of computing the approximate inverse preconditioner for the reduced linear systems
- A class of approximate inverse preconditioners based on Krylov-subspace methods for large-scale nonconvex optimization
- On Least-Squares Approximate Inverse-Based Preconditioners
- Generalized approximate inverse preconditioners for least squares problems
- Approximate inverse preconditioning for shifted linear systems
- A generalization of the optimal diagonal approximate inverse preconditioner
Cites work
- scientific article; zbMATH DE number 3881771 (Why is no real title available?)
- scientific article; zbMATH DE number 3686229 (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?)
- A Relationship between the BFGS and Conjugate Gradient Algorithms and Its Implications for New Algorithms
- A comparative study of sparse approximate inverse preconditioners
- A matrix-free preconditioner for sparse symmetric positive definite systems and least-squares problems
- A survey of truncated-Newton methods
- Adaptively Preconditioned GMRES Algorithms
- Automatic Preconditioning by Limited Memory Quasi-Newton Updating
- Benchmarking optimization software with performance profiles.
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Iterative computation of negative curvature directions in large scale optimization
- Matrix mathematics. Theory, facts, and formulas
- Matrix-free interior point method
- Numerical Optimization
- On A Class of Limited Memory Preconditioners For Large Scale Linear Systems With Multiple Right-Hand Sides
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory
- Preconditioning Newton-Krylov methods in nonconvex large scale optimization
- Preconditioning techniques for large linear systems: A survey
- Robust approximate inverse preconditioning for the conjugate gradient method
- Robust preconditioners for the matrix free truncated Newton method.
- The linear algebra of block quasi-Newton algorithms
- Trust Region Methods
Cited in
(12)- Exploiting damped techniques for nonlinear conjugate gradient methods
- On a conjugate directions method for solving strictly convex QP problem
- Efficient tridiagonal preconditioner for the matrix-free truncated Newton method
- A class of approximate inverse preconditioners for solving linear systems
- A new scheme of computing the approximate inverse preconditioner for the reduced linear systems
- A preconditioning framework for sequences of diagonally modified linear systems arising in optimization
- An adaptive truncation criterion, for linesearch-based truncated Newton methods in large scale nonconvex optimization
- Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming
- 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
- On partial Cholesky factorization and a variant of quasi-Newton preconditioners for symmetric positive definite matrices
- Novel preconditioners based on quasi-Newton updates for nonlinear conjugate gradient methods
This page was built for publication: A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397822)
