2001
DOI: 10.1109/12.936235
|View full text |Cite
|
Sign up to set email alerts
|

Optimal algorithms for well-conditioned nonlinear systems of equations

Abstract: We propose to solve nonlinear systems of equations by function optimization and we give an optimal algorithm which relies on a special canonical form of gradient descent. The algorithm can be applied under certain assumptions on the function to be optimized, that is an upper{bound must exist for the norm of the Hessian, whereas the norm of the gradient must be lower{bounded. Due to its intrinsic structure, the algorithm looks particularly appealing for a parallel implementation. As a particular case, more spec… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
8
0

Year Published

2004
2004
2020
2020

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 18 publications
(9 citation statements)
references
References 35 publications
1
8
0
Order By: Relevance
“…Therefore, in order to gain a relative error which 11 In fact, Wx can be calculated in O(|H|) steps, due to the sparsity of x . using optimal iterative solvers (see, e.g., Björck [1996] and Bianchini et al [2001]) in a number of steps which is independent of the Web dimension, thus confirming the result stated by Theorem 6.1.…”
Section: Pagerank Computationsupporting
confidence: 79%
“…Therefore, in order to gain a relative error which 11 In fact, Wx can be calculated in O(|H|) steps, due to the sparsity of x . using optimal iterative solvers (see, e.g., Björck [1996] and Bianchini et al [2001]) in a number of steps which is independent of the Web dimension, thus confirming the result stated by Theorem 6.1.…”
Section: Pagerank Computationsupporting
confidence: 79%
“…However, the hyper surface constructed by the tunneling algorithm becomes very flat as the number of the detected minimisers increases, hindering further exploration of the search space, after the detection of a few minimisers. A different technique for avoiding local minimisers is simulated annealing that combines local search with Monte Carlo techniques and simulates the annealing processes which are used to reveal the low temperature state of materials [19].…”
Section: The Optimized Back Propagation Algorithmmentioning
confidence: 99%
“…In this paper, the parameters of the terminal attractor algorithm [19] are adapted to guarantee that the optimal solution is reached in a number of steps that is independent of the cost function using a wavelet based fire detection method in video. Our method not only detects fire and smoke colored moving regions in video but also analyzes the motion of such regions in wavelet domain for object estimation.…”
Section: Introductionmentioning
confidence: 99%
“…One quantitative way to assess sensitivity is by computing a condition number C, which is defined as follows [3,4]:…”
Section: Mathematical Backgroundmentioning
confidence: 99%