Solving global optimization problems over polynomials with GloptiPoly 2.1
From MaRDI portal
(Redirected from Publication:5897040)
Recommendations
Cited in
(18)- Exploiting algebraic structure in global optimization and the Belgian chocolate problem
- Computing global minima to polynomial optimization problems using Gröbner bases
- Finding largest small polygons with gloptipoly
- Stability of polytopes of matrices via affine parameter-dependent Lyapunov functions: asymptotically exact LMI conditions
- Robust global optimization with polynomials
- Computational advances in polynomial optimization: RAPOSa, a freely available global solver
- Global optimization with polynomials and the problem of moments
- Gposolver: a Matlab/C++ toolbox for global polynomial optimization
- GlobSol user guide
- G<scp>LOPT</scp>L<scp>AB</scp>: a configurable framework for the rigorous global solution of quadratic constraint satisfaction problems
- scientific article; zbMATH DE number 1057693 (Why is no real title available?)
- scientific article; zbMATH DE number 1795205 (Why is no real title available?)
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- EAGO.jl: easy advanced global optimization in Julia
- GloptiPoly
- Global Optimization Toolbox for Maple: an introduction with illustrative applications
- Slow convergence of the moment-SOS hierarchy for an elementary polynomial optimization problem
- Moments and sums of squares for polynomial optimization and related problems
This page was built for publication: Solving global optimization problems over polynomials with GloptiPoly 2.1
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897040)