Second-order multiplier iteration based on a class of nonlinear Lagrangians (Q1722349): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59036069, #quickstatements; #temporary_batch_1714786519576
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Multiplier and gradient methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplier methods: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence properties of second-order multiplier methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4085502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3690580 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear rescaling and proximal-like methods in convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual nonlinear rescaling method for convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual nonlinear rescaling method with dynamic scaling parameter update / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Penalty/Barrier Multiplier Methods for Convex Programming Problems / rank
 
Normal rank

Latest revision as of 04:29, 18 July 2024

scientific article
Language Label Description Also known as
English
Second-order multiplier iteration based on a class of nonlinear Lagrangians
scientific article

    Statements

    Second-order multiplier iteration based on a class of nonlinear Lagrangians (English)
    0 references
    0 references
    14 February 2019
    0 references
    Summary: Nonlinear Lagrangian algorithm plays an important role in solving constrained optimization problems. It is known that, under appropriate conditions, the sequence generated by the first-order multiplier iteration converges superlinearly. This paper aims at analyzing the second-order multiplier iteration based on a class of nonlinear Lagrangians for solving nonlinear programming problems with inequality constraints. It is suggested that the sequence generated by the second-order multiplier iteration converges superlinearly with order at least two if in addition the Hessians of functions involved in problem are Lipschitz continuous.
    0 references

    Identifiers