Pages that link to "Item:Q1378644"

The following pages link to Necessary and sufficient global optimality conditions for convex maximization revisited (Q1378644):

Displaying 20 items.

• Global optimality conditions for nonconvex minimization problems with quadratic constraints (Q265137) (← links)
• Piece adding technique for convex maximization problems (Q604949) (← links)
• A successive linear approximation algorithm for the global minimization of a concave quadratic program (Q827382) (← links)
• A review of recent advances in global optimization (Q842710) (← 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)
• Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions (Q985310) (← links)
• Optimality conditions in global optimization and their applications (Q1016343) (← links)
• A new necessary and sufficient global optimality condition for canonical DC problems (Q1945515) (← links)
• DC programming: overview. (Q1969457) (← links)
• A new concave minimization algorithm for the absolute value equation solution (Q2047210) (← links)
• DC semidefinite programming and cone constrained DC optimization. I: Theory (Q2149953) (← links)
• New global optimality conditions for nonsmooth DC optimization problems (Q2301178) (← links)
• On the maximization of (not necessarily) convex functions on convex sets (Q2433925) (← links)
• On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions (Q2677662) (← links)
• Optimality Conditions for the Minimization of Quadratic 0-1 Problems (Q2945127) (← links)
• Optimality conditions of first order for global minima of locally Lipschitz functions (Q2996802) (← links)
• CONDITIONS FOR GLOBAL OPTIMALITY OF QUADRATIC MINIMIZATION PROBLEMS WITH LMI CONSTRAINTS (Q3439884) (← links)
• Global minimization algorithms for concave quadratic programming problems (Q3534648) (← links)
• Inscribed ball and enclosing box methods for the convex maximization problem (Q5963240) (← links)