Pages that link to "Item:Q2442635"
From MaRDI portal
The following pages link to Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations (Q2442635):
Displaying 4 items.
- Global optimality conditions and optimization methods for polynomial programming problems (Q496629) (← links)
- Global optimality conditions for cubic minimization problems with cubic constraints (Q907371) (← links)
- Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials (Q1706680) (← links)
- Semidefinite program duals for separable polynomial programs involving box constraints (Q1985290) (← links)
