Efficient Convex Optimization with Membership Oracles
conference on learning theory(2017)
摘要
We consider the problem of minimizing a convex function over a convex set given access only to an evaluation oracle for the function and a membership oracle for the set. We give a simple algorithm which solves this problem with Õ(n^2) oracle calls and Õ(n^3) additional arithmetic operations. Using this result, we obtain more efficient reductions among the five basic oracles for convex sets and functions defined by Grötschel, Lovasz and Schrijver.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络