Research map / Learning theory and algorithms / Matrix and tensor methods
Faster proximal algorithms for matrix optimization using Jacobi-based eigenvalue methods
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.
Closest papers by meaning
- Operator Splitting with Hamilton-Jacobi-based Proximals (ICML 2026 · similarity 0.88)
- Spectral Frank-Wolfe Algorithm: Strict Complementarity and Linear Convergence (ICML 2020 · similarity 0.87)
- Faster Projection-free Convex Optimization over the Spectrahedron (NeurIPS 2016 · similarity 0.87)
- Adaptive Proximal Gradient Method for Convex Optimization (NeurIPS 2024 · similarity 0.85)
- Provable Acceleration of Nesterov's Accelerated Gradient for Asymmetric Matrix Factorization and Linear Neural Networks (NeurIPS 2024 · similarity 0.85)
- Learning to Discover Iterative Spectral Algorithms (NeurIPS 2026 · similarity 0.85)
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.