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. Some numerical tests are presented to motivate a theoretical analysis showing convergence to first-order critical points irrespective of the given starting point.
|Number of pages||35|
|Journal||IMA Journal of Numerical Analysis|
|Publication status||Unpublished - 2008|
- nonlinear optimization
- Recursive methods
- convergence theory
- multilevel problems