Utilize este identificador para referenciar este registo:
https://hdl.handle.net/10316/45560
Título: | A Merit Function Approach for Direct Search | Autor: | Gratton, Serge Vicente, Luís Nunes |
Data: | 2014 | Editora: | Society for Industrial and Applied Mathematics (SIAM) | Projeto: | info:eu-repo/grantAgreement/FCT/COMPETE/132981/PT | Título da revista, periódico, livro ou evento: | SIAM Journal on Optimization | Volume: | 24 | Número: | 4 | Resumo: | In this paper it is proposed to equip direct-search methods with a general procedure to minimize an objective function, possibly nonsmooth, without using derivatives and subject to constraints on the variables. One aims at considering constraints, most likely nonlinear or nonsmooth, for which the derivatives of the corresponding functions are also unavailable. The novelty of this contribution relies mostly on how relaxable constraints are handled. Such constraints, which can be relaxed during the course of the optimization, are taken care of by a merit function and, if necessary, by a restoration procedure. Constraints that are unrelaxable, when present, are treated by an extreme barrier approach. One is able to show that the resulting merit function direct-search algorithm exhibits global convergence properties for first-order stationary constraints. As in the progressive barrier method [C. Audet and J. E. Dennis Jr., SIAM J. Optim., 20 (2009), pp. 445--472], we provide a mechanism to indicate the transfer of constraints from the relaxable set to the unrelaxable one. | URI: | https://hdl.handle.net/10316/45560 | DOI: | 10.1137/130917661 | Direitos: | openAccess |
Aparece nas coleções: | I&D CMUC - Artigos em Revistas Internacionais |
Mostrar registo em formato completo
Citações SCOPUSTM
19
Visto em 26/ago/2024
Citações WEB OF SCIENCETM
5
17
Visto em 2/set/2024
Visualizações de página 10
819
Visto em 3/set/2024
Downloads
173
Visto em 3/set/2024
Google ScholarTM
Verificar
Altmetric
Altmetric
Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.