Pages that link to "Item:Q2471081"

The following pages link to Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints (Q2471081):

Displaying 15 items.

• Generalized subdifferentials of the sign change counting function (Q276504) (← links)
• On zero duality gap in nonconvex quadratic programming problems (Q421278) (← links)
• A note on sufficient global optimality conditions for fixed charge quadratic programs (Q845625) (← links)
• Global optimality conditions for cubic minimization problems with cubic constraints (Q907371) (← links)
• Global optimality conditions for some classes of optimization problems (Q970570) (← links)
• New Kuhn-Tucker sufficiency for global optimality via convexification (Q1021733) (← links)
• Optimality conditions and optimization methods for quartic polynomial optimization (Q1646197) (← links)
• Global optimality conditions for fixed charge quadratic programs (Q1670551) (← links)
• D.C. programming approach for solving an applied ore-processing problem (Q1716969) (← links)
• Global sufficient optimality conditions for a special cubic minimization problem (Q1955308) (← links)
• Global optimality conditions for cubic minimization problem with box or binary constraints (Q1959231) (← 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)
• 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)