## Curvature of the Central Path in Linear Programming

- Start Date: 05/26/2015
- End Date: 05/29/2015

Current participants (confirmed):

Allamigeon, Xavier, INRIA Saclay / Ecole Polytechnique - Control and Optimization

Benchimol, Pascal, EDF R&D - Control and Optimization

Deza, Antoine, McMaster University - Computing and Software

Gaubert, Stephane, Saclay / Ecole Polytechnique - Control and Optimization

Lee, Yin Tat, MIT - Mathematics

Skomra, Mateusz, INRIA Saclay / Ecole Polytechnique - Control and Optimization

Sidford, Aaron, MIT - Mathematics

Terlaky, Tamas, Lehigh University - Industrial and Systems Engineering

Zinchenko, Yuriy, University of Calgary - Mathematics

University of Calgary

**Overview:** The field of optimization is ubiquitous to countless applications in engineering and sciences. Within the past 3 decades, the field of convex optimization was revolutionized with the introduction of the so-called Interior Point Methods (IPM). These methods allow solving many large-scale optimization problems very efficiently and already found ways into a number of leading commercial numerical software packages like CPLEX, Gurobi, Mosek, etc. Despite reach and beautiful theory of these methods, some essential gaps in our understanding of convex optimization still exist. For example, a question of whether a linear optimization problem can be solved in strongly polynomial time is cited by the Fields medalist Stephen Smale as one of the top mathematical problems for the XXI century.

Central path – a real analytic curve underlying the complexity analysis of majority of IPM – has first drawn the attention of researchers since the very inception of IPM some 20+ years ago. It is believed that the complexity and thus the numerical efficiency of IPM are intimately connected to the geometric properties of the path. Despite that, the geometric-algebraic properties of the path are still poorly understood, even for linear optimization. Specifically, we still do not have a full understanding of the worst-case total curvature of the central path, which in turn holds one the greater promises for further algorithmic improvements. Some connections to IPM algorithm complexity were established over the course of 3 decades of IPM theory development. However, insofar all of the previous attempts – Sonnevend’s curvature surrogate, Vavasis-Ye crossover events, Tsuchiya-Monteiro analysis of the two – fall short of connecting with the true geometric curvature, in large part due to the fact that the curvature itself remained elusive. Interestingly, despite a well-grounded interest in understanding the true curvature of the path, no major advancements were made until 2000, when a novel set of methods largely borrowing on algebraic geometry – tools mostly uncommon in large optimization community – was used for the first time.

In early 2000 Dedieu, Malajovich and Shub established first pivotal result towards understanding the total curvature of the path, essentially bounding the average curvature with the number of embedding dimensions. In 2008 in the work of Deza, Terlaky and Zinchenko, a few pivotal observations were made regarding the worst-case curvature and a relationship to the combinatorial structure of the underlying polytope was hypothesized. Using more algebraic techniques, some refinements of these results soon followed in work of De Loera, Sturmfels and Vinzant in 2010. In 2014, using the techniques of tropical geometry, in a unexpected break-through work of Allamigeon, Benchimol, Gaubert and Joswig it was shown that in fact the total curvature of the path may grow exponential in the dimension. The latter result not only disproves a number of pre-existing conjectures, but possibly even sheds light on possibility of the existence of strongly-polynomial IPM-based method for linear programming.

**Objectives:** Our goal is to give tight bounds on the worst-case curvature of the central path, at least in low dimensions and / or a family of special polytopes. To this extant, the objectives are: (1) improve worst-case lower bound construction to account for the number of inequalities in generic dimension, (2) identify a set of most promising techniques used for such constructions, and attempt to reconcile tropical and convex geometry perspectives on the problem, (3) bound the total curvature of the path in dimension 2 with 3-5 inequalities, (4) investigate if any of the methods extend to larger hyperplane arrangements, and (5) identify a special family of polytopes (like transportation polytopes) where further tight curvature estimates can be made.

We believe that the timing and tools are finally right to make progress towards extending our understanding of this challenging and important problem. By bringing together a diverse group of mathematicians working in the area and having the necessary broad and otherwise uncommon expertise, including convex geometry, algebraic and tropical geometry, convex optimization and IPM theory, we hope that indeed the progress in understanding the worst-case path curvature will be made, at least in low dimensions. We view BIRS FRG as the unique and the right opportunity for our group to achieve our goals.

Optimization is an interdisciplinary area of mathematics and computer science that, simply speaking, amounts to choosing the best element from some set of available alternatives and studying its properties. Optimization has become ubiquitous to numerous theoretical and applied research directions of modern mathematics. Modern optimization has its origins in linear programming, developed in the 1930s and 1940s by Leonid Kantorovich, John von Neumann and George Dantzig, which deals with the problem of minimizing a linear functional over a convex polyhedron in finite-dimensional vector spaces. The current dramatic growth of the discipline of optimization is largely motivated by the successful solution of large-scale problems as well as the subsequent generation of even larger problems. The discovery and application of modern interior-point methods in the 1980s forever changed the landscape of convex and numerical optimization, pushing both our theoretical understanding and our computational capabilities well beyond the purely linear case. Despite its near-century presence in mathematical landscape, one of the pivotal questions in modern optimization still pertains whether we can efficiently solve problems in linear programming. The workshop targets deepening our knowledge of this problem, by timely bringing together a diverse yet focused group of international French-German-North American experts, to work together on their common research problem.

Antoine Deza, CRC, McMaster University; Yuriy Zinchenko, University of Calgary