# Optimization algorithm for L0 norm constraint

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.

• By $\ell_0$ constraint do you mean that you have an $\ell_0$-penalty term in the objective function? – littleO Nov 27 '17 at 6:14
• Yes, $\mathit{l}_{0}$-penalty – Dushyant Sahoo Nov 27 '17 at 17:18

## 1 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.