This is a preview. Log in through your library . Abstract Let (X; d) be a metric space, f, fn : X → X, with F f = F f n , n ∈ ℕ. For the fixed point equation (1) x = f(x) we consider the following ...
Some iterative methods of mathematical programming use a damping sequence {αt} such that 0 ≤ αt ≤ 1 for all t, αt → 0 as t → ∞, and Σαt = ∞. For example, αt = 1/(t + 1) in Brown's method for solving ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback