Largest small polygons: a sequential convex optimization approach

DOI10.1007/s11590-022-01887-5OpenAlexW3084469051MaRDI QIDQ2688919

Christian Bingane

Publication date: 6 March 2023

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2009.07893

zbMATH Keywords

polygonsconcave-convex procedureisodiametric problemquadratically constrained quadratic optimizationmaximal areaplanargeometrysequential convex optimization

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Related Items (2)

Small polygons with large area ⋮ Tight bounds on the maximal perimeter and the maximal width of convex small polygons

Uses Software

• GloptiPoly
• CVX
• GitHub

Cites Work

• Unnamed Item
• The largest small hexagon
• The largest small octagon
• Using symbolic calculations to determine largest small polygons
• Finding largest small polygons with gloptipoly
• Diameter graphs of polygons and the proof of a conjecture of Graham
• Isodiametric problems for polygons
• Technical Note—A General Inner Approximation Algorithm for Nonconvex Mathematical Programs
• Maximal Area of Equilateral Small Polygons

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