Extension to Sufficient Optimality Conditions in Complex Programming | Science Publications

摘要

> In this study we extend the sufficient optimality conditions of complex programming problems to a large class of functions that include the two parts (real and imaginary) of the objective function. The sufficient conditions were established under generalized forms of convexity assumptions. The previous results that considered the real part only can be deduced as special cases.