Mathematics – Optimization and Control
Scientific paper
2011-03-23
Mathematics
Optimization and Control
Scientific paper
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.
Henrion Didier
Messine Frederic
No associations
LandOfFree
Finding largest small polygons with GloptiPoly does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Finding largest small polygons with GloptiPoly, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finding largest small polygons with GloptiPoly will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-440790