A recursive ℓ-trust-region method for bound-constrained nonlinear optimization

Serge Gratton, M. Mouffe, Philippe Toint, M. Weber-Mendona

Research output: Contribution to journalArticlepeer-review


A recursive trust-region method is introduced for the solution of bound-cons-trained nonlinear nonconvex optimization problems for which a hierarchy of descriptions exists. Typical cases are infinite-dimensional problems for which the levels of the hierarchy correspond to discretization levels, from coarse to fine. The new method uses the infinity norm to define the shape of the trust region, which is well adapted to the handling of bounds and also to the use of successive coordinate minimization as a smoothing technique. Numerical tests motivate a theoretical analysis showing convergence to first-order critical points irrespective of the starting point.
Original languageEnglish
Pages (from-to)827-861
Number of pages35
JournalIMA Journal of Numerical Analysis
Issue number4
Publication statusPublished - 1 Oct 2008


Dive into the research topics of 'A recursive ℓ-trust-region method for bound-constrained nonlinear optimization'. Together they form a unique fingerprint.

Cite this