A survey of truncated-Newton methods
From MaRDI portal
Publication:1593812
The paper presents a survey of truncated-Newton methods. Many algorithmic enhancements are developed and studied, resulting in a number of publicly available software packages. The paper is written in a very clear and effective way. Several applications of the theory are extensively presented.
Recommendations
- Numerical experience with the truncated Newton method for unconstrained optimization
- Numerical experiences with new truncated Newton methods in large scale unconstrained optimization
- TNPACK—A truncated Newton minimization package for large-scale problems
- Preconditioning of Truncated-Newton Methods
- Newton-Type Minimization via the Lanczos Method
Cites work
- A Barrier Method for Large-Scale Constrained Optimization
- A General-Purpose Parallel Algorithm for Unconstrained Optimization
- A Numerical Study of the Limited Memory BFGS Method and the Truncated-Newton Method for Large Scale Optimization
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Assessing a search direction within a truncated Newton method
- Automatic Preconditioning by Limited Memory Quasi-Newton Updating
- Choosing the Forcing Terms in an Inexact Newton Method
- Curvilinear Stabilization Techniques for Truncated Newton Methods in Large Scale Unconstrained Optimization
- Element-by-Element Preconditioners for Large Partially Separable Optimization Problems
- Globally Convergent Inexact Newton Methods
- scientific article; zbMATH DE number 107545 (Why is no real title available?)
- scientific article; zbMATH DE number 1406968 (Why is no real title available?)
- Inexact Newton Methods
- Modified Cholesky Factorizations for Sparse Preconditioners
- Newton's Method for Large Bound-Constrained Optimization Problems
- Newton-Type Minimization via the Lanczos Method
- NITSOL: A Newton Iterative Solver for Nonlinear Systems
- On the Complexity of a Practical Interior-Point Method
- Preconditioning of Truncated-Newton Methods
- Preconditioning Reduced Matrices
- Rates of convergence for adaptive Newton methods
- Solution of Sparse Indefinite Systems of Linear Equations
- Solving the Trust-Region Subproblem using the Lanczos Method
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
Cited in
(52)- A limited memory BFGS-type method for large-scale unconstrained optimization
- On the efficiency of gradient based optimization algorithms for DNS-based optimal control in a turbulent channel flow
- Conjugate direction methods and polarity for quadratic hypersurfaces
- A limited memory BFGS method for solving large-scale symmetric nonlinear equations
- Fitting very large sparse Gaussian graphical models
- Issues on the use of a modified bunch and Kaufman decomposition for large scale Newton's equation
- A limited memory \(q\)-BFGS algorithm for unconstrained optimization problems
- A study of the performance of classical minimizers in the quantum approximate optimization algorithm
- Comparing epidemiological models with the help of visualization dashboards
- On obtaining sparse semantic solutions for inverse problems, control, and neural network training
- Iterative grossone-based computation of negative curvature directions in large-scale optimization
- Adaptive eigenspace for multi-parameter inverse scattering problems
- An optimization problem based on a Bayesian approach for the 2D Helmholtz equation
- Polarity and conjugacy for quadratic hypersurfaces: a unified framework with recent advances
- Solution refinement at regular points of conic problems
- Limited memory technique using trust regions for nonlinear equations
- A framework of conjugate direction methods for symmetric linear systems in optimization
- A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization
- An adaptive truncation criterion, for linesearch-based truncated Newton methods in large scale nonconvex optimization
- Iterative computation of negative curvature directions in large scale optimization
- Bifurcation instability in linear elasticity with the constraint of local injectivity
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory
- Planar conjugate gradient algorithm for large-scale unconstrained optimization. II: Application
- Discriminative Bayesian filtering lends momentum to the stochastic Newton method for minimizing log-convex functions
- Optimization-based approach for joint X-ray fluorescence and transmission tomographic inversion
- A general U-block model-based design procedure for nonlinear polynomial control systems
- Theoretical and Numerical Study of Iteratively Truncated Newton’s Algorithm
- Aerodynamic design using the truncated Newton algorithm and the continuous adjoint approach
- Full waveform inversion and the truncated Newton method
- Adaptive eigenspace method for inverse scattering problems in the frequency domain
- Differentiation of matrix functionals using triangular factorization
- Dynamic scaling based preconditioning for truncated Newton methods in large scale unconstrained optimization
- Preconditioning Newton-Krylov methods in nonconvex large scale optimization
- Remark on Algorithm 702—the updated truncated Newton minimization package
- A time-domain preconditioned truncated Newton approach to visco-acoustic multiparameter full waveform inversion
- A family of quasi-Newton methods for unconstrained optimization problems
- Conjugate gradient (CG)-type method for the solution of Newton's equation within optimization frameworks
- Bilevel optimization, deep learning and fractional Laplacian regularization with applications in tomography
- A quasi-Newton algorithm for large-scale nonlinear equations
- A class of approximate inverse preconditioners based on Krylov-subspace methods for large-scale nonconvex optimization
- Simultaneous sensing error recovery and tomographic inversion using an optimization-based approach
- Personalized Policy Learning Using Longitudinal Mobile Health Data
- A trust-region-based BFGS method with line search technique for symmetric nonlinear equations
- M-IHS: an accelerated randomized preconditioning method avoiding costly matrix decompositions
- An Improvement of the Pivoting Strategy in the Bunch and Kaufman Decomposition, Within Truncated Newton Methods
- Approximating Hessians in unconstrained optimization arising from discretized problems
- Limited memory BFGS method with backtracking for symmetric nonlinear equations
- Local path-following property of inexact interior methods in nonlinear programming
- Exploiting effective negative curvature directions via SYMMBK algorithm, in Newton-Krylov methods
- Truncated regularized Newton method for convex minimizations
- A truncated nonmonotone Gauss-Newton method for large-scale nonlinear least-squares problems
- Assessing a search direction within a truncated Newton method
This page was built for publication: A survey of truncated-Newton methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1593812)
