Collaborative Research: AF: Small: On the Complexity of Semidefinite and Polynomial Optimization through the Lens of Real Algebraic Geometry

Purdue University, West Lafayette IN

Investigators

Abstract

Semidefinite and polynomial optimization (SDO and PO) are topics of great theoretical and practical interest, with numerous applications in theoretical computer science, control theory, quantum information sciences, and statistics. The steady advances in efficient interior-point methods (IPMs) lends credence to the impactful role of SDO, as an emerging computational tool, in PO and quantum computing. The complexity of SDO and PO is well-known in the bit model of computation: there is no polynomial-time algorithm yet to find an exact optimal solution of these classes of optimization problems. However, even for an approximate solution, there are pathological instances that IPMs or relaxation hierarchies for PO fail to solve. In view of this challenge, the need to investigate the complexity through a broader spectrum of complexity measures is obvious. Such a novel approach allows for a finer classification of instances with high complexity. This project pursues the above goal by addressing several key questions on the complexity of SDO and PO, through the lens of real algebraic geometry. The results of this project will enhance understanding of the complexity in SDO and PO and have the potential to impact other disciplines, including quantum information sciences, where the emerging area of quantum IPMs with their unique advantages offer unprecedented intellectual challenges. Due to the multidisciplinary nature of this project, the investigators will train graduate students and organize meetings by inviting experts as well as young researchers for fruitful interaction amongst the optimization and real algebraic geometry communities. The first part of the project focuses on quantitative and algorithmic questions about the complexity of SDO from the perspective of the central path. Since IPMs operate in a neighborhood of the central path, their efficiency is influenced by the analytic and algebro-geometric properties of the central path. The investigators explore several complexity measures based on the degree, worst-case convergence rate, and geometric curvature of the central path for regular and near to ill-posed instances. By means of these complexity measures, in particular, one can quantitatively justify the complexity of IPMs on instances whose special structures exhibit failure of the strict complementarity condition. The second part of the project investigates the complexity of PO through error bounds and the topology of the feasible set. Unlike IPMs, the moment/sum of squares approach only deals with a sequence of objective values (rather than solutions), which may not adequately reflect the progress toward the optimal set. As a result, the current complexity bounds from the moment/sum of squares approach are purely algebraic with no reliance on the topology/geometry of the feasible set. The investigators will explore topology based complexity measures which allow for the inclusion of the Betti numbers of the feasible set and thus enhance PO solvers with more precise complexity estimates. That will rigorously explain why iterative algorithms are more likely to stop at a local optima of a PO problem, as the number of connected components or the holes in the feasible set increases. This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.