Largest small polygons: A sequential convex optimization approach

DOI10.1007/S11590-022-01887-5MaRDI QIDQ6349264arXivFDO

Authors Christian Bingane

Publication date 16 September 2020

Published in arXiv

Full work available at URL https://doi.org/10.1007/S11590-022-01887-5

Mathematics Subject Classification ID

Quadratic programming (90C20) Nonconvex programming, global optimization (90C26) Applications of mathematical programming (90C90)

arXiv classification

math.OC

Abstract: A small polygon is a polygon of unit diameter. The maximal area of a small polygon with $n=2m$ vertices is not known when $mge7$. Finding the largest small $n$-gon for a given number $nge3$ can be formulated as a nonconvex quadratically constrained quadratic optimization problem. We propose to solve this problem with a sequential convex optimization approach, which is an ascent algorithm guaranteeing convergence to a locally optimal solution. Numerical experiments on polygons with up to $n=128$ sides suggest that the optimal solutions obtained are near-global. Indeed, for even $6lenle12$, the algorithm proposed in this work converges to known global optimal solutions found in the literature.

This page was built for publication: Largest small polygons: A sequential convex optimization approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6349264)