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.
Jobs on main
Batch scripts, as on a Slurm cluster: push, then sbatch job.sbatch in your clone. Partitions: main (up to 01:00:00, 4 CPUs).
No runner serves this project yet.