Charles Broyden Prize | Optimization Methods and Software

We use cookies to improve your website experience. To learn about our use of cookies and how you can manage your cookie settings, please see our Cookie Policy. By closing this message, you are consenting to our use of cookies.

Charles Broyden Prize

Optimization Methods and Software

About the prize

The prize was established by the Optimization Methods and Software Editorial Board and Taylor & Francis in 2009. It is awarded annually to the best paper published in the journal from the previous year with a cash prize of £500 and promotion of the winning article, which is made freely available for the following year.

Charles George Broyden received international recognition for his seminal 1965 paper, in which he proposed two methods for solving systems of equations. They later became known as Broyden’s methods. Another of his most important achievements was the derivation of the Broyden-Fletcher-Goldfarb-Shanno (BFGS) updating formula, one of the key tools used in optimization. Moreover, he was among those who derived the symmetric rank-one updating formula, and his name is also attributed to the Broyden family of quasi-Newton methods. Charles G. Broyden died in May 2011 at the age of 78.

Optimization Methods and Software

Visit Journal Articles

Prize committee

Mihai Anitescu, Argonne National Laboratory, USA
Xiaojun Chen (Committee Chair), The Hong Kong Polytechnic University, China
Karl Kunisch, University of Graz, Austria
Tamas Terlaky, Lehigh University, Bethlehem, USA
Stefan Ulbrich, Technische Universitaet Darmstadt, Germany

Year Author(s) Article Volume Issue
2020 Patrick E. Farrell, Matteo Croci, and Thomas M. Surowiec Deflation for semismooth equations 35 6
2019 Wenbo Gao & Donald Goldfarb Quasi-Newton methods: superlinear convergence without line searches for self-concordant functions 34 1
2018 Tristan Gally, Marc E. Pfetsch & Stefan Ulbrich A framework for solving mixed-integer semidefinite programs 33 3
2017 Vincent Guigues, Anatoli Juditsky & Arkadi Nemirovski Non-asymptotic confidence bounds for the optimal value of a stochastic programn 32 5
2016 N. Keskar, J. Nocedal, F. Öztoprak and A. Wächter A second-order method for convex 1-regularized optimization with active-set prediction 31 3
2015 Nataša Krejić, Zorana Lužanin, Zoran Ovcin & Irena Stojkovska Descent direction method with line search for unconstrained optimization in noisy environment 30 6
2014 W. de Oliveira & C. Sagastizábal Level bundle methods for oracles with on-demand accuracy 29 6
2014 Y. Shen, Z. Wen & Y. Zhang Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization 29 2
2013 Andreas Griewank On stable piecewise linearization and generalized algorithmic differentiation 28 6
2012 David A. Fournier, Hans J. Skaug, Johnoel Ancheta, James Ianelli, Arni Magnusson, Mark N. Maunder, Anders Nielsen & John Sibert AD Model Builder: using automatic differentiation for statistical inference of highly parameterized complex nonlinear models 27 2
2011 Didier Henrion & Jérôme Malick Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions 26 1
2010 Felipe Alvarez, Julio López & C. Héctor Ramírez Interior proximal algorithm with variable metric for second-order cone programming: applications to structural optimization and support vector machines 25 6
2009 Giovanni Fasano, José Luis Morales & Jorge Nocedal On the geometry phase in model-based algorithms for derivative-free optimization 24 1
2008 Yu. Nesterov Rounding of convex sets and efficient gradient methods for linear programming problems 23 1
2008 Anna von Heusinger & Christian Kanzow SC 1 optimization reformulations of the generalized Nash equilibrium problem 23 6

Latest Tweets