Embedded Files
Journal of Global Optimization Best Paper Award
Journal of Global Optimization Best Paper Award was established by Springer in 2011. It is awarded annually for a paper published in the previous year and consists of $1,000 cash prize. The winners are selected by a committee consisting of several editorial board members.
Award Recipients
2024
(for 2023 publications)
Winners
KKT-based primal-dual exactness conditions for the Shor relaxation
Marco Locatelli
General convex relaxations of implicit functions and inverse functions
Huiyi Cao & Kamil A. Khan
Award Committee
Leo Liberti, Nikolaos Sahinidis, Ruey-Lin Sheu, Zelda Zabinsky
2023
(for 2022 publications)
Winners
Augmented Lagrangian method for second-order cone programs under second-order sufficiency
Nguyen T. V. Hang, Boris S. Mordukhovich & M. Ebrahim Sarabi
Review and comparison of algorithms and software for mixed-integer derivative-free optimization
Nikolaos Ploskas & Nikolaos V. Sahinidis
Honorable Mention
An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
E. Alper Yıldırım
Fractional 0–1 programming and submodularity
Shaoning Han, Andrés Gómez & Oleg A. Prokopyev
Award Committee
Tibor Csendes, Anna Nagurney, Man-Cho Anthony So
2022
(for 2021 publications)
Winners
Data-driven distributionally robust chance-constrained optimization with Wasserstein metric
Ran Ji & Miguel A. Lejeune
Honorable Mention
Convex hull representations for bounded products of variables
Kurt M. Anstreicher, Samuel Burer & Kyungchan Park
Sequential model based optimization of partially defined functions under unknown constraints
Antonio Candelieri
A general branch-and-bound framework for continuous global multiobjective optimization
Gabriele Eichfelder, Peter Kirst, Laura Meng & Oliver Stein
Award Committee
Immanuel Bomze, Yu-Hong Dai, Matthias Ehrgott, Hoai An Le Thi
2021
(for 2020 publications)
Winners
Solving k-center problems involving sets based on optimization techniques
Thai An, Nguyen Mau Nam & Xiaolong Qin
Penalized semidefinite programming for quadratically-constrained quadratic optimization
Ramtin Madani, Mohsen Kheirandishfard, Javad Lavaei & Alper Atamtürk
Honorable Mention
An algorithmic approach to multiobjective optimization with decision uncertainty
Gabriele Eichfelder, Julia Niebling & Stefan Rocktäschel
Award Committee
Matthias Ehrgott, Vaithilingam Jeyakumar, Pavlo Krokhmal
2020
(for 2019 publications)
Winners
Global optimization issues in deep network regression
Laura Palagi
On the complexity of quasiconvex integer minimization problem
A. Yu. Chirkov, D. V. Gribanov, D. S. Malyshev, P. M. Pardalos, S. I. Veselov & N. Yu. Zolotykh
Proximal bundle methods for nonsmooth DC programming
Welington de Oliveira
Award Committee
Ding-Zhu Du, Eligius Hendrix, Marco Locatelli, Boris Mordukhovich
2019
(for 2018 publications)
Winners
Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations
Immanuel M. Bomze, Vaithilingam Jeyakumar, Guoyin Li
Xiaolong Kuang, Luis F. Zuluaga
Award Committee
Leo Liberti, Ivana Ljubic, Ruth Misener, Jean-Philippe Richard
2018
(for 2017 publications)
Winners
Fani Boukouvala, M. M. Faruque Hasan, Christodoulos A. Floudas
Cheng Lu, Zhibin Deng, Qingwei Jin
A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints
Amir Beck, Dror Pan
Award Committee
Ding-Zhu Du, Panos M. Pardalos, Oleg Prokopyev, Jean-Philippe Richard, Henry Wolkowicz
2017
(for 2016 publications)
Winners
Heinz H. Bauschke, Minh N. Dao, Dominikus Noll, Hung M. Phan
Non polyhedral convex envelopes for 1-convex functions
Marco Locatelli
Award Committee
Alexander Mitsos, Panos M. Pardalos, Steffen Rebennack, Henry Wolkowicz
2016
(for 2015 publications)
Winners
Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization
Andrei Patrascu, Ion Necoara
Award Committee
Immanuel Bomze, Matthias Ehrgott, Oleg Prokopyev, Nikolaos Sahinidis, Fabio Schoen
2015
(for 2014 publications)
Winners
Rounding on the standard simplex: regular grids for global optimization
Immanuel M. Bomze, Stefan Gollowitzer, E. Alper Yıldırım
Globally-biased DISIMPL algorithm for expensive global optimization
Remigijus Paulavičius, Yaroslav D. Sergeyev, Dmitri E. Kvasov, Julius Žilinskas
Multivariate McCormick relaxations
A. Tsoukalas, A. Mitsos
Award Committee
Mirjam Duer, Panos M. Pardalos, Simge Kucukyavuz, Anatoly Zhigljavsky
2014
(for 2013 publications)
Winners
GloMIQO: Global mixed-integer quadratic optimizer
Ruth Misener, Christodoulos A. Floudas
Award Committee
Immanuel Bomze, Mirjam Duer, Panos M. Pardalos, Oleg Prokopyev, Mauricio G. C. Resende
2013
(for 2012 publications)
Winners
Reduced RLT representations for nonconvex polynomial programming problems
Hanif D. Sherali, Evrim Dalkiran, Leo Liberti
An exact solution method for unconstrained quadratic 0–1 programming: a geometric approach
D. Li, X. L. Sun, C. L. Liu
Award Committee
Kaisa Miettinen, Panos M. Pardalos, and Berc Rustem
2012
(for 2011 publications)
Winners
Generalized McCormick relaxations
Joseph K. Scott, Matthew D. Stuber, Paul I. Barton
Award Committee
Ding-Zhu Du, Christodoulos Floudas, Panos M. Pardalos, Hanif Sherali, and Antanas Zilinskas
Page updated
Google Sites
Report abuse