Finding largest small polygons with gloptipoly
From MaRDI portal
Publication:2392118
DOI10.1007/s10898-011-9818-7zbMath1272.90059arXiv1103.4456OpenAlexW2090617011MaRDI 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
Related Items (8)
Searching approximate global optimal Heilbronn configurations of nine points in the unit square via GPGPU computing ⋮ Maximal Area of Equilateral Small Polygons ⋮ An efficient DC programming approach for portfolio decision with higher moments ⋮ Small polygons with large area ⋮ Tight bounds on the maximal area of small polygons: improved Mossinghoff polygons ⋮ Largest small polygons: a sequential convex optimization approach ⋮ A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems ⋮ Using symbolic calculations to determine largest small polygons
Uses Software
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
This page was built for publication: Finding largest small polygons with gloptipoly
