Optimality of a feasible point in the convex program (CP) can be checked using a saddle-point condition regardless of whether the functions are differentiable (“smooth”) or not. An alternative approach is to use the objects called “subgradients” and “subdifferentials”:
KeywordsConvex Function Feasible Point Convex Program Unconstrained Minimization Sequential Unconstrained Minimization Technique
Unable to display preview. Download preview PDF.