Jacobian-free implicit inner-iteration preconditioner for nonlinear least squares problems
Publication:333209
DOI10.1007/S10915-016-0167-ZzbMath1352.65158OpenAlexW2270206726MaRDI QIDQ333209
Ning Zheng, Ken Hayami, Wei Xu
Publication date: 28 October 2016
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-016-0167-z
convergencepreconditioningautomatic differentiationNewton methodnumerical experimenttrust region methodBA-GMRES methodCGLS methoddogleg methodnonlinear least squares problemweighted Jacobi method
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Methods of quasi-Newton type (90C53) Interior-point methods (90C51) Numerical differentiation (65D25) Preconditioners for iterative methods (65F08)
Related Items (5)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A secant method for nonlinear least-squares minimization
- Truncated Newton method for sparse unconstrained optimization using automatic differentiation
- Jacobian-free Newton-Krylov methods: a survey of approaches and applications.
- Condition numbers and equilibration of matrices
- Efficient (Partial) Determination of Derivative Matrices via Automatic Differentiation
- Preconditioned Iterative Methods for Solving Linear Least Squares Problems
- GMRES Methods for Least Squares Problems
- Preconditioner updates for solving sequences of linear systems in matrix-free environment
- Efficient Preconditioner Updates for Shifted Linear Systems
- Nonsymmetric Preconditioner Updates in Newton–Krylov Methods for Nonlinear Systems
- Inexact Newton Dogleg Methods
- Efficient Preconditioning of Sequences of Nonsymmetric Linear Systems
- Evaluating Derivatives
- IDR(s): A Family of Simple and Fast Algorithms for Solving Large Nonsymmetric Systems of Linear Equations
- Fast (Structured) Newton Computations
- Preconditioning of Truncated-Newton Methods
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Automatic Preconditioning by Limited Memory Quasi-Newton Updating
- A Matrix-Free Preconditioner for Sparse Symmetric Positive Definite Systems and Least-Squares Problems
- Convergence of Inner-Iteration GMRES Methods for Rank-Deficient Least Squares Problems
- Inner-Iteration Krylov Subspace Methods for Least Squares Problems
- Solving nonlinear equations with the Newton–Krylov method based on automatic differentiation
- Methods of conjugate gradients for solving linear systems
This page was built for publication: Jacobian-free implicit inner-iteration preconditioner for nonlinear least squares problems