Constructing subgradients from directional derivatives for functions of two variables

For any scalar-valued bivariate function that is locally Lipschitz continuous and directionally differentiable, it is shown that a subgradient may always be constructed from the function's directional derivatives in the four compass directions, arranged in a so-called "compass difference". When the original function is nonconvex, the obtained subgradient is an element of Clarke's generalized gradient, but the result appears to be novel even for convex functions. The function is not required to be represented in any particular form, and no further assumptions are required, though the result is strengthened when the function is additionally L-smooth in the sense of Nesterov. For certain optimal-value functions and certain parametric solutions of differential equation systems, these new results appear to provide the only known way to compute a subgradient. These results also imply that centered finite differences will converge to a subgradient for bivariate nonsmooth functions. As a dual result, we find that any compact convex set in two dimensions contains the midpoint of its interval hull. Examples are included for illustration, and it is demonstrated that these results do not extend directly to functions of more than two variables or sets in higher dimensions.

[1]  Francisco Facchinei,et al.  An LP-Newton method: nonsmooth equations, KKT systems, and nonisolated solutions , 2013, Mathematical Programming.

[2]  Kamil A. Khan Subtangent-based approaches for dynamic set propagation , 2018, 2018 IEEE Conference on Decision and Control (CDC).

[3]  Yurii Nesterov,et al.  Lexicographic differentiation of nonsmooth functions , 2005, Math. Program..

[4]  Paul I. Barton,et al.  Generalized Derivatives for Solutions of Parametric Ordinary Differential Equations with Non-differentiable Right-Hand Sides , 2014, J. Optim. Theory Appl..

[5]  Marko Mäkelä,et al.  Survey of Bundle Methods for Nonsmooth Optimization , 2002, Optim. Methods Softw..

[6]  Paul I. Barton,et al.  Generalized Derivatives for Hybrid Systems , 2017, IEEE Transactions on Automatic Control.

[7]  Boris S. Mordukhovich,et al.  Sensitivity Analysis for Two-Level Value Functions with Applications to Bilevel Programming , 2012, SIAM J. Optim..

[8]  J. Frédéric Bonnans,et al.  Perturbation Analysis of Optimization Problems , 2000, Springer Series in Operations Research.

[9]  K. Kiwiel Methods of Descent for Nondifferentiable Optimization , 1985 .

[10]  S. Scholtes Introduction to Piecewise Differentiable Equations , 2012 .

[11]  Jong-Shi Pang,et al.  Solution dependence on initial conditions in differential variational inequalities , 2008, Math. Program..

[12]  C. Lemaréchal,et al.  ON A BUNDLE ALGORITHM FOR NONSMOOTH OPTIMIZATION , 1981 .

[13]  Cyril Imbert,et al.  Support functions of the Clarke generalized Jacobian and of its plenary hull , 2002 .

[14]  Liqun Qi,et al.  Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations , 1993, Math. Oper. Res..

[15]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[16]  Jan Vlcek,et al.  A bundle-Newton method for nonsmooth unconstrained minimization , 1998, Math. Program..

[17]  Alexander Shapiro,et al.  Optimization Problems with Perturbations: A Guided Tour , 1998, SIAM Rev..

[18]  William Hogan,et al.  Directional Derivatives for Extremal-Value Functions with Applications to the Completely Convex Case , 1973, Oper. Res..

[19]  Liqun Qi,et al.  A nonsmooth version of Newton's method , 1993, Math. Program..

[20]  A. Neumaier Interval methods for systems of equations , 1990 .

[21]  F. Clarke Optimization And Nonsmooth Analysis , 1983 .

[22]  Paul I. Barton,et al.  Generalized Derivatives of Differential–Algebraic Equations , 2016, J. Optim. Theory Appl..

[23]  Charles Audet,et al.  Algorithmic Construction of the Subdifferential from Directional Derivatives , 2016 .

[24]  A. Kruger On Fréchet Subdifferentials , 2003 .

[25]  Kamil A. Khan Branch-locking AD techniques for nonsmooth composite functions and nonsmooth implicit functions , 2018, Optim. Methods Softw..

[26]  F. Facchinei,et al.  Finite-Dimensional Variational Inequalities and Complementarity Problems , 2003 .

[27]  Adil M. Bagirov,et al.  Introduction to Nonsmooth Optimization , 2014 .

[28]  C. M. Place,et al.  Ordinary Differential Equations , 1982 .

[29]  Adil M. Bagirov,et al.  Introduction to Nonsmooth Optimization: Theory, Practice and Software , 2014 .

[30]  Naum Zuselevich Shor,et al.  Minimization Methods for Non-Differentiable Functions , 1985, Springer Series in Computational Mathematics.

[31]  Kamil A. Khan Relating Lexicographic Smoothness and Directed Subdifferentiability , 2017 .

[32]  Günter Rote,et al.  The convergence rate of the sandwich algorithm for approximating convex functions , 1992, Computing.

[33]  B. Mordukhovich Variational analysis and generalized differentiation , 2006 .

[34]  A. Griewank Automatic Directional Differentiation of Nonsmooth Composite Functions , 1995 .

[35]  Andreas Griewank,et al.  Evaluating derivatives - principles and techniques of algorithmic differentiation, Second Edition , 2000, Frontiers in applied mathematics.

[36]  J. Hiriart-Urruty,et al.  Convex analysis and minimization algorithms , 1993 .

[37]  Paul I. Barton,et al.  A vector forward mode of automatic differentiation for generalized derivative evaluation , 2015, Optim. Methods Softw..

[38]  Alexander Mitsos,et al.  Multivariate McCormick relaxations , 2014, J. Glob. Optim..

[39]  Paul I. Barton,et al.  Generalized Sensitivity Analysis of Nonlinear Programs , 2018, SIAM J. Optim..

[40]  Kamil A. Khan,et al.  Sensitivity analysis for nonsmooth dynamic systems , 2015 .

[41]  Katya Scheinberg,et al.  Introduction to derivative-free optimization , 2010, Math. Comput..

[42]  J. Danskin The Theory of Max-Min, with Applications , 1966 .

[43]  Steven Skiena,et al.  Problems in geometric probing , 1989, Algorithmica.