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 is a preview. Log in through your library . Abstract In the setting of Hilbert spaces, we show that a hybrid steepest-descent algorithm converges strongly to a solution of a convex minimization ...
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.
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback