Global convergence of a class of trust-region methods for nonconvex minimization in Hilbert space. (English) Zbl 0698.65043

Summary: 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.


65K05 Numerical mathematical programming methods
90C48 Programming in abstract spaces
90C30 Nonlinear programming
Full Text: DOI