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.
The Charles Broyden Prize for the 2018 volume is awarded to:
A framework for solving mixed-integer semidefinite programs
Tristan Gally, Marc E. Pfetsch & Stefan Ulbrich
The prize committee noticed the following:
"Mixed-integer SDPs (MISDPs) arise in many areas of science and engineering. For instance, in wireless communications, many joint selection and resource allocation problems can be tackled via MISDP formulations. Currently, existing MISDP solvers either focus on specific applications (such as max-cut) or rely heavily on reduction to mixed-integer linear or mixed-integer second-order-cone programs. This well written paper takes an important step towards the development of a general-purpose solver for MISDPs. Specifically, it considers a branch-and-bound framework and addresses a number of critical theoretical and practical challenges that arise when solving the sequence of SDPs generated by the branch-and-bound process. Then, it demonstrates the viability of the proposed framework via extensive numerical experiments. It provides an important foundation for further research on general-purpose MISDP solvers."
