A fast ellipsoid-like method for geodesically convex optimization
Find a first-order method for geodesically convex optimization with query count logarithmic in 1/ε and cheap iterations.
PR
PR 把工作从一条路线带到另一条;合并它就是采纳。
没有开放的 PR
PR 把工作从一个分支带到另一个分支。
Find a first-order method for geodesically convex optimization with query count logarithmic in 1/ε and cheap iterations.
PR 把工作从一条路线带到另一条;合并它就是采纳。
PR 把工作从一个分支带到另一个分支。