Global optimality conditions and optimization methods for constrained polynomial programming problems
From MaRDI portal
(Redirected from Publication:1663418)
Recommendations
- Global optimality conditions and optimization methods for polynomial programming problems
- Global optimization with polynomials and the problem of moments
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
- Optimization methods for a class of integer polynomial programming problems
- Global optimality conditions for a class of polynomial integer programming problems with linear constraints
Cites work
- A collection of test problems for constrained global optimization algorithms
- A novel filled function method and quasi-filled function method for global optimization
- A semidefinite relaxation scheme for multivariate quartic polynomial optimization with quadratic constraints
- An iterated eigenvalue algorithm for approximating roots of univariate polynomials
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Experimental testing of advanced scatter search designs for global optimization of multimodal functions
- Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
- Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
- Global optimization with polynomials and the problem of moments
- GloptiPoly
- GloptiPoly 3: moments, optimization and semidefinite programming
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- Nonlinear Programming
- Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
- Regularization methods for SDP relaxations in large-scale polynomial optimization
- Semidefinite relaxation approximation for multivariate bi-quadratic optimization with quadratic constraints.
- Transposition Theorems and Qualification‐Free Optimality Conditions
- Unconstrained and constrained global optimization of polynomial functions in one variable
Cited in
(13)- Optimization methods for a class of integer polynomial programming problems
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality
- Necessary global optimality conditions and optimization methods for cubic polynomial optimization problems with linear constraints
- Global optimization of nonconvex polynomial programming problems having rational exponents
- Some applications of a polynomial inequality to global optimization
- Global optimality conditions and optimization methods for polynomial programming problems
- An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions
- Optimality conditions and optimization methods for quartic polynomial optimization
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
- Global optimality conditions for a class of polynomial integer programming problems with linear constraints
- A global optimization algorithm for polynomial programming
- Unconstrained and constrained global optimization of polynomial functions in one variable
This page was built for publication: Global optimality conditions and optimization methods for constrained polynomial programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1663418)
