Dynamic scaling based preconditioning for truncated Newton methods in large scale unconstrained optimization
From MaRDI portal
(Redirected from Publication:3369520)
Recommendations
- On diagonally preconditioning the truncated Newton method for super-scale linearly constrained nonlinear prrogramming
- Robust preconditioners for the matrix free truncated Newton method.
- Preconditioning of Truncated-Newton Methods
- Preconditioning Newton-Krylov methods in nonconvex large scale optimization
- Numerical experiences with new truncated Newton methods in large scale unconstrained optimization
Cites work
- scientific article; zbMATH DE number 3976197 (Why is no real title available?)
- scientific article; zbMATH DE number 1049350 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Comparative Study of Algorithms for Matrix Balancing
- A Numerical Study of the Limited Memory BFGS Method and the Truncated-Newton Method for Large Scale Optimization
- A discrete Newton algorithm for minimizing a function of many variables
- A survey of truncated-Newton methods
- Accuracy and Stability of Numerical Algorithms
- Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming
- Algorithm 809: PREQN
- Assessing a search direction within a truncated Newton method
- Automatic Preconditioning by Limited Memory Quasi-Newton Updating
- CUTE
- Condition numbers and equilibration of matrices
- Conjugate gradient type methods and preconditioning
- Element-by-Element Preconditioners for Large Partially Separable Optimization Problems
- Equilibration of Symmetric Matrices in the Max-Norm
- Incomplete Cholesky Factorizations with Limited Memory
- Inexact Newton Methods
- Iterative Solution Methods
- Methods for scaling to doubly stochastic form
- Modified Cholesky Factorizations for Sparse Preconditioners
- On the limited memory BFGS method for large scale optimization
- Optimally scaled matrices
- Partitioned variable metric updates for large structured optimization problems
- Preconditioning of Truncated-Newton Methods
- Truncated-Newton algorithms for large-scale unconstrained optimization
Cited in
(11)- A matrix-free approach to build band preconditioners for large-scale bound-constrained optimization
- Efficient tridiagonal preconditioner for the matrix-free truncated Newton method
- Preconditioning Newton-Krylov methods in nonconvex large scale optimization
- Robust preconditioners for the matrix free truncated Newton method.
- Scaling damped limited-memory updates for unconstrained optimization
- Dynamic scaling on the limited memory BFGS method
- A class of approximate inverse preconditioners based on Krylov-subspace methods for large-scale nonconvex optimization
- On diagonally-preconditioning the 2-step BFGS method with accumulated steps for linearly constrained nonlinear programming
- On diagonally preconditioning the truncated Newton method for super-scale linearly constrained nonlinear prrogramming
- A class of diagonal preconditioners for limited memory BFGS method
- Preconditioning of Truncated-Newton Methods
This page was built for publication: Dynamic scaling based preconditioning for truncated Newton methods in large scale unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3369520)
