$Solving Non-smooth Constrained Programs with Lower Complexity than $\mathcal{O}(1/\varepsilon)$: A Primal-Dual Homotopy Smoothing Approach$

v1v2v3 (latest)

Solving Non-smooth Constrained Programs with Lower Complexity than $\mathcal{O}(1/\varepsilon)$ : A Primal-Dual Homotopy Smoothing Approach

5 September 2018

Papers citing "Solving Non-smooth Constrained Programs with Lower Complexity than $\mathcal{O}(1/\varepsilon)$: A Primal-Dual Homotopy Smoothing Approach"

3 / 3 papers shown

Title
Nonsmooth Projection-Free Optimization with Functional Constraints Kamiar Asgari Michael J. Neely 68 0 0 18 Nov 2023
Damped Proximal Augmented Lagrangian Method for weakly-Convex Problems with Convex Constraints Hari Dahal Wei Liu Yangyang Xu 65 5 0 15 Nov 2023
Fast Multi-Agent Temporal-Difference Learning via Homotopy Stochastic Primal-Dual Optimization Dongsheng Ding Xiaohan Wei Zhuoran Yang Zhaoran Wang M. Jovanović 59 15 0 07 Aug 2019