Normal subgroups of classical groups over Banach algebras.
On the best choice of a damping sequence in iterative optimization methods.
Some iterative methods of mathematical programming use a damping sequence {α} such that 0 ≤ α ≤ 1 for all t, α → 0 as t → ∞, and Σ α = ∞. For example, α = 1/(t+1) in Brown's method for solving matrix games. In this paper, for a model class of iterative methods, the convergence rate for any damping sequence {α} depending only on time t is computed. The computation is used to find the best damping sequence.
On subgroups of GL2 over non-commutative local rings which are normalized by elementary matrices.
Page 1