Novel forward-backward algorithms for optimization and applications to compressive sensing and image inpainting

The forward-backward algorithm is a splitting method for solving convex minimization problems of the sum of two objective functions. It has a great attention in optimization due to its broad application to many disciplines, such as image and signal processing, optimal control, regression, and classification problems. In this work, we aim to introduce new forward-backward algorithms for solving both unconstrained and constrained convex minimization problems by using linesearch technique. We discuss the convergence under mild conditions that do not depend on the Lipschitz continuity assumption of the gradient. Finally, we provide some applications to solving compressive sensing and image inpainting problems. Numerical results show that the proposed algorithm is more efficient than some algorithms in the literature. We also discuss the optimal choice of parameters in algorithms via numerical experiments.

Automated summary

The forward-backward algorithm is a splitting method for convex minimization problems, widely applicable in various fields. By incorporating linesearch technique, new forward-backward algorithms are introduced to efficiently solve unconstrained and constrained convex minimization problems, with discussions on convergence and optimal parameter selection.