A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization (Q2460608): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Gradient Projection Method for Nonlinear Programming. Part II. Nonlinear Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3680625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3771509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3361813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Study on a supermemory gradient method for the minimization of functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supermemory descent methods for unconstrained minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3658642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2720792 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4416124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new super-memory gradient method with curve search rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4381221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5866773 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2746550 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4950903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm For Inequality Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Test examples for nonlinear programming codes / rank
 
Normal rank

Latest revision as of 12:54, 27 June 2024

scientific article
Language Label Description Also known as
English
A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization
scientific article

    Statements

    A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization (English)
    0 references
    12 November 2007
    0 references
    0 references
    Inequality constrained optimization
    0 references
    super-memory gradient method
    0 references
    strongly sub-feasible directions
    0 references
    global convergence
    0 references
    strong convergence
    0 references
    0 references
    0 references
    0 references
    0 references