Review for NeurIPS paper: A Feasible Level Proximal Point Method for Nonconvex Sparse Constrained Optimization

Summary and Contributions: UPDATE AFTER REBUTTAL Thank you for your response. The authors have agreed to clarify the motivation for the use of non-convex constraints and will be precise about the use of the word "suboptimal". They have agreed to state that they have considerably more knowledge on the specific kind of non-convexity they are dealing with when comparing with prior works. As a consequence I have increased my score, although I believe the experimental section remains rather unconvincing. This paper proposes a method based on a sequence of convex approximations to solve optimization problems with a non-convex sparsity constraint.