Full text
| |
| Author(s): |
Larissa Oliveira Xavier
Total Authors: 1
|
| Document type: | Master's Dissertation |
| Press: | Campinas, SP. |
| Institution: | Universidade Estadual de Campinas (UNICAMP). Instituto de Matemática, Estatística e Computação Científica |
| Defense date: | 2007-04-20 |
| Examining board members: |
Sandra Augusta Santos;
Elizabeth Wegner Karas;
Márcia Aparecida Gomes Ruggiero
|
| Advisor: | José Mario Martínez Pérez; Sandra Augusta Santos |
| Abstract | |
This work investigates issues related to the performance of trust-region algorithms for large-scale unconstrained minimization. The classic algorithm of Moré and Sorensen, based on Cholesky?s factorizations, is compared with the approach of Rojas, Santos and Sorensen (algorithm RSS). From the theoretic standpoint, the convergence results of both algorithms are compiled. In practical terms, problems with the typical structure of packying of cylinders are solved. The effective performance of the algorithm RSS in the approximate solution of the subproblems is analyzed as well, together with the influence of the inner precision of the subproblems to the global effort of the algorithm (AU) | |