Abstract
We present a survey on the results related to the theory of lexicographic differentiation. This theory ensures an efficient computation of generalized (lexicographic) derivative of a nonsmooth function belonging to a special class of lexicographically smooth functions. This class is a linear space which contains all differentiable functions, all convex functions, and which is closed with respect to component-wise composition of the members. In order to define lexicographic derivative in a unique way, it is enough to fix a basis in the space of variables. Lexicographic derivatives can be used in black-box optimization methods. We give some examples of applications of these derivatives in analysis of nonsmooth functions. It is shown that the system of lexicographic derivatives along a fixed basis correctly represents corresponding nonsmooth function (Newton-Leibnitz formula). We present nonsmooth versions of standard theorems on potentiality of nonlinear operators, on differentiation of parametric integrals and on differentiation of functional sequences. Finally, we show that an appropriately defined lexicographic subdifferential ensures a more rigorous selection of a candidate optimal solution than the subdifferential of Clarke.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Clarke, F.: Optimization and nonsmooth analysis. Wiley, New York, 1983
Demjanov, V., Rubinov V.: On quasi-differentiable functionals. DAN SSSR 250(1), 21 – 25 (1980), (in Russian)
Ioffe, A., Tikhomirov, V.: Theory of Extremal Problems. North Holland, Amsterdam, 1979
Mordukhovich, B.: Maximum principle in problems of time optimal control with nonsmooth constraints. J. Appl. Math. Mech. 40, 960–969 (1976)
Mordukhovich, B.: Complete characterizations of covering, metric regularity, and Lipschitzian properties of multifunctions. Trans. Am. Math. Soc. 340, 1 – 35 (1993)
Mordukhovich, B.: Variational analysis and generalized differentiation. Vol.I: Basic Theory, Vol.II: Applications. To appear in Springer
Mordukhovich, B., Shao, Y.: Nonsmooth sequential analysis in Asplund spaces. Trans. Am. Math. Soc. 348, 1235–1280 (1996)
Moreau, J.J.: Fonctionelles Convexes. Collége de France, Paris, 1966
Nemirovsky, A., Yudin, D.: Informational complexity and efficient methods for solution of convex extremal problems. Wiley, New York, 1983
Nesterov, Yu.: The technique of nonsmooth differentiation. Izvestija AN SSSR, Technicheskaja kibernetika 1, 199–208 (1987), in Russian
Nesterov, Yu.: Efficient methods in nonlinear optimization. Radio i Zviaz', Moscow, 1989 (in Russian)
Nesterov, Yu.: Introductory lectures on convex optimization: Basic course. Kluwer, Boston, 2003
Nesterov, Yu., Nemirovski, A.: Interior-point polynomial algorithms in convex programming. SIAM, Philadelphia, 1994
Renegar, J.: A mathematical view of interior-point methods in convex optimization. MPS-SIAM Series on Optimization, SIAM, Philadelphia, 2001
Rockafellar, R.T.: Convex Analysis. Princeton Univ. Press, Princeton, NJ, 1970
Rockafellar, R.T.: The theory of subgradients and its applications to problems of optimization. Convex and nonconvex functions. Helderman Verlag, Berlin, 1981
Rockafellar, R.T., Wets, R.J-B.: Variational Analysis. Springer-Verlag, Berlin, 1998
Author information
Authors and Affiliations
Corresponding author
Additional information
Dedicated to R. T. Rockafellar on his 70th birthday.
This paper presents research results of the Belgian Program on Interuniversity Attraction Poles, initiated by the Belgian Federal Science Policy Office. The scientific responsibility rests with its author.
Rights and permissions
About this article
Cite this article
Nesterov, Y. Lexicographic differentiation of nonsmooth functions. Math. Program. 104, 669–700 (2005). https://doi.org/10.1007/s10107-005-0633-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10107-005-0633-0