atlas

Research map / Optimization / Nonconvex and smooth optimization

Accelerated First-order Methods for Geodesically Convex Optimization on Riemannian Manifolds

NeurIPS 2017 · Optimization › Nonconvex and smooth optimization · approach: Acceleration and Nesterov dynamics

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Replace linear extrapolation with nonlinear Riemannian operator (accelerated method) for strongly G-convex objectivesRiemannian gradient descent · geodesically strongly convex smooth problemsconvergence rateHelped
Accelerated method for general G-convex objectivesRiemannian gradient descent · geodesically general convex smooth problemsconvergence rateHelped
Accelerated method instead of RGD on Karcher mean problemsKarcher mean SPD matrix problem · d=100 and d=200, N=100 synthetic SPDdistance to optimum vs. running timeHelped
Accelerated method compared with LRBFGS on Karcher mean problemsKarcher mean SPD matrix problem · d=100 and d=200, N=100 synthetic SPDdistance to optimum vs. iterationsMixed

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy