Superlinear convergence of a Newton-type algorithm for monotone equations

DOI10.1007/s10957-004-1721-7zbMath1114.65055MaRDI QIDQ1781869

Niranjan Chakravarthy

Publication date: 9 June 2005

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-004-1721-7

zbMATH Keywords

global convergence; Newton method; superlinear convergence; convex minimization; Monotone equations

Mathematics Subject Classification ID

65H10: Numerical computation of solutions to systems of equations

90C53: Methods of quasi-Newton type

Related Items

An Liu-Storey-Type Method for Solving Large-Scale Nonlinear Monotone Equations, A regularized Newton method for monotone nonlinear equations and its application, A derivative-free PRP method for solving large-scale nonlinear systems of equations and its global convergence, A Polak-Ribière-Polyak method for solving large-scale nonlinear systems of equations and its global convergence, A three-term derivative-free projection method for nonlinear monotone system of equations, Two derivative-free projection approaches for systems of large-scale nonlinear monotone equations, A superlinearly convergent hybrid algorithm for systems of nonlinear equations, A superlinearly convergent projection method for constrained systems of nonlinear equations, Truncated regularized Newton method for convex minimizations, On the convergence of an inexact Newton-type method, A new line search strategy for finding separating hyperplane in projection-based methods, A globally convergent derivative-free method for solving large-scale nonlinear monotone equations, Convergence of a generalized Newton and an inexact generalized Newton algorithms for solving nonlinear equations with nondifferentiable terms, A spectral algorithm for large-scale systems of nonlinear monotone equations, A regularized Newton method for degenerate unconstrained optimization problems, A double-projection-based algorithm for large-scale nonlinear systems of monotone equations, A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing, A projection method for a system of nonlinear monotone equations with convex constraints

Cites Work

• Levenberg--Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints
• Local behavior of an iterative framework for generalized equations with nonisolated solutions
• On the minimum norm solution of linear programs
• Regularized Newton methods for convex minimization problems with singular solutions
• A nonsmooth version of Newton's method
• The Proximal Point Algorithm with Genuine Superlinear Convergence for the Monotone Complementarity Problem
• A Superlinearly Convergent Algorithm for the Monotone Nonlinear Complementarity Problem Without Uniqueness and Nondegeneracy Conditions