In recent years, techniques based on convex optimization and real algebra that produce converging hierarchies of lower bounds for polynomial minimization problems have gained much popularity. At their heart, these hierarchies rely crucially on Positivstellensätze from the late 20th century (e.g., due to Stengle, Putinar, or Schmüdgen) that certify positivity of a polynomial on an arbitrary closed basic semialgebraic set. In this paper, we show that such hierarchies could in fact be designed from much more limited Positivstellensätze dating back to the early 20th century that only certify positivity of a polynomial globally. More precisely, we show that any inner approximation to the cone of positive homogeneous polynomials that is arbitrarily tight can be turned into a converging hierarchy of lower bounds for general polynomial minimization problems with compact feasible sets. This in particular leads to a semidefinite programming-based hierarchy that relies solely on Artin's solution to Hilbert's 17th problem. We also use a classical result of Polyá on global positivity of even forms to construct an "optimization-free" converging hierarchy for general polynomial minimization problems. This hierarchy only requires polynomial multiplication and checking nonnegativity of coefficients of certain fixed polynomials. As a corollary, we obtain new linear programming and second-order cone programming-based hierarchies for polynomial minimization problems that rely on the recently introduced concepts of dsos and sdsos polynomials. We remark that the scope of this paper is theoretical at this stage as our hierarchies-though they involve at most two sum of squares constraints or only basic arithmetic at each level-require the use of bisection and increase the number of variables (resp. degree) of the problem by the number of inequality constraints plus three (resp. by a factor of two).
Degree Bounds for Positivstellensätze of general semialgebraic sets
Econometric Institute, Erasmus University Rotterdam(伊拉斯谟斯鹿特丹大学计量经济研究所);Tilburg School of Economics and Management, Tilburg University(蒂尔堡大学经济与管理学院);Department of Industrial and Systems Engineering, Lehigh University(利哈伊大学工业与系统工程系)
Quantitative semidefinite certificates for ground-state energies of Pauli Hamiltonians
University of Ljubljana, Faculty of Mathematics and Physics(卢布尔雅那大学数学与物理学院);University of Primorska, Faculty of Mathematics, Natural Sciences and Information Technologies(沿海大学数学、自然科学和信息技术学院);Université de Toulouse(图卢兹大学;法国国家科学研究中心劳动力自动化研究与应用实验室);LAAS-CNRS
Differential Privacy via Distributionally Robust Optimization
Imperial College Business School, Imperial College London(伦敦帝国理工学院商学院,伦敦帝国理工学院);Antai College of Economics and Management, Shanghai Jiao Tong University(上海交通大学安泰经济与管理学院)