Stochastic Primal-Dual Algorithms with Faster Convergence than ${O}(1/{\}{sqrtT})$ for Problems without Bilinear Structure

Stochastic Primal-Dual Algorithms with Faster Convergence than ${O}(1/{\}{sqrtT})$ for Problems without Bilinear Structure. Yan, Y., Xu, Y., Lin, Q., Zhang, L., & Yang, T. arXiv:1904.10112, April, 2019. arXiv: http://arxiv.org/abs/1904.10112
bibtex

@article{yan_stochastic_2019,
	title = {Stochastic {Primal}-{Dual} {Algorithms} with {Faster} {Convergence} than \${O}(1/{\textbackslash}{sqrtT})\$ for {Problems} without {Bilinear} {Structure}},
	journal = {arXiv:1904.10112},
	author = {Yan, Yan and Xu, Yi and Lin, Qihang and Zhang, Lijun and Yang, Tianbao},
	month = apr,
	year = {2019},
	note = {arXiv: http://arxiv.org/abs/1904.10112},
	keywords = {/unread, cs.LG, math.OC, stat.ML, ⛔ No DOI found},
}

Downloads: 0