Lipschitz minimization and the Goldstein modulus
From MaRDI portal
Cites work
- A local nearly linearly convergent first-order method for nonsmooth functions with quadratic growth
- A Unified Analysis of Descent Sequences in Weakly Convex Optimization, Including Convergence Rates for Bundle Methods
- Active manifolds, stratifications, and convergence to local minima in nonsmooth optimization
- An Introduction to Optimization on Smooth Manifolds
- Beyond the regret minimization barrier: optimal algorithms for stochastic strongly-convex optimization
- Error bounds, quadratic growth, and linear convergence of proximal methods
- Goldstein stationarity in Lipschitz constrained optimization
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Identifiability, the KL property in metric spaces, and subgradient curves
- Linear convergence of epsilon-subgradient descent methods for a class of convex functions
- No dimension-free deterministic algorithm computes approximate stationarities of Lipschitzians
- Optimality, identifiability, and sensitivity
- Optimization and nonsmooth analysis
- Optimization of lipschitz continuous functions
- Partial Smoothness, Tilt Stability, and Generalized Hessians
- The cost of nonconvexity in deterministic nonsmooth optimization
- Variational analysis of regular mappings. Theory and applications
This page was built for publication: Lipschitz minimization and the Goldstein modulus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7349072)