“…If it is nonconvex, the time consuming simulated annealing can be used [5] (1987), [6], [135], [241], [483], or else Graduated Non-Convexity [95], [293], [496] (with normalized convolution for obtaining an initial good approximation), [540], EM [113], [181], [288], [454], Genetic Algorithm [174], Markov Chain Monte Carlo using Gibbs Sampler [209], [214], [234], [241], [254], [612], Energy Minimization using Graph-Cuts [248], [279], [305], [535], Bregman Iteration [353], [590], proximal iteration [357], (Regularized) Orthogonal Matching Pursuit [390], [464], and Particle Swarm Optimization [448] might be used. [109], [118], [133], [172], [181], [184], [197], [199], [204], [216], [218], [221], [223], [226], [229], [251]…”