Optimization Letters - Best Paper Award

The Best Paper Award for Optimization Letters is awarded annually to honor the authors of the best paper published in the journal in the previous year.

2022

• Tacchi, M. (2022). Convergence of Lasserre’s hierarchy: the general case. Optimization Letters 16(3), pp.1015–1033. (Click here to read (this opens in a new tab))

2021

• Kleinert, T., Labbé, M., Plein, F., Schmidt, M. (2020). Closing the gap in linear bilevel optimization: a new valid primal-dual inequality. Optimization Letters 15(4), pp. 1027–1040. (Click here to read (this opens in a new tab))

• Cifuentes, D. (2021). On the Burer–Monteiro method for general semidefinite programs. Optimization Letters 15(6), pp. 2299–2309. (Click here to read (this opens in a new tab))

2020

• Barratt, S., Angeris, G., Boyd, S. (2020). Minimizing a sum of clipped convex functions. Optimization Letters 14(8), pp. 2443–2459. (Click here to read (this opens in a new tab))

• Martinez, A., Piazzon, F., Sommariva, A., Vianello, M. (2019). Quadrature-based polynomial optimization. Optimization Letters 14(5), pp. 1027–1036. (Click here to read (this opens in a new tab))

2019

• Kouri, D.P. (2019). Higher-moment buffered probability. Optimization Letters 13(6), pp. 1223–1237. (Click here to read (this opens in a new tab))

2018

• Curtis, F. E., Lubberts, Z., Robinson, D. P. (2018). Concise complexity analyses for trust region methods. Optimization Letters 12(8), pp. 1713–1724. (Click here to read (this opens in a new tab))

2017

• Boukouvala, F., Floudas, C. A. (2017). ARGONAUT: AlgoRithms for Global Optimization of coNstrAined grey-box compUTational problems. Optimization Letters 11(5), pp. 895–913. (Click here to read (this opens in a new tab))
• de Klerk, E., Glineur, F., Taylor, A. B. (2017). On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions. Optimization Letters 11(7), pp. 1185–1199. (Click here to read (this opens in a new tab))

2016

• Josz, C., Henrion, D. (2016). Strong duality in Lasserre’s hierarchy for polynomial optimization, Optimization Letters 10(1), pp. 3–10. (Click here to read (this opens in a new tab))
• Luz, C. J. (2016). A characterization of the weighted Lovász number based on convex quadratic programming. Optimization Letters 10(1), pp. 19–31. (Click here to read (this opens in a new tab))

2015

• Jeyakumar, V.,  Li, G., Vicente-Pérez. J. (2015). Robust SOS-convex polynomial optimization problems: exact SDP relaxations. Optimization Letters 9(1), pp. 1–18. (Click here to read (this opens in a new tab))

2014

• Brändén, P. (2014). Hyperbolicity cones of elementary symmetric polynomials are spectrahedral. Optimization Letters 8(5), pp. 1773–1782. (Click here to read (this opens in a new tab))

2013

• Dickinson, P.J.C., Dür, M., Gijben, L., and Hildebrand, R. (2013). Scaling relationship between the copositive cone and Parrilo’s first level approximation. Optimization Letters 7(8), pp. 1669–1679. (Click here to read (this opens in a new tab))