Dynamic scaling based preconditioning for truncated Newton methods in large scale unconstrained optimization
From MaRDI portal
Publication:3369520
DOI10.1080/10556780410001727709zbMath1127.90408OpenAlexW2152951271MaRDI QIDQ3369520
Publication date: 2 February 2006
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780410001727709
preconditioningtruncated Newton methodequilibrated matrixconjugate gradient (CG) methodrow-column scaling
Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Methods of quasi-Newton type (90C53)
Related Items
Efficient tridiagonal preconditioner for the matrix-free truncated Newton method, Scaling damped limited-memory updates for unconstrained optimization, Dynamic scaling on the limited memory BFGS method, Preconditioning Newton-Krylov methods in nonconvex large scale optimization, A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization, A Class of Approximate Inverse Preconditioners Based on Krylov-Subspace Methods for Large-Scale Nonconvex Optimization, A class of diagonal preconditioners for limited memory BFGS method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimally scaled matrices
- On the limited memory BFGS method for large scale optimization
- Assessing a search direction within a truncated Newton method
- Conjugate gradient type methods and preconditioning
- Partitioned variable metric updates for large structured optimization problems
- A survey of truncated-Newton methods
- Methods for scaling to doubly stochastic form
- Condition numbers and equilibration of matrices
- Truncated-Newton algorithms for large-scale unconstrained optimization
- A Comparative Study of Algorithms for Matrix Balancing
- Preconditioning of Truncated-Newton Methods
- A discrete Newton algorithm for minimizing a function of many variables
- Inexact Newton Methods
- A Numerical Study of the Limited Memory BFGS Method and the Truncated-Newton Method for Large Scale Optimization
- Iterative Solution Methods
- CUTE
- Element-by-Element Preconditioners for Large Partially Separable Optimization Problems
- Automatic Preconditioning by Limited Memory Quasi-Newton Updating
- Incomplete Cholesky Factorizations with Limited Memory
- Accuracy and Stability of Numerical Algorithms
- Modified Cholesky Factorizations for Sparse Preconditioners
- Algorithm 809: PREQN
- Equilibration of Symmetric Matrices in the Max-Norm
- Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming
