Preconditioning Newton-Krylov methods in nonconvex large scale optimization
From MaRDI portal
Publication:377728
DOI10.1007/S10589-013-9563-6zbMATH Open1314.90063OpenAlexW1976213004MaRDI QIDQ377728FDOQ377728
Authors: Giovanni Fasano, Massimo Roma 
Publication date: 7 November 2013
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-013-9563-6
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
Krylov subspace methodspreconditioninglarge scale optimizationNewton-Krylov methodsnonconvex problems
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26)
Cites Work
- Algorithm 809: PREQN
- CUTEr and SifDec
- Title not available (Why is that?)
- Benchmarking optimization software with performance profiles.
- Title not available (Why is that?)
- Trust Region Methods
- Matrix mathematics. Theory, facts, and formulas
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. II: Application
- Truncated-Newton algorithms for large-scale unconstrained optimization
- On A Class of Limited Memory Preconditioners For Large Scale Linear Systems With Multiple Right-Hand Sides
- Dynamic scaling based preconditioning for truncated Newton methods in large scale unconstrained optimization
- Preconditioning of Truncated-Newton Methods
- Automatic Preconditioning by Limited Memory Quasi-Newton Updating
- Preconditioners for Indefinite Systems Arising in Optimization
- On the Sensitivity of Some Spectral Preconditioners
- A truncated Newton method with non-monotone line search for unconstrained optimization
- A survey of truncated-Newton methods
- Restarted GMRES preconditioned by deflation
- Iterative computation of negative curvature directions in large scale optimization
- Title not available (Why is that?)
- Adaptively Preconditioned GMRES Algorithms
- Title not available (Why is that?)
- Exploiting negative curvature directions in linesearch methods for unconstrained optimization
- Adaptive preconditioners for nonlinear systems of equations
- Assessing a search direction within a truncated Newton method
- Lanczos conjugate-gradient method and pseudoinverse computation on indefinite and singular systems
Cited In (21)
- Exploiting damped techniques for nonlinear conjugate gradient methods
- Efficient tridiagonal preconditioner for the matrix-free truncated Newton method
- An Improvement of the Pivoting Strategy in the Bunch and Kaufman Decomposition, Within Truncated Newton Methods
- Issues on the use of a modified bunch and Kaufman decomposition for large scale Newton's equation
- Updating constraint preconditioners for KKT systems in quadratic programming via low-rank corrections
- An adaptive truncation criterion, for linesearch-based truncated Newton methods in large scale nonconvex optimization
- Preconditioned nonlinear conjugate gradient methods based on a modified secant equation
- Inertia-revealing preconditioning for large-scale nonconvex constrained optimization
- A class of approximate inverse preconditioners based on Krylov-subspace methods for large-scale nonconvex optimization
- A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization
- Limited memory preconditioners for symmetric indefinite problems with application to structural mechanics
- Multilevel preconditioning for sparse optimization of functionals with nonconvex fidelity terms
- Dynamic scaling based preconditioning for truncated Newton methods in large scale unconstrained optimization
- Conjugate direction methods and polarity for quadratic hypersurfaces
- On diagonally preconditioning the truncated Newton method for super-scale linearly constrained nonlinear prrogramming
- Nonlinearly Preconditioned Inexact Newton Algorithms
- Preconditioning of Truncated-Newton Methods
- Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization
- A preconditioning proximal Newton method for nondifferentiable convex optimization
- A framework of conjugate direction methods for symmetric linear systems in optimization
- Novel preconditioners based on quasi-Newton updates for nonlinear conjugate gradient methods
Uses Software
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)
