The theory of subdifferentials provides adequate methods and tools to put descent methods for nonsmooth optimization problems into practice. However, in applications it is often difficult to decide on a suitable subdifferential concept to construct a descent method. Therefore, we introduce subdifferentials in terms of their properties to indicate a selection of subdifferentials worth considering. This initials the first part of the construction of a continuous outer subdifferential (COS). Typically, methods based on e.g. the Clarke subdifferential are non-convergent without assumptions like semismoothness on the objective function. In cases in which only supersets of the Clarke subdifferential are known, semismoothness cannot be proved or is even violated. Therefore, in the second part of the construction, a previously selected subdifferential will be expanded to a continuous mapping, if necessary. This is also practicable for upper bounds of the subdifferential of current interest. Finally, based on COS we present a methodology for solving nonsmooth optimization problems. From a theoretical point of view, convergence is established through the construction of COS.
The author wishes to thank the reviewers and the associate editor for their very grateful suggestions, which greatly have improve the presentation of the paper. Also, the author likes to thank W. Achtziger for his time to discuss several results.
Hiriart-Urruty, J.-B., Lemaréchal, C.: Convex Analysis and Minimization Algorithms I, 2nd edn. Springer, Berlin (1996)Google Scholar
Hiriart-Urruty, J.-B., Lemaréchal, C.: Convex Analysis and Minimization Algorithms II, 1st edn. Springer, Berlin (1993)MATHGoogle Scholar
Hiriart-Urruty, J.-B., Lemaréchal, C.: Fundaments of Convex Analysis, 2nd edn. Springer, Berlin (2004)Google Scholar
Ioffe, A.D.: Calculus of Dini subdifferentials of functions and contingent coderivatives of set-valued maps. Nonlinear Anal. Theory Methods Appl. 8(5), 517–539 (1984)MathSciNetCrossRefMATHGoogle Scholar