Global optimality conditions and optimization methods for polynomial programming problems
From MaRDI portal
Publication:496629
DOI10.1007/S10898-015-0292-5zbMATH Open1332.90282OpenAlexW2061851339MaRDI QIDQ496629FDOQ496629
Zhiyou Wu, Jing Tian, Julien Ugon
Publication date: 22 September 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-015-0292-5
Recommendations
- Global optimality conditions and optimization methods for constrained polynomial programming problems
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
- A global optimization algorithm for polynomial programming
- Optimization methods for a class of integer polynomial programming problems
- Necessary global optimality conditions for nonlinear programming problems
linear transformationglobal optimization methodlocal optimization methodnecessary global optimality conditionpolynomial programming problem
Cites Work
- Title not available (Why is that?)
- Global optimization with polynomials and the problem of moments
- GloptiPoly
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A collection of test problems for constrained global optimization algorithms
- Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems
- Minimizing polynomials via sum of squares over the gradient ideal
- GloptiPoly 3: moments, optimization and semidefinite programming
- Title not available (Why is that?)
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Nonlinear Programming
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
- Polynomials. Translated from the second Russian edition 2001 by Dimitry Leites.
- Multivariate polynomial minimization and its application in signal processing
- Handbook of test problems in local and global optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Moments and sums of squares for polynomial optimization and related problems
- Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems
- Global optimization using interval analysis: The one-dimensional case
- Global optimization of nonconvex polynomial programming problems having rational exponents
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations
- A GENERAL FRAMEWORK FOR CONVEX RELAXATION OF POLYNOMIAL OPTIMIZATION PROBLEMS OVER CONES
- How to count efficiently all affine roots of a polynomial system
- Title not available (Why is that?)
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
- Experimental testing of advanced scatter search designs for global optimization of multimodal functions
- Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables
- A new local and global optimization method for mixed integer quadratic programming problems
- Regularization methods for SDP relaxations in large-scale polynomial optimization
- A novel filled function method and quasi-filled function method for global optimization
- Unconstrained and constrained global optimization of polynomial functions in one variable
- First- and second-order methods for semidefinite programming
- Optimality conditions and optimization methods for quartic polynomial optimization
- Polynomial Optimization of Stochastic Feedback Control for Stable Plants
- Title not available (Why is that?)
- An iterated eigenvalue algorithm for approximating roots of univariate polynomials
- Minimum ellipsoid bounds for solutions of polynomial systems via sum of squares
Cited In (15)
- Title not available (Why is that?)
- Some applications of a polynomial inequality to global optimization
- Global optimization of nonconvex polynomial programming problems having rational exponents
- An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations
- Computing global minima to polynomial optimization problems using Gröbner bases
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality
- Global optimization of polynomials using generalized critical values and sums of squares
- The method of moments in global optimization
- Polynomial optimization problems
- An approach to obtaining global extremums in polynomial mathematical programming problems
- Complete solutions and extremality criteria to polynomial optimization problems
- 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
Uses Software
This page was built for publication: Global optimality conditions and optimization methods for polynomial programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q496629)
