The Department of Mathematics & Statistics, Kennedy College of Sciences invites you to attend a colloquium talk. This is an in-person event, but Zoom participation is also possible. All are welcome.

Mathematics of Operations Research, Vol. 42, No. 1 (February 2017), pp. 57-76 (20 pages) The l₀-minimization problem that seeks the sparsest point of a polyhedral set is a long-standing, challenging ...

This paper introduces a new class of quasi-Newton algorithms for unconstrained minimization in which no line search is necessary and the inverse Hessian approximations are positive definite. These ...