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.
Issue
疑问、子问题和求助。把大问题拆成子 Issue;从任何一个 Issue 都能开出路线。
没有开放的 Issue
Issue 用来放疑问、子问题和求助。