Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
SIAM Journal on Optimization
Conditions for Global Optimality 2
Journal of Global Optimization
Journal of Global Optimization
Journal of Global Optimization
Introduction to Global Optimization (Nonconvex Optimization and Its Applications)
Introduction to Global Optimization (Nonconvex Optimization and Its Applications)
Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
Mathematical Programming: Series A and B
Optimality conditions in global optimization and their applications
Mathematical Programming: Series A and B - Series B - Special Issue: Nonsmooth Optimization and Applications
Global optimality conditions for cubic minimization problem with box or binary constraints
Journal of Global Optimization
Hi-index | 0.00 |
In this paper, we present sufficient global optimality conditions for weakly convex minimization problems using abstract convex analysis theory. By introducing (L,X)-subdifferentials of weakly convex functions using a class of quadratic functions, we first obtain some sufficient conditions for global optimization problems with weakly convex objective functions and weakly convex inequality and equality constraints. Some sufficient optimality conditions for problems with additional box constraints and bivalent constraints are then derived.