Research map / Optimization / Nonconvex and smooth optimization
Local Linear Convergence of Gradient Methods for Subspace Optimization via Strict Complementarity
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
- Stochastic PCA with $\ell_2$ and $\ell_1$ Regularization (ICML 2018 · similarity 0.93)
- Efficient Convex Relaxations for Streaming PCA (NeurIPS 2019 · similarity 0.90)
- Convergence of Stochastic Gradient Descent for PCA (ICML 2016 · similarity 0.89)
- A Comprehensively Tight Analysis of Gradient Descent for PCA (NeurIPS 2021 · similarity 0.89)
- Provable Acceleration of Nesterov's Accelerated Gradient for Asymmetric Matrix Factorization and Linear Neural Networks (NeurIPS 2024 · similarity 0.88)
- Efficient Sparse PCA via Block-Diagonalization (ICLR 2025 · similarity 0.87)
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.