Pages that link to "Item:Q623367"
From MaRDI portal
The following pages link to Necessary global optimality conditions for nonlinear programming problems with polynomial constraints (Q623367):
Displayed 15 items.
- Global optimality conditions for nonconvex minimization problems with quadratic constraints (Q265137) (← links)
- Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming (Q378284) (← links)
- Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition (Q415403) (← links)
- Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables (Q430937) (← links)
- Global optimality conditions and optimization methods for polynomial programming problems (Q496629) (← 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)
- Global error bounds for piecewise convex polynomials (Q1942267) (← links)
- Feasible partition problem in reverse convex and convex mixed-integer programming (Q2256208) (← links)
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations (Q2442635) (← links)
- On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions (Q2677662) (← links)
- The <i>Z</i> -eigenvalues of a symmetric tensor and its application to spectral hypergraph theory (Q2936746) (← links)
- Optimality Conditions for the Minimization of Quadratic 0-1 Problems (Q2945127) (← links)
- A new class of alternative theorems for SOS-convex inequalities and robust optimization (Q5175328) (← links)
