A Feasible Level Proximal Point Method for Nonconvex Sparse Constrained Optimization

Neural Information Processing Systems 

In this paper, we study a new model consisting of a general convex or nonconvex objectives and a variety of continuous nonconvex sparsity-inducing constraints.

Similar Docs  Excel Report  more

TitleSimilaritySource
None found