552 citations · 1.2k across the 33 of their papers we have counts for
Showing 2012 · math.OCShow all
2 papers · 2 filters
math.OC2012★ 3 cited
Nonconvex notions of regularity and convergence of fundamental algorithms for feasibility problems
Robert Hesse, D. Russell Luke
We consider projection algorithms for solving (nonconvex) feasibility problems in Euclidean spaces. Of special interest are the Method of Alternating Projections (MAP) and the Doug…
math.OC2012★ 3 cited
Restricted normal cones and sparsity optimization with affine constraints
Heinz H. Bauschke, D. Russell Luke, Hung M. Phan +1
The problem of finding a vector with the fewest nonzero elements that satisfies an underdetermined system of linear equations is an NP-complete problem that is typically solved num…