Optimizing partially separable functions without derivatives

B. Colson, Philippe Toint

    Résultats de recherche: Contribution à un journal/une revueArticleRevue par des pairs

    51 Téléchargements (Pure)

    Résumé

    We present an algorithm for solving nonlinear programming problems involving a partially separable objective function whose derivatives are assumed to be unavailable. At each iteration, we construct a quadratic interpolation model of the objective function around the current iterate and minimize this model to obtain a trial step. The whole process is embedded within a trust-region framework. We further propose to use ideas of Curtis, Powell and Reid to minimize the number of calls to the objective function in the part of the derivative-free algorithm that improves the geometry of the interpolation set. Numerical experiments tend to confirm the promising behaviour of the algorithm. © 2005 Taylor & Francis Group Ltd.
    langue originaleAnglais
    Pages (de - à)493-508
    Nombre de pages16
    journalOptimization Methods and Software
    Volume20
    Numéro de publication4-5
    Les DOIs
    Etat de la publicationPublié - 1 août 2005

    Empreinte digitale Examiner les sujets de recherche de « Optimizing partially separable functions without derivatives ». Ensemble, ils forment une empreinte digitale unique.

    Contient cette citation