Skip to yearly menu bar Skip to main content


Block Broyden's Methods for Solving Nonlinear Equations

Chengchang Liu · Cheng Chen · Luo Luo · John C.S. Lui

Great Hall & Hall B1+B2 (level 1) #1119
[ ]
Thu 14 Dec 8:45 a.m. PST — 10:45 a.m. PST


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.

Chat is not available.