Idioma:

A stochastic coordinate descent for bound constrained global optimization

Rocha, Ana Maria A. C. ; Costa, M. Fernanda P. ; Fernandes, Edite M. G. P. Sergeyev, Yaroslav D. ; Emmerich, Michael T. M. ; Deutz, André H. ; Hille, Sander C.

AIP Conference Proceedings, 2019, Vol.2070 (1) [Periódico revisado por pares]

Sem texto completo

Citações Citado por

Título:
A stochastic coordinate descent for bound constrained global optimization
Autor: Rocha, Ana Maria A. C. ; Costa, M. Fernanda P. ; Fernandes, Edite M. G. P.
Sergeyev, Yaroslav D. ; Emmerich, Michael T. M. ; Deutz, André H. ; Hille, Sander C.
Assuntos: Algorithms ; Descent ; Global optimization ; Machine learning
É parte de: AIP Conference Proceedings, 2019, Vol.2070 (1)
Descrição: This paper presents a stochastic coordinate descent algorithm for solving bound constrained global optimization problems. The algorithm borrows ideas from some stochastic optimization methods available for the minimization of expected and empirical risks that arise in large-scale machine learning. Initially, the algorithm generates a population of points although only a small subpopulation of points is randomly selected and moved at each iteration towards the global optimal solution. Each point of the subpopulation is moved along one component only of the negative gradient direction. Preliminary experiments show that the algorithm is effective in reaching the required solution.
Editor: Melville: American Institute of Physics
Idioma: Inglês

Voltar para lista de resultados

Anterior Resultado 4 Avançar Ir para próxima página