552 citations · 1.2k across the 33 of their papers we have counts for
3 papers · 1 filter
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…
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…
Restricted normal cones and the method of alternating projections
Heinz H. Bauschke, D. Russell Luke, Hung M. Phan +1
The method of alternating projections (MAP) is a common method for solving feasibility problems. While employed traditionally to subspaces or to convex sets, little was known about…