Preconditioning Newton-Krylov methods in nonconvex large scale optimization
From MaRDI portal
(Redirected from Publication:377728)
Recommendations
- A class of approximate inverse preconditioners based on Krylov-subspace methods for large-scale nonconvex optimization
- Nonlinearly Preconditioned Krylov Subspace Methods for Discrete Newton Algorithms
- Dynamic scaling based preconditioning for truncated Newton methods in large scale unconstrained optimization
- Inertia-revealing preconditioning for large-scale nonconvex constrained optimization
- Novel preconditioners based on quasi-Newton updates for nonlinear conjugate gradient methods
Cites work
- scientific article; zbMATH DE number 3881771 (Why is no real title available?)
- scientific article; zbMATH DE number 1274356 (Why is no real title available?)
- scientific article; zbMATH DE number 1069181 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A survey of truncated-Newton methods
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Adaptive preconditioners for nonlinear systems of equations
- Adaptively Preconditioned GMRES Algorithms
- Algorithm 809: PREQN
- Assessing a search direction within a truncated Newton method
- Automatic Preconditioning by Limited Memory Quasi-Newton Updating
- Benchmarking optimization software with performance profiles.
- CUTEr and SifDec
- Dynamic scaling based preconditioning for truncated Newton methods in large scale unconstrained optimization
- Exploiting negative curvature directions in linesearch methods for unconstrained optimization
- Iterative computation of negative curvature directions in large scale optimization
- Lanczos conjugate-gradient method and pseudoinverse computation on indefinite and singular systems
- Matrix mathematics. Theory, facts, and formulas
- On A Class of Limited Memory Preconditioners For Large Scale Linear Systems With Multiple Right-Hand Sides
- On the Sensitivity of Some Spectral Preconditioners
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. II: Application
- Preconditioners for Indefinite Systems Arising in Optimization
- Preconditioning of Truncated-Newton Methods
- Restarted GMRES preconditioned by deflation
- Truncated-Newton algorithms for large-scale unconstrained optimization
- Trust Region Methods
Cited in
(21)- Dynamic scaling based preconditioning for truncated Newton methods in large scale unconstrained optimization
- Inertia-revealing preconditioning for large-scale nonconvex constrained optimization
- An Improvement of the Pivoting Strategy in the Bunch and Kaufman Decomposition, Within Truncated Newton Methods
- Efficient tridiagonal preconditioner for the matrix-free truncated Newton method
- A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization
- Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization
- Conjugate direction methods and polarity for quadratic hypersurfaces
- A preconditioning proximal Newton method for nondifferentiable convex optimization
- A class of approximate inverse preconditioners based on Krylov-subspace methods for large-scale nonconvex optimization
- Multilevel preconditioning for sparse optimization of functionals with nonconvex fidelity terms
- A framework of conjugate direction methods for symmetric linear systems in optimization
- Issues on the use of a modified bunch and Kaufman decomposition for large scale Newton's equation
- Exploiting damped techniques for nonlinear conjugate gradient methods
- Preconditioned nonlinear conjugate gradient methods based on a modified secant equation
- Limited memory preconditioners for symmetric indefinite problems with application to structural mechanics
- Novel preconditioners based on quasi-Newton updates for nonlinear conjugate gradient methods
- On diagonally preconditioning the truncated Newton method for super-scale linearly constrained nonlinear prrogramming
- An adaptive truncation criterion, for linesearch-based truncated Newton methods in large scale nonconvex optimization
- Preconditioning of Truncated-Newton Methods
- Nonlinearly Preconditioned Inexact Newton Algorithms
- Updating constraint preconditioners for KKT systems in quadratic programming via low-rank corrections
This page was built for publication: Preconditioning Newton-Krylov methods in nonconvex large scale optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q377728)
