Sequential systems of linear equations algorithm for nonlinear optimization problems -- general constrained problems. (Q1412598): 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 two-stage feasible directions algorithm for nonlinear constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasible directions algorithms for optimization problems with equality and inequality constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Test example for nonlinear programming codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: More test examples for nonlinear programming codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The watchdog technique for forcing convergence in algorithms for constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3147249 / rank
 
Normal rank

Latest revision as of 11:53, 6 June 2024

scientific article
Language Label Description Also known as
English
Sequential systems of linear equations algorithm for nonlinear optimization problems -- general constrained problems.
scientific article

    Statements

    Sequential systems of linear equations algorithm for nonlinear optimization problems -- general constrained problems. (English)
    0 references
    0 references
    0 references
    0 references
    25 November 2003
    0 references
    The authors consider the general nonlinear programming problem with equality and inequality constraints. A new superlinear convergent algorithm of sequential systems of linear equations for nonlinearly constrained optimization problems is given which has advantages comparing with successive quadratic programming algorithms. Numerical tests are presented.
    0 references
    Constrained optimization
    0 references
    Algorithm
    0 references
    Sequential systems of linear equations
    0 references
    superlinear convergence
    0 references
    comparison of methods
    0 references
    numerical examples
    0 references
    successive quadratic programming
    0 references
    0 references

    Identifiers