As the part of our distinguished seminar series, Prof. Farid Alizadeh will give a talk titled “A branch and bound approach to the k-minimum-ball problem”.
Farid Alizadeh received his PhD from the University of Minnesota. After spending two years as a postdoctoral associate at the university of California-Berkeley, he joined Rutgers, first at Rutgers Center for Operations Research and then at Rutgers Business School. Alizadeh is credited for laying the foundation of semidefinite programming (SDP), in particular, extending interior point algorithms from linear programming to SDP, and applying them to solve some combinatorial optimization problems. Later he, along with many others, extended these techniques to symmetric cones, in particular, second order cones. Presently, his research is focused on developing simplex-like algorithms for some concrete SDP and SOCP problems. He is on sabbatical leave from Rutgers and is teaching at Columbia University.
Prof. Alizadeh is awarded with INFORMS Optimization Society Farkas Prize in 2014 INFORMS Annual Meeting for his work over past 25 years. You can find the announcement of the seminar below.