Finding largest small polygons with gloptipoly

DOI10.1007/s10898-011-9818-7zbMath1272.90059arXiv1103.4456MaRDI QIDQ2392118

Frédéric Messine, Didier Henrion

Publication date: 1 August 2013

Published in: Journal of Global Optimization (Search for Journal in Brave)

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

zbMATH Keywords

global optimization; semidefinite programming; nonconvex quadratic programming; extremal convex polygons

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

90C20: Quadratic programming

Related Items

Maximal Area of Equilateral Small Polygons, A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems, Small polygons with large area, Tight bounds on the maximal area of small polygons: improved Mossinghoff polygons, An efficient DC programming approach for portfolio decision with higher moments, Using symbolic calculations to determine largest small polygons, Searching approximate global optimal Heilbronn configurations of nine points in the unit square via GPGPU computing, Largest small polygons: a sequential convex optimization approach

Uses Software

• Matlab
• SeDuMi
• VSDP
• GloptiPoly

Cites Work

• Unnamed Item
• Unnamed Item
• Exploiting special structure in semidefinite programming: a survey of theory and applications
• The largest small hexagon
• Frontiers in global optimization
• The largest small octagon
• A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
• Diameter graphs of polygons and the proof of a conjecture of Graham
• Extremal problems for convex polygons
• Isodiametric problems for polygons
• Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions
• GloptiPoly 3: moments, optimization and semidefinite programming
• Optimisation globale et théorie des moments
• Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
• GloptiPoly