No article text was recorded for this version.
Moreau envelope smoothing (proximal smoothing)
Version 1 of 128 papers31 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Convergence of adaptive algorithms for constrained weakly convex optimization
- Blog: On Distributed Nonconvex Optimization: Projected Subgradient Method for Weakly Convex Problems in Networks
- Blog: Smoothed Variable Sample-Size Accelerated Proximal Methods for Nonsmooth Stochastic Convex Programs
- Blog: Uniform Convergence and Generalization for Nonconvex Stochastic Minimax Problems
- Blog: Non-Smooth Weakly-Convex Finite-sum Coupled Compositional Optimization
- Blog: On Gradient Descent Ascent for Nonconvex-Concave Minimax Problems
- Blog: Finite-Time Nonconvex Optimization Using Time-Varying Dynamical Systems
- Blog: A zeroth order method for stochastic weakly convex optimization
- Blog: Distributionally Robust Nash Equilibria via Variational Inequalities
- Blog: The landscape of the proximal point method for nonconvex-nonconcave minimax optimization
- Blog: Efficient Algorithms for Smooth Minimax Optimization
- Blog: Mean-semideviation-based distributionally robust learning with weakly convex losses: convergence rates and finite-sample guarantees
- Blog: Two-Timescale Q-Learning with Function Approximation in Zero-Sum Stochastic Games
- Blog: Variable Smoothing for Weakly Convex Composite Functions
- Blog: Algorithms and complexity for computing Nash equilibria in adversarial team games
- Blog: Variational Convexity of Functions and Variational Sufficiency in Optimization
- Blog: Uniformly Stable Algorithms for Adversarial Training and Beyond
- Blog: Set Smoothness Unlocks Clarke Hyper-stationarity in Bilevel Optimization
- Blog: Stochastic Gradient Methods under Heavy-Tailed Noises in Weakly Convex Optimization
- Blog: Bregman Finito/MISO for Nonconvex Regularized Finite Sum Minimization without Lipschitz Gradient Continuity
- Blog: Convergence of First-Order Methods for Constrained Nonconvex Optimization with Dependent Data
- Blog: Proximal Compositional Optimization for Distributionally Robust Learning
- Blog: Convergence of a Stochastic Gradient Method with Momentum for Non-Smooth Non-Convex Optimization
- Blog: Anderson Acceleration of Proximal Gradient Methods
- Blog: A Unified Framework for Rank-based Loss Minimization
- Blog: Outlier-robust nonsmooth stochastic optimization
- Blog: Federated Reinforcement Learning: Linear Speedup Under Markovian Sampling
- Blog: Convergence Analysis of a Proximal Stochastic Denoising Regularization Algorithm
History & citation
Current · Permanent link
- This direction split from Moreau Envelope Smoothing for Non-Smooth Non-Convex Optimization (89% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_moreau_envelope_smoothing_proximal_smoot_6d605edb,
title = {Moreau envelope smoothing (proximal smoothing)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/moreau-envelope-smoothing-proximal-smoothing/rdr_6d605edb23a246d8b1b21be57553cbab},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_moreau_envelope_smoothing_proximal_smoot_6d605edb_v1,
title = {Moreau envelope smoothing (proximal smoothing)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/moreau-envelope-smoothing-proximal-smoothing/rdr_6d605edb23a246d8b1b21be57553cbab/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}