Newton-MR: inexact Newton method with minimum residual sub-problem solver (Q6114941)

scientific article; zbMATH DE number 7711254

Language	Label	Description	Also known as
English	Newton-MR: inexact Newton method with minimum residual sub-problem solver	scientific article; zbMATH DE number 7711254

Statements

instance of

scholarly article

0 references

title

Newton-MR: inexact Newton method with minimum residual sub-problem solver (English)

0 references

published in

EURO Journal on Computational Optimization

0 references

publication date

12 July 2023

0 references

full work available at URL

https://arxiv.org/abs/1810.00303

0 references

zbMATH Keywords

inexact Newton method

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

A globally convergent Newton-GMRES method for large sparse systems of nonlinear equations

0 references

Degenerate Nonlinear Programming with a Quadratic Growth Condition

0 references

A unified local convergence analysis of inexact constrained Levenberg-Marquardt methods

0 references

Local convergence analysis of the Levenberg-Marquardt framework for nonzero-residue nonlinear least-squares problems under an error bound condition

0 references

Convergence of a Regularized Euclidean Residual Algorithm for Nonlinear Least-Squares

0 references

A Levenberg-Marquardt method for large nonlinear least-squares problems with dynamic accuracy in functions and gradients

0 references

Q2724476

0 references

A Globally Convergent Newton-GMRES Subspace Method for Systems of Nonlinear Equations

0 references

What is invexity?

0 references

An investigation of Newton-Sketch and subsampled Newton methods

0 references

On the use of iterative methods in cubic regularization for unconstrained optimization

0 references

Exact and inexact subsampled Newton methods for optimization

0 references

Q4821526

0 references

Hybrid Krylov Methods for Nonlinear Systems of Equations

0 references

Convergence Theory of Nonlinear Newton–Krylov Algorithms

0 references

On the Use of Stochastic Hessian Information in Optimization Methods for Machine Learning

0 references

Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results

0 references

Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity

0 references

Newton-like methods for solving underdetermined nonlinear equations with nondifferentiable terms

0 references

MINRES-QLP: A Krylov Subspace Method for Indefinite or Singular Symmetric Systems

0 references

Algorithm 937

0 references

Q5301029

0 references

Trust Region Methods

0 references

Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization

0 references

Inexact Newton Methods

0 references

Q4868581

0 references

Benchmarking optimization software with performance profiles.

0 references

Globally Convergent Inexact Newton Methods

0 references

Choosing the Forcing Terms in an Inexact Newton Method

0 references

Regularization methods for uniformly rank-deficient nonlinear least-squares problems

0 references

Euclidean-Norm Error Bounds for SYMMLQ and CG

0 references

The modified Levenberg-Marquardt method for nonlinear equations with cubic convergence

0 references

On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption

0 references

Critical Point-Finding Methods Reveal Gradient-Flat Regions of Deep Network Losses

0 references

Q4917542

0 references

A Note on Performance Profiles for Benchmarking Software

0 references

Solving the Trust-Region Subproblem using the Lanczos Method

0 references

Approximate Gauss–Newton Methods for Nonlinear Least Squares Problems

0 references

On sufficiency of the Kuhn-Tucker conditions

0 references

Q4575447

0 references

Q4841246

0 references

<tt>trlib</tt>: a vector-free implementation of the GLTR method for iterative solution of the trust region problem

0 references

Regularized Newton methods for convex minimization problems with singular solutions

0 references

Truncated regularized Newton method for convex minimizations

0 references

Loss landscapes and optimization in over-parameterized non-linear systems and neural networks

0 references

Error bounds and convergence analysis of feasible descent methods: A general approach

0 references

Invexity and optimization

0 references

Convergence behaviour of inexact Newton methods

0 references

Q5053228

0 references

Introductory lectures on convex optimization. A basic course.

0 references

Modified Gauss–Newton scheme with worst case guarantees for global performance

0 references

Cubic regularization of Newton method and its global performance

0 references

Q5491447

0 references

Random perturbation of low rank matrices: improving classical bounds

0 references

Solution of Sparse Indefinite Systems of Linear Equations

0 references

Sub-sampled Newton methods

0 references

Linear Convergence of Descent Methods for the Unconstrained Minimization of Restricted Strongly Convex Functions

0 references

Understanding Machine Learning

0 references

The Conjugate Gradient Method and Trust Regions in Large Scale Optimization

0 references

Optimization theory and methods. Nonlinear programming

0 references

Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization

0 references

Least-Change Secant Update Methods for Underdetermined Systems

0 references

Newton-type methods for non-convex optimization under inexact Hessian information

0 references

Q2765625

0 references

Recent advances in numerical methods for nonlinear equations and nonlinear least squares

0 references

The restricted strong convexity revisited: analysis of equivalence to error bound and quadratic growth

0 references

Restricted strong convexity and its applications to convergence analysis of gradient-type methods in convex optimization

0 references

Global complexity bound of the Levenberg–Marquardt method

0 references

On the convergence of an inexact Newton-type method

0 references

Superlinear convergence of a Newton-type algorithm for monotone equations

0 references

Identifiers

arXiv ID

1810.00303

0 references

DOI

10.1016/j.ejco.2022.100035

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6114941