Modified Cholesky Factorizations for Sparse Preconditioners
In large scale unconstrained optimization problems, preconditioned conjugate gradient techniques are often used to solve the Newton equations, however in certain applications, ``natural sparse preconditioners can be derived from the structure of the problem and can accelerate convergence significantly. This paper describes such an adaptation of two MC techniques --- GMW (Gill-Murray-Wright) and SE (Schnabel-Eskow) --- in a truncated Newton minimization method. The analysis suggests that, for the minimization method examined, SE may be better for highly nonlinear functions, while GMW may be more effective for functions that are well approximated by locally convex quadratic models.
- A chordal preconditioner for large-scale optimization
- Accuracy of preconditioned CG-type methods for least squares problems.
- A survey of truncated-Newton methods
- Nonmonotone curvilinear line search methods for unconstrained optimization
- Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization
- Modified controlled Cholesky factorization for preconditioning linear systems from the interior-point method
- Multiple-rank modifications of a sparse Cholesky factorization
- A Max-Plus Approach to Incomplete Cholesky Factorization Preconditioners
- Dynamic scaling based preconditioning for truncated Newton methods in large scale unconstrained optimization
- scientific article; zbMATH DE number 2146946 (Why is no real title available?)
- Analysis of preconditioners for conjugate gradients through distribution of eigenvalues
- Partitioning group correction Cholesky techniques for large scale sparse unconstrained optimization
- Locality of reference in sparse Cholesky factorization methods
This page was built for publication: Modified Cholesky Factorizations for Sparse Preconditioners
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5286358)