Please use this identifier to cite or link to this item:
|Title:||A stochastic coordinate descent for bound constrained global optimization|
|Author(s):||Rocha, Ana Maria A. C.|
Costa, M. Fernanda P.
Fernandes, Edite Manuela da G. P.
|Publisher:||American Institute of Physics|
|Journal:||AIP Conference Proceedings|
|Abstract(s):||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.|
|Appears in Collections:|
Files in This Item:
|Stochastic CDM for LeGO_revised.pdf||112 kB||Adobe PDF||View/Open|