Viabilidade em programação não-linear : restauração e aplicações / Nonlinear programming feasibility: restoration and applications
AUTOR(ES)
Juliano do Bem Francisco
DATA DE PUBLICAÇÃO
2005
RESUMO
Abstract Robust and numerically feasible algorithms for solving optimization problems have been demanded for solving practice problems that appear in Engineering, Chemistry, Physics and others. This work present a new globally convergent method based on trust regions for solving box-constrained underdetermined nonlinear systems (more unknowns than equations), that can be used on the feasibility fase of algorithms based on periodic restoration. Under some assumptions, it will be proved locally quadratic convergence. In other part of this work, a new globally convergent algorithm is introduced, based on trust regions, for solving the optimization problem min f(x); s:t: x 2 D; where f : Rn ! R is continuously dierentiable and D C Rn is an arbitrary closed subset. Instead of considering explicitly the trust region on the subproblems, the method introduces a regularization parameter that mimics the trust region. With this characterization, the subproblems consist on minimizing a quadratic model of f subject to D. numerically feasible globally convergent algorithm for electronic structure calculations is obtained
ASSUNTO(S)
nonlinear systems sistemas não-lineares programação não-linear estrutura eletronica otimização matematica nonlinear programming mathematical optimization electronic structure
ACESSO AO ARTIGO
http://libdigi.unicamp.br/document/?code=vtls000349407Documentos Relacionados
- Contributions to the study of nonlinear programming with uncertainties
- Algorithms for nonlinear programming problems with integer and continuous variables.
- Programação não-linear com parametros fuzzy: teoria e algoritmos
- Linear and non-linear giant magnetoimpedance in amorphous alloys
- Dinâmica não-linear e exercício físico: conceitos e aplicações