Global Convergence of a Hybrid Trust-Region SQP-Filter Algorithm for General Nonlinear Programming: IFIP TC7 20th Conference on System Modeling and Optimization, July 23-27, 2001, Trier, Germany

Nick Gould, Philippe Toint

    Research output: Contribution in Book/Catalog/Report/Conference proceedingChapter

    Abstract

    Global convergence to first-order critical points is proved for a variant of the trust-region SQP-filter algorithm analyzed in Fletcher, Gould, Leyffer, Toint and Waechter (2002). This variant allows the use of two types of step strategies: the first decomposes the step into its normal and tangential components, while the second replaces this decomposition by a stronger condition on the associated model decrease
    Original languageEnglish
    Title of host publicationSystem Modeling and Optimization XX
    EditorsE Sachs, R Tichatschke
    Place of PublicationDordrecht, NL
    PublisherKluwer Academic Publishers
    Pages23-54
    Number of pages32
    ISBN (Print)1-4020-7565-0
    Publication statusPublished - 2003

    Keywords

    • Filter methods
    • nonlinear optimization
    • convergence theory.
    • sequential quadratic programming

    Fingerprint

    Dive into the research topics of 'Global Convergence of a Hybrid Trust-Region SQP-Filter Algorithm for General Nonlinear Programming: IFIP TC7 20th Conference on System Modeling and Optimization, July 23-27, 2001, Trier, Germany'. Together they form a unique fingerprint.

    Cite this