Research map / Optimization / Nonconvex and smooth optimization
Block Broyden's Methods for Solving Nonlinear Equations
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
- Incremental Quasi-Newton Methods with Faster Superlinear Convergence Rates (AAAI 2024 · similarity 0.88)
- Skip the Hessian, Keep the Rates: Globalized Semismooth Newton with Lazy Hessian Updates (NeurIPS 2026 · similarity 0.85)
- Affine-Invariant Global Non-Asymptotic Convergence Analysis of BFGS under Self-Concordance (NeurIPS 2025 · similarity 0.84)
- Exploring Jacobian Inexactness in Second-Order Methods for Variational Inequalities: Lower Bounds, Optimal Algorithms and Quasi-Newton Approximations (NeurIPS 2024 · similarity 0.84)
- An Enhanced Levenberg--Marquardt Method via Gram Reduction (AAAI 2025 · similarity 0.84)
- A Regularized Newton Method for Nonconvex Optimization with Global and Local Complexity Guarantees (NeurIPS 2025 · similarity 0.83)
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.