Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||A NEW TRUST REGION ALGORITHM FOR BOUND CONSTRAINED MINIMIZATION|
|Abstract:||We introduce a new algorithm of trust-region type for minimizing a differentiable function of many variables with box constraints. At each step of the algorithm we use an approximation to the minimizer of a quadratic in a box. We introduce a new method for solving this subproblem, that has finite termination without dual nondegeneracy assumptions. We prove the global convergence of the main algorithm and a result concerning the identification of the active constraints in finite time. We describe an implementation of the method and we present numerical experiments showing the effect of solving the subproblem with different degrees of accuracy.|
|Subject:||BOUND CONSTRAINED MINIMIZATION|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.