Utilize este identificador para referenciar este registo: http://hdl.handle.net/10400.22/4070
Título: Direct-search penalty/barrier methods
Autor: Correia, Aldina
Matias, João
Mestre, Pedro
Serôdio, Carlos
Palavras-chave: Non-smooth optimization
Nonlinear programming
Derivate-free
Direct search
Penalty/barrier methods
Data: 2010
Editora: International Association of Engineers
Relatório da Série N.º: World Congress on Engineering; Vol. 3
Resumo: In Nonlinear Optimization Penalty and Barrier Methods are normally used to solve Constrained Problems. There are several Penalty/Barrier Methods and they are used in several areas from Engineering to Economy, through Biology, Chemistry, Physics among others. In these areas it often appears Optimization Problems in which the involved functions (objective and constraints) are non-smooth and/or their derivatives are not know. In this work some Penalty/Barrier functions are tested and compared, using in the internal process, Derivative-free, namely Direct Search, methods. This work is a part of a bigger project involving the development of an Application Programming Interface, that implements several Optimization Methods, to be used in applications that need to solve constrained and/or unconstrained Nonlinear Optimization Problems. Besides the use of it in applied mathematics research it is also to be used in engineering software packages.
Peer review: yes
URI: http://hdl.handle.net/10400.22/4070
ISBN: 978-988-18210-8-9
ISSN: 2078-0958
2078-0966
Versão do Editor: http://www.iaeng.org/publication/WCE2010/
Aparece nas colecções:ESTGF - CNE - Comunicações em Eventos Científicos
ESTGF - CIICESI - Comunicações em eventos científicos

Ficheiros deste registo:
Ficheiro Descrição TamanhoFormato 
COM_AldinaCorreia_2010.pdf802,55 kBAdobe PDFVer/Abrir    Acesso Restrito. Solicitar cópia ao autor!


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.