Inexact perturbed Newton methods and applications to a class of Krylov solvers
From MaRDI portal
Publication:5942219
DOI10.1023/A:1017583307974zbMath0980.65054OpenAlexW68750926MaRDI QIDQ5942219
Publication date: 28 August 2001
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1017583307974
Related Items (7)
The inexact, inexact perturbed, and quasi-Newton methods are equivalent models ⋮ A perturbed version of an inexact generalized Newton method for solving nonsmooth equations ⋮ A survey on the high convergence orders and computational convergence orders of sequences ⋮ On the superlinear convergence of the successive approximations method ⋮ Estimating the radius of an attraction ball ⋮ How Many Steps Still Left to $x$*? ⋮ A globally convergent incremental Newton method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Q-order and R-order of convergence
- Reduced storage matrix methods in stiff ODE systems
- Sharp error bounds for Newton's process
- Perturbation lemma for the Newton method with application to the SQP Newton method
- Concerning the convergence of inexact Newton methods
- On the characterization of \(Q\)-superlinear convergence of quasi-Newton interior-point methods for nonlinear programming
- Analysis of a Minimum Perturbation Algorithm for Nonsymmetric Linear Systems
- Hybrid Krylov Methods for Nonlinear Systems of Equations
- The Effect of Rounding Errors on Newton-like Methods
- Local Convergence of Inexact Newton Methods
- Inaccuracy in quasi-Newton methods: Local improvement theorems
- Continuation-Conjugate Gradient Methods for the Least Squares Solution of Nonlinear Boundary Value Problems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Krylov Subspace Methods for Solving Large Unsymmetric Linear Systems
- Inexact Newton Methods
- Efficient High Accuracy Solutions with ${\text{GMRES}}(m)$
- Asymptotic Mesh Independence of Newton–Galerkin Methods via a Refined Mysovskii Theorem
- Quasi-Newton Methods, Motivation and Theory
- On Newton-Iterative Methods for the Solution of Systems of Nonlinear Equations
- Convergence Theory of Nonlinear Newton–Krylov Algorithms
- Globally Convergent Inexact Newton Methods
- On a new Newton-Mysovskii-type theorem with applications to inexact Newton-like methods and their discretizations
- A Local Convergence Theory for Combined Inexact-Newton/Finite-Difference Projection Methods
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- GMBACK: A Generalised Minimum Backward Error Algorithm for Nonsymmetric Linear Systems
- Choosing the Forcing Terms in an Inexact Newton Method
- Any Nonincreasing Convergence Curve is Possible for GMRES
- On the Compatibility of a Given Solution With the Data of a Linear System
- A Theoretical Comparison of the Arnoldi and GMRES Algorithms
This page was built for publication: Inexact perturbed Newton methods and applications to a class of Krylov solvers