Georgina Hall

Georgina Hall is an Assistant Professor of Decision Sciences at INSEAD. Her research is in optimization, with a focus on convex relaxations of NP-hard problems, particularly those arising in polynomial optimization. Prior to joining INSEAD, Georgina was a Gordon Wu fellow at Princeton University, Department of Operations Research and Financial Engineering. She received her PhD from there in May 2018, under the supervision of Professor Amir Ali Ahmadi. She was also the valedictorian of Ecole Centrale, Paris, where she obtained a B.S. and an M.S., in 2011 and 2013 respectively.

Georgina is the recipient of the Médaille de l’Ecole Centrale from the French Académie des Sciences and the Princeton School of Engineering and Applied Sciences Award for Excellence. Her paper “DC decomposition of nonconvex polynomials using algebraic techniques” is the recent recipient of the 2016 Informs Computing Society Prize for Best Student Paper. She has also been the recipient of a number of teaching awards, including the Princeton University's Engineering Council Teaching Award, the university-wide Excellence in Teaching Award of the Princeton Graduate School, and the 2017 Excellence in Teaching of Operations Research Award of the Institute for Industrial and Systems Engineers.

My thesis

G. Hall Optimization over Nonnegative and Convex Polynomials With and Without Semidefinite Programming
Princeton University, May 2018. Supervised by Prof. Amir Ali Ahmadi.

Submitted

A.A. Ahmadi, C. Dibek, G. Hall, Sums of Separable and Quadratic Polynomials
2021, Submitted.

P. Blaettchen, A. P. Calmon, G. Hall, Traceability Technology Adoption in Supply Chain Networks
2021, Submitted.

M. Curmei and G. Hall, Shape-Constrained Regression using Sum of Squares Polynomials
2021, Submitted.

G. Hall and L. Massoulie, Partial Recovery in the Graph Alignment Problem
2021, Minor Revisions, Operations Research.

Published

2020

• G. Hall, “Applications of Sum of Squares Polynomials ,” in Sum of Squares: Theory and Applications, Proceedings of Symposia in Applied Mathematics, Volume 77, 2020.

• A. Majumdar, G. Hall, A.A. Ahmadi, "Recent Scalability Improvements for Semidefinite Programming with Applications in Machine Learning, Control, and Robotics", Annual Review of Control, Robotics, and Autonomous Systems, 2020.

2019

• A. A. Ahmadi and G. Hall, “On the Complexity of Detecting Convexity over a Box,” Mathematical Programming, 2019.

• A. A. Ahmadi, E. de Klerk, and G. Hall, “Polynomial Norms,” SIAM Journal in Optimization, 2019.

2018

• A. A. Ahmadi and G. Hall, “On the construction of converging hierarchies for polynomial optimization based on certificates of global positivity,” Mathematics of Operations Research, 2018. Winner of the 2018 INFORMS Optimization Society Young Researchers' Prize.
  

2017

• A. A. Ahmadi, G. Hall, A. Papachristodoulou, J. Saunderson, and Y. Zheng, “Improving efficiency and scalability of sum of squares optimization:recent advances and limitations,” Proceedings of the Conference on Decision and Control, 2017.

• A. A. Ahmadi, G. Hall, A. Makadia, and V. Sindhwani, “Geometry of 3D Environments and Sum of Squares Polynomials,” in RSS 2017, 2017.

• A. A. Ahmadi and G. Hall, “DC Decomposition of Nonconvex Polynomials with Algebraic Techniques,” Mathematical Programming - Series B, 2017. Winner of the 2016 INFORMS Computing Society Best Student Paper Award.

• A. A. Ahmadi and G. Hall, “Sum of Squares Basis Pursuit with Linear and Second Order Cone Programming,” in Algebraic and Geometric Methods in Discrete Mathematics, Contemporary Mathematics, 2017.

2016

• A. A. Ahmadi, S. Dash, and G. Hall, “Optimization over Structured Subsets of Positive Semidefinite Matrices via Column Generation,” Discrete Optimization, 2016. Download Here

• E. Abbe, A. S. Bandeira, and G. Hall, “Exact Recovery in the Stochastic Block Model,” IEEE: Transactions on Information Theory, vol. 62, no. 1, 2016.

Honors and Awards

• Recipient of the 2020 Information Theory Society Paper Award for our paper "Exact recovery in the stochastic block model"

• Recipient of the 2018 INFORMS Optimization Society Young Researchers' Prize for our paper "On the construction of converging hierarchies for polynomial optimization based on certificates of global positivity ".

• Recipient of the 2017 School of Engineering and Applied Science Award for excellence.

• Selected to attend the Young Researchers Workshop organized by Cornell University in October 2017

• Selected to attend the EE/CS Rising Stars Workshop at Stanford University in November 2017

• Recipient of the 2016 INFORMS Computing Society Best Student Paper Award for our paper "DC Decompositions of Nonconvex Polynomials using Algebraic Techniques".

• Gordon Wu Fellow (September 2012-May 2016)