A global optimization algorithm for polynomial programming
From MaRDI portal
Publication:5197301
DOI10.15960/J.CNKI.ISSN.1007-6093.2018.04.007zbMATH Open1438.90275MaRDI QIDQ5197301FDOQ5197301
Authors: Mingyu Tian, Yongjian Yang 
Publication date: 20 September 2019
Recommendations
- Global optimality conditions and optimization methods for polynomial programming problems
- GloptiPoly
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- Global optimization with polynomials and the problem of moments
- Global optimality conditions and optimization methods for constrained polynomial programming problems
Cited In (18)
- Some polynomial programming problems solving with a clustering algorithm
- Some applications of a polynomial inequality to global optimization
- An adaptive procedure for the global minimization of a class of polynomial functions
- Exploiting equalities in polynomial programming
- An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A difference algorithm to find global minimizers of a polynomial
- An algorithm for the global optimization of a class of continuous minimax problems
- Solving global optimization problems over polynomials with GloptiPoly 2.1
- A global optimization algorithm for a type of homogeneous polynomial optimization
- Computing global minima to polynomial optimization problems using Gröbner bases
- Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach
- Global optimization of polynomials using generalized critical values and sums of squares
- Computational advances in polynomial optimization: RAPOSa, a freely available global solver
- Unconstrained and constrained global optimization of polynomial functions in one variable
- Robust global optimization with polynomials
- Global optimality conditions and optimization methods for polynomial programming problems
- An algorithm for semi-infinite polynomial optimization
This page was built for publication: A global optimization algorithm for polynomial programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5197301)
