Follow

Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems. (arXiv:1808.02901v1 [math.OC]) arxiv.org/abs/1808.02901

· · feed2toot · 0 · 0 · 0
Sign in to participate in the conversation
Qoto Mastodon

QOTO: Question Others to Teach Ourselves
An inclusive, Academic Freedom, instance
All cultures welcome.
Hate speech and harassment strictly forbidden.