Optimization Letters Best Paper Awards

Articles (14 in this collection)

1. Convergence of Lasserre’s hierarchy: the general case

   Authors

   • Matteo Tacchi

   • Content type: Original Paper
   • Published: 19 June 2021

   • Pages: 1015 - 1033

   

2. On the Burer–Monteiro method for general semidefinite programs

   Authors

   • Diego Cifuentes

   • Content type: Original Paper
   • Published: 28 January 2021

   • Pages: 2299 - 2309

   

3. Closing the gap in linear bilevel optimization: a new valid primal-dual inequality

   Authors (first, second and last of 4)

   • Thomas Kleinert
   • Martine Labbé
   • Martin Schmidt

   • Content type: Short Communication
   • Open Access
   • Published: 11 November 2020

   • Pages: 1027 - 1040

   

4. Minimizing a sum of clipped convex functions

   Authors

   • Shane Barratt
   • Guillermo Angeris
   • Stephen Boyd

   • Content type: Original Paper
   • Published: 24 March 2020

   • Pages: 2443 - 2459

   

5. Quadrature-based polynomial optimization

   Authors (first, second and last of 4)

   • Angeles Martinez
   • Federico Piazzon
   • Marco Vianello

   • Content type: Original Paper
   • Published: 07 March 2019

   • Pages: 1027 - 1036

   

6. Higher-moment buffered probability

   Authors

   • D. P. Kouri

   • Content type: Original Paper
   • Published: 22 February 2019

   • Pages: 1223 - 1237

   

7. Concise complexity analyses for trust region methods

   Authors

   • Frank E. Curtis
   • Zachary Lubberts
   • Daniel P. Robinson

   • Content type: Original Paper
   • Published: 21 June 2018

   • Pages: 1713 - 1724

   

8. On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions

   Authors

   • Etienne de Klerk
   • François Glineur
   • Adrien B. Taylor

   • Content type: Original Paper
   • Open Access
   • Published: 14 October 2016

   • Pages: 1185 - 1199

   

9. ARGONAUT: AlgoRithms for Global Optimization of coNstrAined grey-box compUTational problems

   Authors

   • Fani Boukouvala
   • Christodoulos A. Floudas

   • Content type: Original Paper
   • Published: 12 April 2016

   • Pages: 895 - 913

   

10. A characterization of the weighted Lovász number based on convex quadratic programming

    Authors

    • Carlos J. Luz

    • Content type: Original Paper
    • Published: 19 June 2015

    • Pages: 19 - 31

    

11. Strong duality in Lasserre’s hierarchy for polynomial optimization

    Authors

    • Cédric Josz
    • Didier Henrion

    • Content type: Original Paper
    • Published: 28 February 2015

    • Pages: 3 - 10

12. Robust SOS-convex polynomial optimization problems: exact SDP relaxations

    Authors

    • V. Jeyakumar
    • G. Li
    • J. Vicente-Pérez

    • Content type: Original Paper
    • Published: 26 February 2014

    • Pages: 1 - 18

13. Hyperbolicity cones of elementary symmetric polynomials are spectrahedral

    Authors

    • Petter Brändén

    • Content type: Original Paper
    • Published: 28 September 2013

    • Pages: 1773 - 1782

    

14. Scaling relationship between the copositive cone and Parrilo’s first level approximation

    Authors (first, second and last of 4)

    • Peter J. C. Dickinson
    • Mirjam Dür
    • Roland Hildebrand

    • Content type: Original Paper
    • Published: 21 July 2012

    • Pages: 1669 - 1679