Global optimality conditions and optimization methods for polynomial programming problems
From MaRDI portal
(Redirected from Publication:496629)
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
Cites work
- scientific article; zbMATH DE number 575960 (Why is no real title available?)
- scientific article; zbMATH DE number 1069614 (Why is no real title available?)
- scientific article; zbMATH DE number 1984325 (Why is no real title available?)
- scientific article; zbMATH DE number 953044 (Why is no real title available?)
- scientific article; zbMATH DE number 757677 (Why is no real title available?)
- scientific article; zbMATH DE number 5221564 (Why is no real title available?)
- A GENERAL FRAMEWORK FOR CONVEX RELAXATION OF POLYNOMIAL OPTIMIZATION PROBLEMS OVER CONES
- A collection of test problems for constrained global optimization algorithms
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A new local and global optimization method for mixed integer quadratic programming problems
- A novel filled function method and quasi-filled function method for global optimization
- An iterated eigenvalue algorithm for approximating roots of univariate polynomials
- Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems
- Experimental testing of advanced scatter search designs for global optimization of multimodal functions
- First- and second-order methods for semidefinite programming
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations
- Global optimization of nonconvex polynomial programming problems having rational exponents
- Global optimization using interval analysis: The one-dimensional case
- Global optimization with polynomials and the problem of moments
- GloptiPoly
- GloptiPoly 3: moments, optimization and semidefinite programming
- Handbook of test problems in local and global optimization
- How to count efficiently all affine roots of a polynomial system
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
- Minimizing polynomials via sum of squares over the gradient ideal
- Minimum ellipsoid bounds for solutions of polynomial systems via sum of squares
- Moments and sums of squares for polynomial optimization and related problems
- Multivariate polynomial minimization and its application in signal processing
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
- Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables
- Nonlinear Programming
- Optimality conditions and optimization methods for quartic polynomial optimization
- Polynomial Optimization of Stochastic Feedback Control for Stable Plants
- Polynomials. Translated from the second Russian edition 2001 by Dimitry Leites.
- Regularization methods for SDP relaxations in large-scale polynomial optimization
- Solving Polynomial Systems Using Continuation for Engineering and Scientific Problems
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Unconstrained and constrained global optimization of polynomial functions in one variable
Cited in
(26)- scientific article; zbMATH DE number 6263860 (Why is no real title available?)
- Some applications of a polynomial inequality to global optimization
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
- A global optimization algorithm for polynomial programming
- Global optimization of nonconvex polynomial programming problems having rational exponents
- Global optimality conditions and optimization methods for constrained polynomial programming problems
- An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions
- Optimization methods for a class of integer polynomial programming problems
- Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables
- Global optimality conditions for a class of polynomial integer programming problems with linear constraints
- A global optimization algorithm for a type of homogeneous polynomial optimization
- 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
- Necessary global optimality conditions and optimization methods for cubic polynomial optimization problems with linear constraints
- Computational advances in polynomial optimization: RAPOSa, a freely available global solver
- Unconstrained and constrained global optimization of polynomial functions in one variable
- Necessary global optimality conditions for nonlinear programming problems
- Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials
- Robust global optimization with polynomials
- Optimality conditions and optimization methods for quartic polynomial optimization
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)
