Skip to search formSkip to main contentSkip to account menu

Local convergence

Known as: Global convergence, Locally convergent 
In numerical analysis, an iterative method is called locally convergent if the successive approximations produced by the method are guaranteed to… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2000
Highly Cited
2000
An algorithm for general nonlinearly constrained optimization is presented, which solves an unconstrained piecewise quadratic… 
Highly Cited
2000
Highly Cited
2000
Addresses the problem of regulating the dynamic model of a nonholonomic wheeled robot of the unicycle type to a point with a… 
Highly Cited
1999
Highly Cited
1999
We consider the control of a hovercraft, having only two control inputs with three degrees of freedom. The model is obtained from… 
Highly Cited
1999
Highly Cited
1999
The strategy for obtaining global convergence is based on the trust region approach. The merit function is a type of augmented… 
Highly Cited
1999
Highly Cited
1999
Based on Qi, Sun, and Zhou's smoothing Newton method, we propose a regularized smoothing Newton method for the box constrained… 
Highly Cited
1996
Highly Cited
1992
Highly Cited
1992
Existing results in the literature have proved that particular blind equalization algorithms, including Godard algorithms, are… 
1983
1983
A direct adaptive control scheme for not necessarily minimum phase systems is presented. The algorithm is based on simultaneous… 
Highly Cited
1982
Highly Cited
1982
Highly Cited
1982
Highly Cited
1982