vix.ing · top · new · best · stats · spec

The chain rule for VU-decompositions of nonsmooth functions

2019/09/11 by Warren Hare, Hare, Warren, Chayne Planiden +3
Engineering · Mathematics · #26B12 #46N10 #49J53 #90C26 #Advanced Optimization Algorithms Research #FOS: Mathematics #Functional Analysis (math.FA) #Numerical methods in inverse problems #Optimization and Control (math.OC) #Sparse and Compressive Sensing Techniques

paper · pdf · doi:10.48550/arxiv.1909.04799

openalex publication_date 2019/09/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In Variational Analysis, VU-theory provides a set of tools that is helpful for understanding and exploiting the structure of nonsmooth functions. The theory takes advantage of the fact that at any point, the space can be separated into two orthogonal subspaces: one that describes the direction of nonsmoothness of the function, and the other on which the function behaves smoothly and has a gradient. For a composite function, this work establishes a chain rule that facilitates the computation of such gradients and characterizes the smooth subspace under reasonable conditions. From the chain rule presented, formulas for the separation, smooth perturbation and sum of functions are provided. Several nonsmooth examples are explored, including norm functions, max-of-quadratic functions and LASSO-type regularizations.

Citations

Related