Deterministic Oracle Complexity for Goldstein Stationarity in Nonsmooth Nonconvex Optimization with Constraints
math.OC
Submitted: 2026-11-04
Updated: 2026-11-16
Comments: 26 pages, 1 figure
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Terminology
Sources
- Gradient sampling algorithm for subsmooth functions
- Zeroth-Order Non-smooth Non-convex Optimization via Gaussian Smoothing
- The Exponential Price of Determinism in Nonsmooth Nonconvex Optimization
- Composite Online-to-Nonconvex Conversion with Optimal Oracle Complexity
Related papers
- An Accelerated Proximal Gradient Method for Bures-Wasserstein Space
- FOMTools: Development and AI-Assisted Code Generation for First-Order Methods
- Lions and Muons: Optimization via Stochastic Frank-Wolfe under Heavy-Tailed Noise
- Dynamic Service Recommendation with Congestion-Dependent Joining: Near-Optimal and Constant-Factor Approximation Algorithms
- Integrating Learning and Optimization for Open Transport Capacity Pooling under Disruption
- Zeroth-Order Gradient Estimators under Decision-Dependent Noise