Solving global optimization problems over polynomials with GloptiPoly 2.1
From MaRDI portal
Publication:5897040
DOI10.1007/B94062zbMATH Open1255.90095OpenAlexW2624301280MaRDI QIDQ5897040FDOQ5897040
Jean B. Lasserre, Didier Henrion
Publication date: 2 February 2010
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b94062
Recommendations
Nonconvex programming, global optimization (90C26) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Cited In (11)
- GloptiPoly
- Computing global minima to polynomial optimization problems using Gröbner bases
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- EAGO.jl: easy advanced global optimization in Julia
- Stability of polytopes of matrices via affine parameter-dependent Lyapunov functions: asymptotically exact LMI conditions
- Global optimization with polynomials and the problem of moments
- Global Optimization Toolbox for Maple: an introduction with illustrative applications
- Moments and sums of squares for polynomial optimization and related problems
- Computational advances in polynomial optimization: RAPOSa, a freely available global solver
- Title not available (Why is that?)
- Robust global optimization with polynomials
Uses Software
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)