×

A generalized conditional gradient method and its connection to an iterative shrinkage method. (English) Zbl 1179.90326

Summary: This article combines techniques from two fields of applied mathematics: optimization theory and inverse problems. We investigate a generalized conditional gradient method and its connection to an iterative shrinkage method, which has been recently proposed for solving inverse problems.
The iterative shrinkage method aims at the solution of non-quadratic minimization problems where the solution is expected to have a sparse representation in a known basis. We show that it can be interpreted as a generalized conditional gradient method. We prove the convergence of this generalized method for general class of functionals, which includes non-convex functionals. This also gives a deeper understanding of the iterative shrinkage method.

MSC:

90C52 Methods of reduced gradient type
90C26 Nonconvex programming, global optimization
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Armijo, L.: Minimization of functions having Lipschitz continuous first partial derivatives. Pac. J. Math. 16, 1–3 (1966) · Zbl 0202.46105
[2] Brezis, H.: Opérateurs maximaux monotones et Semi-groups de Contractions dans les Espaces de Hilbert. North-Holland Mathematics Studies, vol. 5. North-Holland, Amsterdam (1973)
[3] Daubechies, I., Defrise, M., De Mol, C.: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Commun. Pure Appl. Math. 57(11), 1413–1457 (2004) · Zbl 1077.65055 · doi:10.1002/cpa.20042
[4] Demyanov, V.F., Rubinov, A.M.: Approximate Methods in Optimization Problems. Modern Analytic and Computational Methods in Science and Mathematics, vol. 32. Elsevier (1970) · Zbl 0217.46203
[5] Dunn, J.C.: Rates of convergence for conditional gradient algorithms near singular and nonsingular extremals. SIAM J. Control Optim. 17(2), 187–211 (1979) · Zbl 0403.49028 · doi:10.1137/0317015
[6] Dunn, J.C.: Convergence rates for conditional gradient sequences generated by implicit step length rules. SIAM J. Control Optim. 18(5), 473–487 (1980) · Zbl 0457.65048 · doi:10.1137/0318035
[7] Ekeland, I., Temam, R.: Convex Analysis and Variational Problems. North-Holland, Amsterdam (1976) · Zbl 0322.90046
[8] Engl, H.W., Hanke, M., Neubauer, A.: Regularization of Inverse Problems. Mathematics and Its Applications, vol. 375. Kluwer Academic, Dordrecht (1996) · Zbl 0859.65054
[9] Frank, M., Wolfe, P.: An algorithm for quadratic programming. Nav. Res. Log. Q. 3, 95–110 (1956) · doi:10.1002/nav.3800030109
[10] Goldstein, A.A.: On steepest descent. SIAM J. Control Optim. 3, 147–151 (1965) · Zbl 0221.65094
[11] Lions, J.-L.: Optimal Control Systems Governed by Partial Differential Equations. Springer, Berlin (1971) · Zbl 0203.09001
[12] Louis, A.K.: Inverse und Schlecht Gestellte Probleme. Teubner, Stuttgart (1989) · Zbl 0667.65045
[13] Polak, E.: An historical survey of computational methods in optimal control. SIAM Rev. 15(2), 553–584 (1973) · Zbl 0274.49001 · doi:10.1137/1015071
[14] Ramlau, R., Teschke, G.: Tikhonov replacement functionals for iteratively solving nonlinear operator equations. Inverse Probl. 21, 1571–1592 (2005) · Zbl 1078.47030 · doi:10.1088/0266-5611/21/5/005
[15] Ramlau, R., Teschke, G.: A projection iteration for nonlinear operator equations with sparsity constraints. Numer. Math. 104, 177–203 (2006) · Zbl 1101.65056 · doi:10.1007/s00211-006-0016-3
[16] Zeidler, E.: Nonlinear Functional Analysis and Its Applications, vol. III. Springer, Berlin (1984)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.