Some row action methods and their applications

11:45am brown bag lunch and lecturefruit and cookies servedAbstract: Kaczmarz and Hildreth algorithms are row action methods forsolving linear systems of equations and inequalities respectively. It isobserved that the randomized Kaczmarz algorithm can provide fastconvergence. We will analyze the error of a generalized randomizedKaczmarz algorithm from the perspective of almost sure convergence. Wethen introduce the randomized Hildreth algorithm, and provide a meansquared error bound. This algorithm, in combination with a priorityselection scheme, is applied to solve a standard user interface layoutproblem.