mlsanityData to 7 Oct 2026

On the Fenchel Duality between Strong Convexity and Lipschitz Continuous Gradient

arXiv 1803.06573 ↗First posted 17 Mar 2018math.OCcited by 42

Not on the map. Why?

Abstract (arXiv)

We provide a simple proof for the Fenchel duality between strong convexity and Lipschitz continuous gradient. To this end, we first establish equivalent conditions of convexity for a general function that may not be differentiable. By utilizing these equivalent conditions, we can directly obtain equivalent conditions for strong convexity and Lipschitz continuous gradient. Based on these results, we can easily prove Fenchel duality. Beside this main result, we also identify several conditions that are implied by strong convexity or Lipschitz continuous gradient, but are not necessarily equivalent to them. This means that these conditions are more general than strong convexity or Lipschitz continuous gradient themselves.

Key facts. Cited by 42 papers in the map (data through 7 Oct 2026). First posted on arXiv 17 Mar 2018.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 3; 2022: 12; 2023: 10; 2024: 11; 2025: 4; 2026: 2.

42 papers.

Sort:

By area:

  1. 2024Balance Reward and Safety Optimization for Safe Reinforcement Learning: A Perspective of Gradient Manipulationcited by 21
  2. 2021Beyond Bandit Feedback in Online Multiclass Classificationcited by 14
  3. 2022Distributed Distributionally Robust Optimization with Non-Convex Objectivescited by 14
  4. 2022Federated Learning and Meta Learning: Approaches, Applications, and Directionscited by 12
  5. 2024Randomized Asymmetric Chain of LoRA: The First Meaningful Theoretical Framework for Low-Rank Adaptationcited by 12
  6. 2023Robust Markov Decision Processes without Model Estimationcited by 11
  7. 2022A Simple Guard for Learned Optimizerscited by 9
  8. 2025Towards a Sharp Analysis of Offline Policy Learning for f-Divergence-Regularized Contextual Banditscited by 9
  9. 2022Learning Energy Networks with Generalized Fenchel-Young Lossescited by 8
  10. 2024Speeding up and reducing memory usage for scientific machine learning via mixed precisioncited by 8
  11. 2023Particle-based Online Bayesian Samplingcited by 7
  12. 2023Learning Rate Schedules in the Presence of Distribution Shiftcited by 7
30 more
  1. 2024Neural Approximate Mirror Maps for Constrained Diffusion Modelscited by 7
  2. 2021The Gradient Convergence Bound of Federated Multi-Agent Reinforcement Learning with Efficient Communicationcited by 5
  3. 2022Covariance Estimators for the ROOT-SGD Algorithm in Online Learningcited by 5
  4. 2023MoreauGrad: Sparse and Robust Interpretation of Neural Networks via Moreau Envelopecited by 5
  5. 2024Non-geodesically-convex optimization in the Wasserstein spacecited by 5
  6. 2024MoreauPruner: Robust Pruning of Large Language Models against Weight Perturbationscited by 5
  7. 2025Improved Stochastic Optimization of LogSumExpcited by 4
  8. 2022Bregman Power k-Means for Clustering Exponential Family Datacited by 3
  9. 2023Mobilizing Personalized Federated Learning in Infrastructure-Less and Heterogeneous Environments via Random Walk Stochastic ADMMcited by 3
  10. 2024Last-iterate Convergence Separation between Extra-gradient and Optimism in Constrained Periodic Gamescited by 3
  11. 2022Communication-Efficient Consensus Mechanism for Federated Reinforcement Learningcited by 2
  12. 2022Centered plug-in estimation of Wasserstein distancescited by 2
  13. 2022Distributed Statistical Min-Max Learning in the Presence of Byzantine Agentscited by 2
  14. 2023Gauges and Accelerated Optimization over Smooth and/or Strongly Convex Setscited by 2
  15. 2024Discrete distributions are learnable from metastable samplescited by 2
  16. 2024An Adaptively Inexact Method for Bilevel Learning Using Primal-Dual Style Differentiationcited by 2
  17. 2026Convergence Rates for Distribution Matching with Sliced Optimal Transportcited by 2
  18. 2021Spherical Matrix Factorizationcited by 1
  19. 2022Distributed Dynamic Safe Screening Algorithms for Sparse Regularizationcited by 1
  20. 2023Online Learning for Equilibrium Pricing in Markets under Incomplete Informationcited by 1
  21. 2024Point Cloud Classification via Deep Set Linearized Optimal Transportcited by 1
  22. 2022Wasserstein multivariate auto-regressive models for modeling distributional time seriescited by 0
  23. 2022Private Blind Model Averaging - Distributed, Non-interactive, and Convergentcited by 0
  24. 2023Convex optimization over a probability simplexcited by 0
  25. 2023Convergence Analysis of Fractional Gradient Descentcited by 0
  26. 2023Feature Norm Regularized Federated Learning: Transforming Skewed Distributions into Global Insightscited by 0
  27. 2024Extended convexity and smoothness and their applications in deep learningcited by 0
  28. 2025Towards Robust Learning to Optimize with Theoretical Guaranteescited by 0
  29. 2025Normalized Iterative Hard Thresholding for Tensor Recoverycited by 0
  30. 2026A Method for Learning Value Systems in Generative AIcited by 0