ICML-One-sided Frank-Wolfe algorithms for saddle problems

是 否 +2 论坛币

k人 参与回答

经管之家送您一份

应届毕业生专属福利!

求职就业群

赵安豆老师微信：zhaoandou666

经管之家联合CDA

送您一个全额奖学金名额~ !

立即领取

感谢您参与论坛问题回答

经管之家送您两个论坛币！

+2 论坛币

One-sided Frank-Wolfe algorithms for saddle problems

                      Vladimir Kolmogorov 1 Thomas Pock 2

             Abstract                 where X , Y are finite dimensional spaces, equipped with
    We study a class of convex-concave saddle-          an inner product h·, ·i and K : X → Y is a bounded
    point problems of the form minx maxy hKx, yi +        linear operator with operator norm LK = kKk. Usually
    fP (x)h (y) where K is a linear operator, fP is      the underlying  ...

扫码加我 拉你入群

请注明：姓名-公司-职位

以便审核进群资格，未注明则拒绝

分享0 收藏0 回帖

关键词：Algorithms Algorithm Problems problem saddle