A globally and quadratically convergent algorithm for general nonlinear programming problems (Q1151728): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A computational comparison of some non-linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Class of Accelerated Conjugate Direction Methods for Linearly Constrained Minimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4159192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5630864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Penalty function versus non-penalty function methods for constrained nonlinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A superlinearly convergent method for minimization problems with linear inequality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratically-convergent algorithm for general nonlinear programming problems / rank
 
Normal rank

Latest revision as of 12:06, 13 June 2024

scientific article
Language Label Description Also known as
English
A globally and quadratically convergent algorithm for general nonlinear programming problems
scientific article

    Statements

    A globally and quadratically convergent algorithm for general nonlinear programming problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1981
    0 references
    0 references
    Robinson's method
    0 references
    global convergence
    0 references
    penalty algorithms
    0 references
    quadratic convergence
    0 references