Superlinear convergence of a Newton-type algorithm for monotone equations (Q1781869): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A nonsmooth version of Newton's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local behavior of an iterative framework for generalized equations with nonisolated solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Superlinearly Convergent Algorithm for the Monotone Nonlinear Complementarity Problem Without Uniqueness and Nondegeneracy Conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Proximal Point Algorithm with Genuine Superlinear Convergence for the Monotone Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Levenberg--Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularized Newton methods for convex minimization problems with singular solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum norm solution of linear programs / rank
 
Normal rank

Latest revision as of 12:14, 10 June 2024

scientific article
Language Label Description Also known as
English
Superlinear convergence of a Newton-type algorithm for monotone equations
scientific article

    Statements

    Superlinear convergence of a Newton-type algorithm for monotone equations (English)
    0 references
    9 June 2005
    0 references
    0 references
    Monotone equations
    0 references
    Newton method
    0 references
    global convergence
    0 references
    superlinear convergence
    0 references
    convex minimization
    0 references
    0 references