An Inertial Algorithm for DC Programming
- 101 Downloads
We consider nonsmooth optimization problems whose objective function is defined by the Difference of Convex (DC) functions. With the aim of computing critical points that are also d(irectional)-stationary for such a class of nonconvex programs we propose an algorithmic scheme equipped with an inertial-force procedure. In contrast to the classical DC algorithm of P. D. Tao and L. T. H. An, the proposed inertial DC algorithm defines trial points whose sequence of functional values is not necessary monotonically decreasing, a property that proves useful to prevent the algorithm from converging to a critical point that is not d-stationary. Moreover, our method can handle inexactness in the solution of convex subproblems yielding trial points. This is another property of practical interest that substantially reduces the computational burden to compute d-stationary/critical points of DC programs. Convergence analysis of the proposed algorithm yields global convergence to critical points, and convergence rate is established for the considered class of problems. Numerical experiments on large-scale (nonconvex and nonsmooth) image denoising models show that the proposed algorithm outperforms the classic one in this particular application, specifically in the case of piecewise constant images with neat edges such as QR codes.
KeywordsDC programming Nonsmooth optimization Variational analysis
Mathematics Subject Classification (2010)49J52 49J53 49K99 90C26
Unable to display preview. Download preview PDF.
The authors are grateful to the Reviewers and the Associate Editor for their remarks and constructive suggestions that considerably improved the original version of this article.
- 11.de Oliveira, W.: Proximal Bundle Methods for Nonsmooth DC Programming. Technical report. Available at www.oliveira.mat.br (2017)
- 15.Gonzalez, R.C., Woods, R.E.: Digital Image Processing, 3rd edn. Prentice-Hall, Inc., Upper Saddle River (2006)Google Scholar
- 18.Hiriart-Urruty, J., Lemaréchal, C.: Convex Analysis and Minimization Algorithms I, 2nd edn. No. 305 in Grundlehren der mathematischen Wissenschaften. Springer, Berlin (1996)Google Scholar
- 22.Izmailov, A.F., Solodov, M.V.: Newton-type Methods for Optimization and Variational Problems, 1st edn. Springer Series in Operations Research and Financial Engineering Springer International Publishing (2014)Google Scholar
- 34.Rockafellar, R.: Convex Analysis, 1st edn. Princeton University Press, Princeton (1970)Google Scholar
- 37.Strekalovsky, A., Minarchenko, I.: On Local Search in d.c. Optimization. In: 2017 Constructive Nonsmooth Analysis and Related Topics (Dedicated to the Memory of V.F. Demyanov) (CNSA), pp. 1–4 (2017)Google Scholar
- 41.Tuy, H.: Convex Analysis and Global Optimization, 2nd edn. Springer Optimization and Its Applications. Springer (2016)Google Scholar
- 42.van Ackooij, W., de Oliveira, W.: DC Programming Techniques with Inexact Subproblems’ Solution for General DC Programs. Technical Report, CMA. Available at www.oliveira.mat.br (2017)