Two applications of lexicographic differentiation

Lexicographic differentiation was introduced by Yurii Nesterov in 1987. A recent and more accessible overview is given in his Mathematical Programming paper. At the CIAO workshop on 27 April I talk about lexicographic differentiation and mention two applications: the construction of directed subdifferential and geometric conditions for facial dual completeness of closed convex cones.

The function shown in the Mathematica rendering is lexicographically smooth, but is neither quasidifferentiable nor tame. The idea of this example was suggested by Jeffrey Pang (NUS).

Download slides