ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2102.02837
  4. Cited By
Escaping Saddle Points for Nonsmooth Weakly Convex Functions via
  Perturbed Proximal Algorithms
v1v2 (latest)

Escaping Saddle Points for Nonsmooth Weakly Convex Functions via Perturbed Proximal Algorithms

4 February 2021
Minhui Huang
ArXiv (abs)PDFHTML

Papers citing "Escaping Saddle Points for Nonsmooth Weakly Convex Functions via Perturbed Proximal Algorithms"

3 / 3 papers shown
Title
On the Hardness of Meaningful Local Guarantees in Nonsmooth Nonconvex
  Optimization
On the Hardness of Meaningful Local Guarantees in Nonsmooth Nonconvex Optimization
Guy Kornowski
Swati Padmanabhan
Ohad Shamir
431
0
0
16 Sep 2024
Efficiently Escaping Saddle Points in Bilevel Optimization
Efficiently Escaping Saddle Points in Bilevel Optimization
Minhui Huang
Xuxing Chen
Kaiyi Ji
Shiqian Ma
Lifeng Lai
92
21
0
08 Feb 2022
Escaping strict saddle points of the Moreau envelope in nonsmooth
  optimization
Escaping strict saddle points of the Moreau envelope in nonsmooth optimization
Damek Davis
Mateo Díaz
Dmitriy Drusvyatskiy
56
15
0
17 Jun 2021
1