{"total":24,"rows":[{"id":"2109.11154","title":"Rank Overspecified Robust Matrix Recovery: Subgradient Method and Exact Recovery","created":"2021-09-23","cited_by_count":22,"area":null},{"id":"2108.11832","title":"Active manifolds, stratifications, and convergence to local minima in nonsmooth optimization","created":"2021-08-26","cited_by_count":11,"area":null},{"id":"2106.03034","title":"Minibatch and Momentum Model-based Methods for Stochastic Weakly Convex Optimization","created":"2021-06-06","cited_by_count":10,"area":null},{"id":"2102.02837","title":"Escaping Saddle Points for Nonsmooth Weakly Convex Functions via Perturbed Proximal Algorithms","created":"2021-02-04","cited_by_count":4,"area":null},{"id":"2305.15136","title":"ReSync: Riemannian Subgradient-based Robust Rotation Synchronization","created":"2023-05-24","cited_by_count":3,"area":null},{"id":"2401.13971","title":"Stochastic Weakly Convex Optimization Beyond Lipschitz Continuity","created":"2024-01-25","cited_by_count":3,"area":null},{"id":"2405.10289","title":"On the Uniform Convergence of Subdifferentials in Stochastic Optimization and Learning","created":"2024-05-16","cited_by_count":3,"area":null},{"id":"2302.12808","title":"Linearization Algorithms for Fully Composite Optimization","created":"2023-02-24","cited_by_count":2,"area":null},{"id":"2308.16362","title":"A Unified Analysis on the Subgradient Upper Bounds for the Subgradient Methods Minimizing Composite Nonconvex, Nonsmooth and Non-Lipschitz Functions","created":"2023-08-30","cited_by_count":2,"area":null},{"id":"2410.10623","title":"Robust Gradient Descent for Phase Retrieval","created":"2024-10-14","cited_by_count":2,"area":null},{"id":"2410.15224","title":"Robust Low-rank Tensor Train Recovery","created":"2024-10-19","cited_by_count":2,"area":null},{"id":"2605.26977","title":"Convergence of Spectral Descent for Non-smooth Optimization","created":"2026-05-26","cited_by_count":2,"area":null},{"id":"2206.14981","title":"Randomized Coordinate Subgradient Method for Nonsmooth Composite Optimization","created":"2022-06-30","cited_by_count":1,"area":null},{"id":"2304.12522","title":"A New Inexact Proximal Linear Algorithm with Adaptive Stopping Criteria for Robust Phase Retrieval","created":"2023-04-25","cited_by_count":1,"area":null},{"id":"2311.12652","title":"FedDRO: Federated Compositional Optimization for Distributionally Robust Learning","created":"2023-11-21","cited_by_count":1,"area":null},{"id":"2311.12888","title":"Acceleration and Implicit Regularization in Gaussian Phase Retrieval","created":"2023-11-21","cited_by_count":1,"area":null},{"id":"2601.18245","title":"Tractable Gaussian Phase Retrieval with Heavy Tails and Adversarial Corruption with Near-Linear Sample Complexity","created":"2026-01-26","cited_by_count":1,"area":null},{"id":"2201.07657","title":"Multiblock ADMM for nonsmooth nonconvex optimization with nonlinear coupling constraints","created":"2022-01-19","cited_by_count":0,"area":null},{"id":"2207.08195","title":"SPIRAL: A superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization","created":"2022-07-17","cited_by_count":0,"area":null},{"id":"2303.16822","title":"An inexact LPA for DC composite optimization and application to matrix completions with outliers","created":"2023-03-29","cited_by_count":0,"area":null},{"id":"2308.16752","title":"Moreau Envelope ADMM for Decentralized Weakly Convex Optimization","created":"2023-08-31","cited_by_count":0,"area":null},{"id":"2402.07717","title":"Computationally efficient reductions between some statistical models","created":"2024-02-12","cited_by_count":0,"area":null},{"id":"2409.01570","title":"Smoothed Robust Phase Retrieval","created":"2024-09-03","cited_by_count":0,"area":null},{"id":"2410.05025","title":"$\\ell_1$-norm rank-one symmetric matrix factorization has no spurious second-order stationary points","created":"2024-10-07","cited_by_count":0,"area":null}],"next_cursor":null}