scientific article
From MaRDI portal
Publication:2953662
zbMath1433.68364arXiv1506.02530MaRDI QIDQ2953662
Chenxin Ma, Rachael Tappenden, Martin Takáč
Publication date: 5 January 2017
Full work available at URL: https://arxiv.org/abs/1506.02530
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
stochastic methodsiteration complexityconvergence theoryweak strong convexityfeasible descent method
Convex programming (90C25) Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (2)
On the Complexity Analysis of the Primal Solutions for the Accelerated Randomized Dual Coordinate Ascent ⋮ Linear convergence of prox-SVRG method for separable non-smooth convex optimization problems under bounded metric subregularity
This page was built for publication:
