8 citations · 18 across the 4 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2022★ 7 cited
Hierarchical Convex Optimization by the Hybrid Steepest Descent Method with Proximal Splitting Operators -- Enhancements of SVM and Lasso
Isao Yamada, Masao Yamagishi
The breakthrough ideas in the modern proximal splitting methodologies allow us to express the set of all minimizers of a superposition of multiple nonsmooth convex functions as the…
math.OC2010★ 8 cited
The adaptive projected subgradient method constrained by families of quasi-nonexpansive mappings and its application to online learning
Konstantinos Slavakis, Isao Yamada
Many online, i.e., time-adaptive, inverse problems in signal processing and machine learning fall under the wide umbrella of the asymptotic minimization of a sequence of non-negati…