Global Convergence of a Non-monotone Trust-Region Filter Algorithm for Nonlinear Programming

Nick Gould; Philippe Toint

Global Convergence of a Non-monotone Trust-Region Filter Algorithm for Nonlinear Programming

Résultats de recherche: Contribution dans un livre/un catalogue/un rapport/dans les actes d'une conférence › Chapitre

Résumé

A non-monotone variant of the trust-region SQP-filter algorithm analyzed in Fletcher, Gould, Leyffer, Toint and waechter (1999) is defined, that directly uses the dominated area of the filter as an acceptability criterion for trial points. It is proved that, under reasonable assumptions and for all possible choices of the starting point, the algorithm generates at least a subsequence converging to a first-order critical point

langue originale	Anglais
titre	Multiscale Optimization and Applications
rédacteurs en chef	P Pardalos, W Hager
Lieu de publication	Dordrecht
Editeur	Kluwer
Pages	129-154
Nombre de pages	26
Etat de la publication	Publié - 2005

ADALGOPT: ADALGOPT - Algorithmes avancés en optimisation non-linéaire
Sartenaer, A. & TOINT, P.
1/01/87 → …
Projet: Axe de recherche

Contient cette citation

@inbook{ae0bbef7e4324ebebe3de2368c370fa3,

title = "Global Convergence of a Non-monotone Trust-Region Filter Algorithm for Nonlinear Programming",

abstract = "A non-monotone variant of the trust-region SQP-filter algorithm analyzed in Fletcher, Gould, Leyffer, Toint and waechter (1999) is defined, that directly uses the dominated area of the filter as an acceptability criterion for trial points. It is proved that, under reasonable assumptions and for all possible choices of the starting point, the algorithm generates at least a subsequence converging to a first-order critical point",

author = "Nick Gould and Philippe Toint",

note = "Publication editors : P. Pardalos, and W. Hager",

year = "2005",

language = "English",

pages = "129--154",

editor = "P Pardalos and W Hager",

booktitle = "Multiscale Optimization and Applications",

publisher = "Kluwer",

}

TY - CHAP

T1 - Global Convergence of a Non-monotone Trust-Region Filter Algorithm for Nonlinear Programming

AU - Gould, Nick

AU - Toint, Philippe

N1 - Publication editors : P. Pardalos, and W. Hager

PY - 2005

Y1 - 2005

N2 - A non-monotone variant of the trust-region SQP-filter algorithm analyzed in Fletcher, Gould, Leyffer, Toint and waechter (1999) is defined, that directly uses the dominated area of the filter as an acceptability criterion for trial points. It is proved that, under reasonable assumptions and for all possible choices of the starting point, the algorithm generates at least a subsequence converging to a first-order critical point

AB - A non-monotone variant of the trust-region SQP-filter algorithm analyzed in Fletcher, Gould, Leyffer, Toint and waechter (1999) is defined, that directly uses the dominated area of the filter as an acceptability criterion for trial points. It is proved that, under reasonable assumptions and for all possible choices of the starting point, the algorithm generates at least a subsequence converging to a first-order critical point

M3 - Chapter

SP - 129

EP - 154

BT - Multiscale Optimization and Applications

A2 - Pardalos, P

A2 - Hager, W

PB - Kluwer

CY - Dordrecht

ER -

Global Convergence of a Non-monotone Trust-Region Filter Algorithm for Nonlinear Programming

Résumé

Empreinte digitale

Projets

ADALGOPT: ADALGOPT - Algorithmes avancés en optimisation non-linéaire

Contient cette citation