I am very pleased to announce that the winners of the fifth annual Journal of Global Optimization Best Paper Award are Andrei Patrascu and Ion Necoara for their paper titled Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization .
Journal of Global Optimization Best Paper Award for 2015
Authors: Andrei Patrascu and Ion Necoara
Title: Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization
In this paper we analyze several new methods for solving nonconvex optimization problems with the objective function consisting of a sum of two terms: one is nonconvex and smooth, and another is convex but simple and its structure is known. Further, we consider both cases: unconstrained and linearly constrained nonconvex problems. For optimization problems of the above structure, we propose random coordinate descent algorithms and analyze their convergence properties. For the general case, when the objective function is nonconvex and composite we prove asymptotic convergence for the sequences generated by our algorithms to stationary points and sublinear rate of convergence in expectation for some optimality measure. Additionally, if the objective function satisfies an error bound condition we derive a local linear rate of convergence for the expected values of the objective function. We also present extensive numerical experiments for evaluating the performance of our algorithms in comparison with state-of-the-art methods.
The award consists of $1000 and a commemorative plaque, and the award selection committee is comprised of several members of the editorial board. This year, Immanuel Bomze, Matthias Ehrgott, Oleg Prokopyev, Nikolaos Sahinidis, and Fabio Schoen served on the committee. We received record 27 nominations, 7 of which were selected as finalists. Based on the committee’s votes, the following papers are recognized as “Top-5 Papers Published in Journal of Global Optimization in 2015”:
Kerstin Dächert and Kathrin Klamroth, A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems .
Coralia Cartis, Jaroslav M. Fowkes, and Nicholas I. M. Gould, Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties .
Peter J. C. Dickinson and Janez Povh, On an extension of Póya’s Positivstellensatz .
Ralph Baker Kearfott, Some observations on exclusion regions in branch and bound algorithms .
Congratulations to the award recipients and the authors of recognized papers on their excellent work! I would also like to thank Springer for sponsoring this award and the members of the award selection committee for their dedicated service. Please email your nominations for the 2016 Best Paper Award to email@example.com. All papers published in the journal in 2016 (volumes 64–66) are eligible.
Cartis, C., Fowkes, J.M., Gould, N.I.M.: Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties. J. Glob. Optim. 61, 429–457 (2015)
Dächert, K., Klamroth, K.: A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems. J. Glob. Optim. 61, 643–676 (2015)
Dickinson, P.J.C., Povh, J.: On an extension of Pólya’s Positivstellensatz. J. Glob. Optim. 61, 615–625 (2015)
Kearfott, R.B.: Some observations on exclusion regions in branch and bound algorithms. J. Glob. Optim. 62, 229–241 (2015)
Patrascu, A., Necoara, I.: Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization. J. Glob. Optim. 61, 19–46 (2015)
Rights and permissions
About this article
Cite this article
Butenko, S. Journal of Global Optimization Best Paper Award for 2015. J Glob Optim 66, 595–596 (2016). https://doi.org/10.1007/s10898-016-0479-4