subgradient method

Subgradient Method for System Identification with Non-Smooth Objectives L4DC 2026 De-singularity Subgradient for the q-th-Powered lₚ-Norm Weber Location Problem AAAI 2025 Adam-family Methods for Nonsmooth Optimization with Convergence Guarantees JMLR 2024 A De-singularity Subgradient Approach for the Extended Weber Location Problem IJCAI 2024 Lower Bounds and Optimal Algorithms for Non-Smooth Convex Decentralized Optimization over Time-Varying Networks NeurIPS 2024 Policy Optimization for Robust Average Reward MDPs NeurIPS 2024 Delayed Algorithms for Distributed Stochastic Weakly Convex Optimization NeurIPS 2023 Global Convergence of Sub-gradient Method for Robust Matrix Recovery: Small Initialization, Noisy Measurements, and Over-parameterization JMLR 2023 Oracle Complexity of Single-Loop Switching Subgradient Methods for Non-Smooth Weakly Convex Functional Constrained Optimization NeurIPS 2023 Stochastic Optimization for Spectral Risk Measures AISTATS 2023 A gradient sampling method with complexity guarantees for Lipschitz functions in high and low dimensions NeurIPS 2022 Asymptotic Network Independence and Step-Size for a Distributed Subgradient Method JMLR 2022 Blessing of Depth in Linear Regression: Deeper Models Have Flatter Landscape Around the True Solution NeurIPS 2022 Rank Overspecified Robust Matrix Recovery: Subgradient Method and Exact Recovery NeurIPS 2021 Convergence of a Stochastic Gradient Method with Momentum for Non-Smooth Non-Convex Optimization ICML 2020 Projection Efficient Subgradient Method and Optimal Nonsmooth Frank-Wolfe Method NeurIPS 2020 Quadratically Regularized Subgradient Methods for Weakly Convex Optimization with Weakly Convex Constraints ICML 2020 A Linearly Convergent Method for Non-Smooth Non-Convex Optimization on the Grassmannian with Applications to Robust Subspace and Dictionary Learning NeurIPS 2019 Modeling simple structures and geometry for better stochastic optimization algorithms AISTATS 2019 Convergence guarantees for a class of non-convex and non-smooth optimization problems ICML 2018 Provably Correct Automatic Sub-Differentiation for Qualified Programs NeurIPS 2018 RSG: Beating Subgradient Method without Smoothness and Strong Convexity JMLR 2018 Re-revisiting Learning on Hypergraphs: Confidence Interval and Subgradient Method ICML 2017 Stochastic Convex Optimization: Faster Local Growth Implies Faster Global Convergence ICML 2017 SVD-free Convex-Concave Approaches for Nuclear Norm Regularization IJCAI 2017