A survey of truncated-Newton methods
From MaRDI portal
Publication:1593812
DOI10.1016/S0377-0427(00)00426-XzbMath0969.65054WikidataQ56602774 ScholiaQ56602774MaRDI QIDQ1593812
Publication date: 25 January 2001
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items
On obtaining sparse semantic solutions for inverse problems, control, and neural network training, Aerodynamic design using the truncated Newton algorithm and the continuous adjoint approach, Truncated regularized Newton method for convex minimizations, On the efficiency of gradient based optimization algorithms for DNS-based optimal control in a turbulent channel flow, A truncated nonmonotone Gauss-Newton method for large-scale nonlinear least-squares problems, A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization, Preconditioning Newton-Krylov methods in nonconvex large scale optimization, A trust-region-based BFGS method with line search technique for symmetric nonlinear equations, A Time-Domain Preconditioned Truncated Newton Approach to Visco-acoustic Multiparameter Full Waveform Inversion, Fitting very large sparse Gaussian graphical models, An adaptive truncation criterion, for linesearch-based truncated Newton methods in large scale nonconvex optimization, M-IHS: an accelerated randomized preconditioning method avoiding costly matrix decompositions, Iterative grossone-based computation of negative curvature directions in large-scale optimization, Conjugate direction methods and polarity for quadratic hypersurfaces, Full Waveform Inversion and the Truncated Newton Method, An Improvement of the Pivoting Strategy in the Bunch and Kaufman Decomposition, Within Truncated Newton Methods, Adaptive eigenspace method for inverse scattering problems in the frequency domain, A Class of Approximate Inverse Preconditioners Based on Krylov-Subspace Methods for Large-Scale Nonconvex Optimization, Discriminative Bayesian filtering lends momentum to the stochastic Newton method for minimizing log-convex functions, Adaptive eigenspace for multi-parameter inverse scattering problems, An optimization problem based on a Bayesian approach for the 2D Helmholtz equation, Approximating Hessians in unconstrained optimization arising from discretized problems, Limited memory BFGS method with backtracking for symmetric nonlinear equations, A limited memory BFGS method for solving large-scale symmetric nonlinear equations, Polarity and conjugacy for quadratic hypersurfaces: a unified framework with recent advances, Iterative computation of negative curvature directions in large scale optimization, Bifurcation instability in linear elasticity with the constraint of local injectivity, A quasi-Newton algorithm for large-scale nonlinear equations, A family of quasi-Newton methods for unconstrained optimization problems, Differentiation of matrix functionals using triangular factorization, Conjugate gradient (CG)-type method for the solution of Newton's equation within optimization frameworks, Local path-following property of inexact interior methods in nonlinear programming, Issues on the use of a modified bunch and Kaufman decomposition for large scale Newton's equation, Solution refinement at regular points of conic problems, Optimization-Based Approach for Joint X-Ray Fluorescence and Transmission Tomographic Inversion, Limited memory technique using trust regions for nonlinear equations, Dynamic scaling based preconditioning for truncated Newton methods in large scale unconstrained optimization, A limited memory BFGS-type method for large-scale unconstrained optimization, A limited memory \(q\)-BFGS algorithm for unconstrained optimization problems, A general U-block model-based design procedure for nonlinear polynomial control systems, A study of the performance of classical minimizers in the quantum approximate optimization algorithm, Comparing epidemiological models with the help of visualization dashboards, Simultaneous Sensing Error Recovery and Tomographic Inversion Using an Optimization-Based Approach, Bilevel optimization, deep learning and fractional Laplacian regularization with applications in tomography, Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory, Planar conjugate gradient algorithm for large-scale unconstrained optimization. II: Application, Personalized Policy Learning Using Longitudinal Mobile Health Data, A framework of conjugate direction methods for symmetric linear systems in optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Rates of convergence for adaptive Newton methods
- Assessing a search direction within a truncated Newton method
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Newton-Type Minimization via the Lanczos Method
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- Preconditioning of Truncated-Newton Methods
- Inexact Newton Methods
- A Numerical Study of the Limited Memory BFGS Method and the Truncated-Newton Method for Large Scale Optimization
- A General-Purpose Parallel Algorithm for Unconstrained Optimization
- Solution of Sparse Indefinite Systems of Linear Equations
- A Barrier Method for Large-Scale Constrained Optimization
- On the Complexity of a Practical Interior-Point Method
- Curvilinear Stabilization Techniques for Truncated Newton Methods in Large Scale Unconstrained Optimization
- Globally Convergent Inexact Newton Methods
- Element-by-Element Preconditioners for Large Partially Separable Optimization Problems
- NITSOL: A Newton Iterative Solver for Nonlinear Systems
- Automatic Preconditioning by Limited Memory Quasi-Newton Updating
- Solving the Trust-Region Subproblem using the Lanczos Method
- Newton's Method for Large Bound-Constrained Optimization Problems
- Preconditioning Reduced Matrices
- Choosing the Forcing Terms in an Inexact Newton Method
- Modified Cholesky Factorizations for Sparse Preconditioners
