Pages that link to "Item:Q496629"
From MaRDI portal
The following pages link to Global optimality conditions and optimization methods for polynomial programming problems (Q496629):
Displaying 23 items.
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality (Q386447) (← links)
- Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables (Q430937) (← links)
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints (Q623367) (← links)
- Some applications of a polynomial inequality to global optimization (Q948639) (← links)
- An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions (Q980524) (← links)
- Unconstrained and constrained global optimization of polynomial functions in one variable (Q1187372) (← links)
- An approximate approach of global optimization for polynomial programming problems (Q1296128) (← links)
- Global optimization of nonconvex polynomial programming problems having rational exponents (Q1387651) (← links)
- The method of moments in global optimization (Q1417352) (← links)
- Optimality conditions and optimization methods for quartic polynomial optimization (Q1646197) (← links)
- Global optimality conditions and optimization methods for constrained polynomial programming problems (Q1663418) (← links)
- Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials (Q1706680) (← links)
- Computing global minima to polynomial optimization problems using Gröbner bases (Q1904644) (← links)
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations (Q2442635) (← links)
- Robust global optimization with polynomials (Q2492692) (← links)
- Complete solutions and extremality criteria to polynomial optimization problems (Q2505557) (← links)
- Computational advances in polynomial optimization: RAPOSa, a freely available global solver (Q2689854) (← links)
- Optimization methods for a class of integer polynomial programming problems (Q2917964) (← links)
- Global optimization of polynomials using generalized critical values and sums of squares (Q2946528) (← links)
- Necessary global optimality conditions and optimization methods for cubic polynomial optimization problems with linear constraints (Q3462913) (← links)
- Necessary global optimality conditions for nonlinear programming problems (Q4687894) (← links)
- A global optimization algorithm for polynomial programming (Q5197301) (← links)
- (Q5400057) (← links)
