Nonsmooth Convex Optimization

Overview

It seeks reliable minimizers when losses have kinks or constraints, as in robust, composite, and distributed learning, where ordinary gradient methods may not apply. Core tools include subgradient and proximal-point methods, bundle methods, three-operator splitting, primal-dual and gossip schemes, and stochastic variants using clipping or variance control. Theory studies convergence and oracle complexity on composite problems, networked objectives, and noisy or information-limited oracles, with stronger rates under conditions such as quadratic growth, sharpness, or strong convexity. A central tension is that guarantees depend strongly on geometry and noise assumptions, while cheaper, communication-limited, or privacy-preserving updates can require more iterations or weaker rates.

Latest papers

CardsList

25 papers2 papers in the last four weeks, against 2 the four weeks before. 0.0% of all new papers.

  1. Near-Optimal Methods for Generalized Lipschitz Convex Optimization

    Nov 15, 2026Dmitry Kovalev, Grigory MalinovskyNonsmooth Convex OptimizationStochastic Optimization Convergence

  2. Adaptive Federated Optimization Across Smooth and Nonsmooth Regimes

    Oct 29, 2026Zimeng Wang, Ali Dadras, Alp YurtseverFederated LearningAdaptive Gradient Methods

  3. Last-Iterate Convergence of Clipped SGD with Linear Decay

    Oct 13, 2026Wei Jiang, Haomin Bai, Zechao LiLast-Iterate ConvergenceStochastic Gradient Descent

  4. Complexities of Weak Proximal Oracle Methods for Composite Convex Optimization

    Sep 21, 2026Dan GarberOracle ComplexityOptimization Convergence Analysis

  5. Stable Movement for Nondual Lipschitz Convex Optimization: Efficiency and Nearly Optimal Oracle Rates

    Sep 17, 2026David Martínez-Rubio, Cristóbal GuzmánConstrained OptimizationNonsmooth Convex Optimization

  6. The First-Order Oracle Complexity of Lipschitz Convex Optimization in Nondual Settings

    Sep 17, 2026Brian Bullins, Cristóbal Guzmán, David Martínez-Rubio +1Nonsmooth Convex Optimization

  7. Nonsmooth Optimization via Orthogonalized Momentum

    Sep 12, 2026Lexiao Lai, Tianyi Lin, Jiayu ZhangMuon OptimizerNonconvex Optimization

  8. Active-Trace Complexity Bounds for Moreau--Yosida Unadjusted Langevin Sampling

    Aug 13, 2026Yuchen Xin, Zhihua ZhangLangevin DynamicsSample Complexity

  9. New Bounds for the Last Iterate of the Stochastic subGradient Method

    Jun 23, 2026Guglielmo Beretta, Tommaso Cesari, Roberto Colomboni +1Stochastic OptimizationLast-Iterate Convergence

  10. Adam Converges in Nonsmooth Nonconvex Optimization

    Jun 21, 2026Zijian LiuHeavy-Tailed NoiseNonconvex Optimization

  11. Convergence of Spectral Descent for Non-smooth Optimization

    May 26, 2026Yixuan Yang, Yuqing He, Song LiMuon OptimizerNonsmooth Convex Optimization

  12. Nonsmooth Set-Gradient Ascent to the Pareto Front via Layered Hypervolume and Magnitude Indicators

    May 13, 2026Michael T. M. EmmerichMulti-Objective OptimizationPareto Optimization

  13. Adaptive Decentralized Composite Optimization via Three-Operator Splitting

    Feb 19, 2026Xiaokai Chen, Ilya Kuruzov, Gesualdo ScutariDecentralized OptimizationNonsmooth Convex Optimization

  14. Local adapt-then-combine algorithms for distributed nonsmooth optimization: Achieving provable communication acceleration

    Feb 18, 2026Luyao Guo, Xinli Shi, Wenying Xu +1Distributed OptimizationNonsmooth Convex Optimization

  15. Fast and Efficient Asynchronous Gossip Algorithm for Robust and Non-Smooth Convex Decentralized Learning

    Jan 28, 2026Anna van Elst, Olivier Fercoq, Igor Colin +1Decentralized LearningNonsmooth Convex Optimization

  16. On the Gradient Complexity of Private Optimization with Private Oracles

    Nov 17, 2025Michael Menart, Aleksandar NikolovQuery ComplexityOracle Complexity

  17. Linearly Convergent Algorithms for Nonsmooth Problems with Unknown Smooth Regions

    Jul 25, 2025Zhe Zhang, Suvrit SraNonsmooth Convex OptimizationNonconvex Optimization

  18. Towards Weaker Variance Assumptions for Stochastic Optimization

    Apr 14, 2025Ahmet Alacaoglu, Yura Malitsky, Stephen J. WrightStochastic OptimizationLast-Iterate Convergence

  19. NAG-GS: A Semi-Implicit Stochastic Optimizer with Large-Step Stability

    Sep 29, 2022Valentin Leplat, Daniil Merkulov, Aleksandr Katrutsa +3SGD with MomentumStochastic Optimization