Block Broyden's Methods for Solving Nonlinear Equations

This paper studies quasi-Newton methods for solving nonlinear equations. We propose block variants of both good and bad Broyden's methods, which enjoy explicit local superlinear convergence rates. Our block good Broyden's method has faster condition-number-free convergence rate than existing Broyden's methods because it takes the advantage of multiple rank modification on the Jacobian estimator. On the other hand, our block bad Broyden's method directly estimates the inverse of the Jacobian provably, which reduces the computational cost of the iteration. Our theoretical results provide some new insights on why good Broyden's method outperforms bad Broyden's method in most of the cases. The empirical results also demonstrate the superiority of our methods and validate our theoretical analysis.

Authors

• Chengchang Liu Department of Computer Science and Engineering, The Chinese University of Hong Kong
• Cheng Chen
• Luo Luo Fudan University Shanghai Key Laboratory for Contemporary Applied Mathematics
• John C. S. Lui The Chinese University of Hong Kong

Keywords

No keywords are indexed for this paper.