A superlinearly and quadratically convergent SQP type feasible method for constrained optimization (Q1589812): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4879594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4884524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4950903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3915937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4867545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on a Continuously Differentiable Exact Penalty Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust recursive quadratic programming algorithm model with global and superlinear convergence properties / rank
 
Normal rank

Revision as of 10:15, 3 June 2024

scientific article
Language Label Description Also known as
English
A superlinearly and quadratically convergent SQP type feasible method for constrained optimization
scientific article

    Statements

    A superlinearly and quadratically convergent SQP type feasible method for constrained optimization (English)
    0 references
    0 references
    0 references
    0 references
    16 July 2002
    0 references
    constrained optimization
    0 references
    SQP
    0 references
    feasible method
    0 references
    convergence
    0 references
    rate of convergence
    0 references

    Identifiers