Research map / Optimization / Nonconvex and smooth optimization
Greedy and Random Quasi-Newton Methods with Faster Explicit Superlinear Convergence
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
- Sharpened Quasi-Newton Methods: Faster Superlinear Rate and Larger Local Convergence Neighborhood (ICML 2022 · similarity 0.93)
- Incremental Quasi-Newton Methods with Faster Superlinear Convergence Rates (AAAI 2024 · similarity 0.92)
- Affine-Invariant Global Non-Asymptotic Convergence Analysis of BFGS under Self-Concordance (NeurIPS 2025 · similarity 0.89)
- Skip the Hessian, Keep the Rates: Globalized Semismooth Newton with Lazy Hessian Updates (NeurIPS 2026 · similarity 0.88)
- Stochastic Newton Proximal Extragradient Method (NeurIPS 2024 · similarity 0.87)
- Non-asymptotic Global Convergence Analysis of BFGS with the Armijo-Wolfe Line Search (NeurIPS 2024 · similarity 0.86)
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.