The chain rule for VU-decompositions of nonsmooth functions

zbMath1439.58003arXiv1909.04799MaRDI QIDQ5110185

No author found.

Publication date: 18 May 2020

Full work available at URL: https://arxiv.org/abs/1909.04799

manifold nonsmooth analysis chain rule strong transversality VU-decomposition fast track partly smooth function U-Lagrangian finite-max function primal-dual gradient VU-algorithm

Mathematics Subject Classification ID

Convex programming (90C25) Minimax problems in mathematical programming (90C47) Numerical optimization and variational techniques (65K10) Nonsmooth analysis (49J52) Real-valued functions on manifolds (58C05)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
Smooth minimization of non-smooth functions
Smoothing methods for nonsmooth, nonconvex minimization
A linearly convergent conjugate gradient method for unconstrained optimization problems
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
A trust region method for minimization of nonsmooth functions with linear constraints
Trust region algorithm for nonsmooth optimization
A simplified view of first order methods for optimization
On finite convergence and constraint identification of subgradient projection methods
On the convergence of projected gradient processes to singular critical points
Methods of descent for nondifferentiable optimization
A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
Dynamic bundle methods
Computing proximal points of convex functions with inexact subgradients
Functions and sets of smooth substructure: relationships and examples
A $\mathcal{VU}$-algorithm for convex minimization
On $\mathcalVU$-theory for Functions with Primal-Dual Gradient Structure
Comparing different nonsmooth minimization methods and software
Linear Convergence of Proximal Gradient Algorithm with Extrapolation for a Class of Nonconvex Nonsmooth Minimization Problems
A Redistributed Proximal Bundle Method for Nonconvex Optimization
A Strongly Convergent Method for Nonsmooth Convex Minimization in Hilbert Spaces
On the global convergence of a nonmonotone proximal bundle method for convex nonsmooth minimization
Projected gradient methods for linearly constrained problems
On the Identification of Active Constraints
Large-Scale Optimization of Eigenvalues
Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
Variational Analysis
Primal-Dual Gradient Structured Functions: Second-Order Results; Links to Epi-Derivatives and Partly Smooth Functions
Trust Region Methods
𝒱𝒰-smoothness and proximal point results for some nonconvex functions
The 𝒰-Lagrangian of a convex function
Active Sets, Nonsmoothness, and Sensitivity
Numerical Analysis of $\mathcal{V}\mathcal{U}$-Decomposition, $\mathcal{U}$-Gradient, and $\mathcal{U}$-Hessian Approximations
A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
On a Class of Nonsmooth Composite Functions
A proximal bundle method for nonsmooth nonconvex functions with inexact information

This page was built for publication: The chain rule for VU-decompositions of nonsmooth functions