Global optimality conditions and optimization methods for polynomial programming problems
From MaRDI portal
Publication:496629
DOI10.1007/s10898-015-0292-5zbMath1332.90282OpenAlexW2061851339MaRDI QIDQ496629
Zhi-You 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
linear transformationglobal optimization methodlocal optimization methodnecessary global optimality conditionpolynomial programming problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
- An iterated eigenvalue algorithm for approximating roots of univariate polynomials
- Minimum ellipsoid bounds for solutions of polynomial systems via sum of squares
- Moments and sums of squares for polynomial optimization and related problems
- A novel filled function method and quasi-filled function method for global optimization
- Polynomials. Translated from the second Russian edition 2001 by Dimitry Leites.
- Unconstrained and constrained global optimization of polynomial functions in one variable
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A collection of test problems for constrained global optimization algorithms
- Global optimization using interval analysis: The one-dimensional case
- How to count efficiently all affine roots of a polynomial system
- Handbook of test problems in local and global optimization
- Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems
- Global optimization of nonconvex polynomial programming problems having rational exponents
- First- and second-order methods for semidefinite programming
- Multivariate polynomial minimization and its application in signal processing
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
- Optimality conditions and optimization methods for quartic polynomial optimization
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations
- Minimizing polynomials via sum of squares over the gradient ideal
- Experimental testing of advanced scatter search designs for global optimization of multimodal functions
- Global Optimization with Polynomials and the Problem of Moments
- Regularization Methods for SDP Relaxations in Large-Scale Polynomial Optimization
- GloptiPoly 3: moments, optimization and semidefinite programming
- Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems
- Polynomial Optimization of Stochastic Feedback Control for Stable Plants
- A GENERAL FRAMEWORK FOR CONVEX RELAXATION OF POLYNOMIAL OPTIMIZATION PROBLEMS OVER CONES
- GloptiPoly
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Nonlinear Programming
This page was built for publication: Global optimality conditions and optimization methods for polynomial programming problems
