Nonsmooth Convex Optimization

Ask about this topic

Momentum

3 papers in the last four weeks, against 1 the four weeks before. 0.0% of all new papers.

Jul 13Week of Sep 28
View on map

Latest papers 16

All topics
CardsList

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

    Sep 21, 2026Dan GarberOracle ComplexityOptimization Convergence Analysis

    Faculty of Data and Decision Sciences Technion - Israel Institute of Technology

  2. 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

    IMDEA Software Institute, Madrid, Spain · Institute for Mathematical and Computational Engineering, Faculty of Mathematics and School of Engineering, Pontificia Universidad Católica de Chile, Santiago, Chile

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

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

    IMDEA Software Institute, Madrid, Spain · Purdue University, West Lafayette, IN, USA · Institute for Mathematical and Computational Engineering, Faculty of Mathematics and School of Engineering, Pontificia Universidad Católica de Chile, Santiago, Chile +1

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

    Aug 13, 2026Yuchen Xin, Zhihua ZhangLangevin DynamicsSample Complexity

    School of Mathematical Sciences, Peking University

  5. Finding a stationary point of a stochastic convex problem

    Jul 8, 2026Felipe Areces, John Duchi, Malo SommersStochastic Optimization ConvergenceNonsmooth Convex Optimization

    Stanford University

  6. Decentralized Stochastic Subgradient-type Methods with Communication Compression for Nonsmooth Nonconvex Optimization

    Jul 2, 2026Siyuan Zhang, Nachuan Xiao, Xin LiuStochastic OptimizationNonconvex Optimization

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

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

    Department of Computer Science, Aarhus University, Aarhus, Denmark · School of Electrical Engineering and Computer Science, University of Ottawa, Ottawa, Canada · School of Mathematics, University of Bristol, Bristol, United Kingdom

  8. Adam Converges in Nonsmooth Nonconvex Optimization

    Jun 21, 2026Zijian LiuHeavy-Tailed NoiseNonconvex Optimization

    Department of Technology, Operations, and Statistics Leonard N. Stern School of Business New York University New York, NY 10012, USA

  9. Convergence of Spectral Descent for Non-smooth Optimization

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

    School of Mathematical Sciences, Zhejiang University, Hangzhou, China

  10. Zeroth-Order Nonconvex Nonsmooth Optimization with Heavy-Tailed Noise

    May 23, 2026Zhuanghua Liu, Luo LuoStochastic OptimizationGradient Clipping

  11. Stochastic Non-Smooth Convex Optimization with Unbounded Gradients

    May 15, 2026Dmitry KovalevStochastic OptimizationGradient Clipping

    Yandex Research

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

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

    Faculty of Information Technology, University of Jyväskylä, Finland

  13. Parameterized Complexity of Stationarity Testing for Piecewise-Affine Functions and Shallow CNN Losses

    May 11, 2026Yuhan YeShallow Neural NetworksNonconvex Optimization

    MIT

  14. 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

    LTCI, Télécom Paris, Institut Polytechnique de Paris

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

    Nov 17, 2025Michael Menart, Aleksandar NikolovQuery ComplexityOracle Complexity

    Department of Computer Science, University of Toronto, Vector Institute · Department of Computer Science, University of Toronto

  16. Towards Weaker Variance Assumptions for Stochastic Optimization

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

    Department of Mathematics, University of British Columbia · Faculty of Mathematics, University of Vienna · Department of Computer Sciences, University of Wisconsin–Madison