Pages that link to "Item:Q702386"

The following pages link to Sufficient global optimality conditions for bivalent quadratic optimization (Q702386):

Displaying 25 items.

• Global optimality conditions for nonconvex minimization problems with quadratic constraints (Q265137) (← links)
• The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
• Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition (Q415403) (← links)
• On zero duality gap in nonconvex quadratic programming problems (Q421278) (← links)
• Global optimality conditions and optimization methods for quadratic assignment problems (Q422852) (← links)
• Global optimality conditions and optimization methods for quadratic knapsack problems (Q658556) (← links)
• Global optimality conditions for cubic minimization problems with cubic constraints (Q907371) (← links)
• Global minimization of difference of quadratic and convex functions over box or binary constraints (Q928298) (← links)
• Global optimality conditions for some classes of optimization problems (Q970570) (← links)
• Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions (Q985310) (← links)
• Optimality conditions in global optimization and their applications (Q1016343) (← links)
• Optimality conditions and optimization methods for quartic polynomial optimization (Q1646197) (← links)
• Global optimality conditions for fixed charge quadratic programs (Q1670551) (← links)
• Semidefinite program duals for separable polynomial programs involving box constraints (Q1985290) (← links)
• Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems (Q2073059) (← links)
• Sufficient global optimality conditions for weakly convex minimization problems (Q2426678) (← links)
• Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints (Q2433932) (← links)
• Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations (Q2442635) (← links)
• Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints (Q2471081) (← links)
• Kuhn-Tucker sufficiency for global minimum of multi-extremal mathematical programming problems (Q2642150) (← links)
• Optimality Conditions for the Minimization of Quadratic 0-1 Problems (Q2945127) (← links)
• Sufficient global optimality conditions for multi-extremal smooth minimisation problems with bounds and linear matrix inequality constraints (Q3430018) (← links)
• Global optimality conditions for nonlinear programming problems with bounds via quadratic underestimators (Q3553760) (← links)
• Unified global optimality conditions for smooth minimization problems with mixed variables (Q3598042) (← links)
• Global optimality of quadratic minimization over symmetric polytopes (Q5426965) (← links)