2021
DOI: 10.48550/arxiv.2110.08572
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Greedy and Random Broyden's Methods with Explicit Superlinear Convergence Rates in Nonlinear Equations

Abstract: In this paper, we propose the greedy and random Broyden's method for solving nonlinear equations. Specifically, the greedy method greedily selects the direction to maximize a certain measure of progress for approximating the current Jacobian matrix, while the random method randomly chooses a direction. We establish explicit (local) superlinear convergence rates of both methods if the initial point and approximate Jacobian are close enough to a solution and corresponding Jacobian. Our two novel variants of Broy… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 45 publications
0
3
0
Order By: Relevance
“…Related Work Very recently, Lin et al [19], Ye et al [38] showed Broyden's methods have explicit local superlinear convergence rate for solving nonlinear equations, but their assumptions are quite different from ours. Specifically, they only suppose Ĥ(z) − Ĥ(z * ) ≤ L 2 z − z * for any z ∈ R n , which is weaker than Assumption 4.1 of this paper.…”
Section: Extension For Solving Nonlinear Equationsmentioning
confidence: 91%
See 1 more Smart Citation
“…Related Work Very recently, Lin et al [19], Ye et al [38] showed Broyden's methods have explicit local superlinear convergence rate for solving nonlinear equations, but their assumptions are quite different from ours. Specifically, they only suppose Ĥ(z) − Ĥ(z * ) ≤ L 2 z − z * for any z ∈ R n , which is weaker than Assumption 4.1 of this paper.…”
Section: Extension For Solving Nonlinear Equationsmentioning
confidence: 91%
“…Similarly, we can also achieve G k+1 by such Gk for specific BFGS and SR1 update. Combining iteration (10) with (38), we propose the quasi-Newton methods for general strongly-convex-strongly-concave saddle point problems. The details is shown in Algorithm 5, 6 and 7 for greedy Broyden family, BFGS and SR1 updates respectively.…”
Section: Algorithmsmentioning
confidence: 99%
“…Quasi-Newton methods for solving nonlinear equations (unconstrained VI) and SPP are proposed in [75,121] and [79], respectively. In these papers, local superlinear rates of convergence are derived for the modifications of the Broyden-type methods for solving nonlinear equations with Lipschitz Jacobian and SPP with Lipschitz Hessian.…”
Section: Quasi-newton and Tensor Methods For VI And Sppmentioning
confidence: 99%