Optimization Algorithms for $ {L}_{0} $ Pseudo Norm Regularization

415 Views Asked by At

I have a non-convex objective function with L0 constraint. I am struggling to find an approximate method to solve the problem. I would really grateful if someone could give a pointer to an algorithm.

1

There are 1 best solutions below

0
On BEST ANSWER

The paper "Low Rank Priors for Color Image Regularization" by Mollenhoff, Strekalovskiy, Moller, and Cremers contains a proximal algorithm that is useful for non-convex optimization and shows some examples where the $\ell_0$-penalty is used.