Smoothing alternating direction methods for fully nonsmooth constrained convex optimization

DOI10.1007/978-3-319-97478-1_4zbMath1423.90187arXiv1507.03734OpenAlexW2899828622MaRDI QIDQ2415200

Volkan Cevher, Quoc Tran Dinh

Publication date: 21 May 2019

Full work available at URL: https://arxiv.org/abs/1507.03734

zbMATH Keywords

gap reduction techniquehomotopy smoothing techniquenonsmooth constrained convex optimizationsmooth alternating direction method of multiplierssmooth alternating minimization

Mathematics Subject Classification ID

Convex programming (90C25) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (1)

A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization

This page was built for publication: Smoothing alternating direction methods for fully nonsmooth constrained convex optimization