Solving nonlinear programming problems with very many constraints (Q4327941): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3337235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numerically stable dual method for solving strictly convex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combined lp and quasi-Newton methods for minimax optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superlinearly convergent variable metric algorithms for general nonlinear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A globally convergent method for nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for nonlinear constraints that use lagrangian functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the quadratic programming algorithm of Goldfarb and Idnani / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of a sequential quadratic programming method with an augmented lagrangian line search function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative study of several semi-infinite nonlinear programming algorithms / rank
 
Normal rank

Latest revision as of 11:28, 23 May 2024

scientific article; zbMATH DE number 737355
Language Label Description Also known as
English
Solving nonlinear programming problems with very many constraints
scientific article; zbMATH DE number 737355

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references