Complexity of Finding Stationary Points of Nonsmooth Nonconvex Functions

10 February 2020

Papers citing "Complexity of Finding Stationary Points of Nonsmooth Nonconvex Functions"

6 / 6 papers shown

Title
Two-Timescale Gradient Descent Ascent Algorithms for Nonconvex Minimax Optimization Tianyi Lin Chi Jin Michael I. Jordan 57 7 0 28 Jan 2025
Private Zeroth-Order Nonsmooth Nonconvex Optimization Qinzi Zhang Hoang Tran Ashok Cutkosky 42 4 0 27 Jun 2024
Random Scaling and Momentum for Non-smooth Non-convex Optimization Qinzi Zhang Ashok Cutkosky 43 4 0 16 May 2024
Convergence of First-Order Algorithms for Meta-Learning with Moreau Envelopes Konstantin Mishchenko Slavomír Hanzely Peter Richtárik FedML 34 5 0 17 Jan 2023
Faster Gradient-Free Algorithms for Nonsmooth Nonconvex Stochastic Optimization Le‐Yu Chen Jing Xu Luo Luo 36 15 0 16 Jan 2023
Incremental Without Replacement Sampling in Nonconvex Optimization Edouard Pauwels 38 5 0 15 Jul 2020