Projets par an
Résumé
A class of trust-region methods for solving constrained optimization problems in Hilbert space is described. The algorithms of the class use, at every iteration, a local model of the objective, on which very weak conditions are imposed. Global convergence results are then derived for the class without assuming convexity of the objective functional. It is also shown that convergence of the classical projected-gradient method can be viewed as a special case of this theory. An example is finally given that points out some difficulties appearing when using active-set strategies in infinite-dimensional spaces.
langue originale | Anglais |
---|---|
Pages (de - à) | 231-252 |
Nombre de pages | 22 |
journal | IMA Journal of Numerical Analysis |
Volume | 8 |
Numéro de publication | 2 |
Les DOIs | |
Etat de la publication | Publié - 1 avr. 1988 |
Empreinte digitale
Examiner les sujets de recherche de « Global convergence of a a of trust-region methods for nonconvex minimization in Hilbert space ». Ensemble, ils forment une empreinte digitale unique.Projets
- 1 Actif
-
ADALGOPT: ADALGOPT - Algorithmes avancés en optimisation non-linéaire
1/01/87 → …
Projet: Axe de recherche