Optimization Online


Finding largest small polygons with GloptiPoly

Didier Henrion(henrion***at***laas.fr)
Frederic Messine(messine***at***n7.fr)

Abstract: A small polygon is a convex polygon of unit diameter. We are interested in small polygons which have the largest area for a given number of vertices $n$. Many instances are already solved in the literature, namely for all odd $n$, and for $n=4, 6$ and $8$. Thus, for even $n\geq 10$, instances of this problem remain open. Finding those largest small polygons can be formulated as nonconvex quadratic programming problems which can challenge state-of-the-art global optimization algorithms. We show that a recently developed technique for global polynomial optimization, based on a semidefinite programming approach to the generalized problem of moments and implemented in the public-domain Matlab package GloptiPoly, can successfully find largest small polygons for $n=10$ and $n=12$. Therefore this significantly improves existing results in the domain. When coupled with accurate convex conic solvers, GloptiPoly can provide numerical guarantees of global optimality, as well as rigorous guarantees relying on interval arithmetic.

Keywords: Extremal convex polygons, global optimization, nonconvex quadratic programming, semidefinite programming

Category 1: Global Optimization

Category 2: Nonlinear Optimization (Quadratic Programming )

Category 3: Linear, Cone and Semidefinite Programming (Semi-definite Programming )

Citation: LAAS-CNRS Research Report, March 2011

Download: [PDF]

Entry Submitted: 03/22/2011
Entry Accepted: 03/22/2011
Entry Last Modified: 03/22/2011

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society