Global convergence of a class of trust region algorithms for optimization using inexact projections on convex constraints

Andy Conn, Nick Gould, Annick Sartenaer, Philippe Toint

    Résultats de recherche: Contribution à un journal/une revueArticle

    34 Téléchargements (Pure)

    Résumé

    A class of trust region based algorithms is presented for the solution of nonlinear optimization problems with a convex feasible set. At variance with previously published analysis of this type, the theory presented allows for the use of general norms. Furthermore, the proposed algorithms do not require the explicit computation of the projected gradient, and can therefore be adapted to cases where the projection onto the feasible domain may be expensive to calculate. Strong global convergence results are derived for the class. It is also shown that the set of linear and nonlinear constraints that are binding at the solution are identified by the algorithms of the class in a finite number of iterations.
    langue originaleAnglais
    Pages (de - à)164-221
    Nombre de pages58
    journalSIAM Journal on Optimization
    Volume3
    Numéro de publication1
    Etat de la publicationPublié - 1993

    Empreinte digitale

    Examiner les sujets de recherche de « Global convergence of a class of trust region algorithms for optimization using inexact projections on convex constraints ». Ensemble, ils forment une empreinte digitale unique.

    Contient cette citation