Abstract

We study the convergence analysis of Tikhonov regularization in finding a zero of a maximal monotone operator using the notion of R-continuity. Applications to convex minimization and DC programming are provided.

Author information

Contact details are reproduced from the original publication and may be historical.

Ba Khiet Le

Optimization Research Group, Faculty of Mathematics and Statistics, Ton Duc Thang University, Ho Chi Minh City, Vietnam

lebakhiet@tdtu.edu.vn

Keywords

  • Convex programming
  • maximal monotone operators
  • proximal point algorithm
  • regularization
  • DC programming

Mathematics Subject Classification

47N10, 90C26, 90C06

References

  1. F. Alvarez, H. Attouch: An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping, Set-Valued Analysis 9 (2001) 3–11.https://doi.org/10.1023/A:1011253113155Google Scholar
  2. H. Attouch, A. Cabot: Convergence of a relaxed inertial proximal algorithm for maximally monotone operators, Math. Programming A 184/1-2 (2020) 243–287.https://doi.org/10.1007/s10107-019-01412-0Google Scholar
  3. H. Attouch, J. Peypouquet: Convergence of inertial dynamics and proximal algorithms governed by maximal monotone operators, Math. Programming 174 (2019) 391–432.https://doi.org/10.1007/s10107-018-1252-xGoogle Scholar
  4. J. P. Aubin, A. Cellina: Differential Inclusions, Grundlehren der Mathematischen Wissenschaften Vol. 264, Springer, Berlin (1984).https://doi.org/10.1007/978-3-642-69512-4Google Scholar
  5. P. Bosch, A. Jourani, R. Henrion: Sufficient conditions for error bounds and applications, Appl. Math. Optim. 50 (2004) 161–181.https://doi.org/10.1007/s00245-004-0799-5Google Scholar
  6. H. Brezis: Opérateurs Maximaux Monotones et Semi-Groupes de Contractions dans les Espaces de Hilbert, North-Holland Mathematics Studies 5, North-Holland, Amsterdam (1973).Google Scholar
  7. G. H. G. Chen, R. T. Rockafellar: Convergence rates in forward-backward splitting, SIAM J. Optimization 7/2 (1997) 421–444.https://doi.org/10.1137/S1052623495290179Google Scholar
  8. R. Cominetti, J. Peypouquet, S. Sorin: Strong asymptotic convergence of evolution equations governed by maximal monotone operators with Tikhonov regularization, J. Diff. Equations 245/12 (2008) 3753–3763.https://doi.org/10.1016/j.jde.2008.08.007Google Scholar
  9. J. Eckstein: Splitting Methods for Monotone Operators with Applications to Parallel Optimization, PhD Thesis, Mass. Inst. Technology, Boston (1989).Google Scholar
  10. W. Hare, C. Sagastizábal, M. Solodov: A proximal bundle method for nonsmooth nonconvex functions with inexact information, Comp. Opt. Appl. 63 (2016) 1–28.https://doi.org/10.1007/s10589-015-9762-4Google Scholar
  11. R. Henrion, J. V. Outrata: Calmness of constraint systems with applications, Math. Programming, Ser. B 104 (2005) 437–464.https://doi.org/10.1007/s10107-005-0623-2Google Scholar
  12. A. J. Hoffman: On approximate solutions of systems of linear inequalities, J. Res. Nat. Bureau Standards 49/4 (1952) 263–265.https://doi.org/10.6028/jres.049.027Google Scholar
  13. R. Horst, V. T. Nguyen: DC programming: Overview, J. Optim. Theory Appl. 103 (1999) 1–43.https://doi.org/10.1023/A:1021765131316Google Scholar
  14. T. H. A. Le, V. N. Huynh, D. T. Pham: Convergence analysis of difference-of-convex algorithm with subanalytic data, J. Optim. Theory Appl. 179 (2018) 103–126.https://doi.org/10.1007/s10957-018-1345-yGoogle Scholar
  15. R. I. Leine, N. Wouw: Stability and Convergence of Mechanical Systems with Unilateral Constraints, Springer, Berlin (2008).https://doi.org/10.1007/978-3-540-76975-0Google Scholar
  16. P. L. Lions, B. Mercier: Splitting algorithms for the sum of two nonlinear operators, SIAM J. Numer. Analysis 16 (1979) 964–979.https://doi.org/10.1137/0716071Google Scholar
  17. P. E. Maingé, A. Moudafi: Convergence of new inertial proximal methods for DC programming, SIAM J Optim. 19/1 (2008) 397–413.https://doi.org/10.1137/060655183Google Scholar
  18. B. Martinet: Régularisation d’inéquations variationnelles par approximations successives, Rev. Francaise Autom. Inf. Rech. Oper. 3 (1970) 154–158.https://doi.org/10.1051/m2an/197004R301541Google Scholar
  19. B. Martinet: Determination approchée d’un point fixe d’une application pseudocontractante. Cas de l’application prox, C. R. Acad. Sci. Paris A 274 (1972) 163–165.Google Scholar
  20. K. Nakajo, W. Takahashi: Strong convergence theorems for nonexpansive mappings and nonexpansive semigroups, J. Math. Analysis Appl. 279 (2003) 372–379.https://doi.org/10.1016/S0022-247X(02)00458-4Google Scholar
  21. I. Necoara, Y. Nesterov, F. Glineur: Linear convergence of first order methods for non-strongly convex optimization, Math. Programming 175 (2019) 69–107.https://doi.org/10.1007/s10107-018-1232-1Google Scholar
  22. Y. Nesterov: A method of solving a convex programming problem with convergence rate O(1/k2), Sov. Mat. Doklady 27/2 (1983) 372–376.Google Scholar
  23. Y. Nesterov: Introductory Lectures on Convex Optimization. A Basic Course, Applied Optimization Vol. 87, Kluwer Academic Publishers, Boston (2004).https://doi.org/10.1007/978-1-4419-8853-9Google Scholar
  24. G. B. Passty: Ergodic convergence to a zero of the sum of monotone operators in Hilbert space, J. Math. Analysis Appl. 72/2 (1979) 383–390.https://doi.org/10.1016/0022-247X(79)90234-8Google Scholar
  25. D. T. Pham, L. T. H. Le: Convex analysis approach to D.C. programming: Theory, algorithms and applications, Acta Math. Vietnamica 22 (1997) 289–355.Google Scholar
  26. R. T. Rockafellar: Monotone operators and the proximal point algorithm, SIAM J. Control Optimization 14/5 (1976) 877–898.https://doi.org/10.1137/0314056Google Scholar
  27. M. V. Solodov, B. F. Svaiter: Forcing strong convergence of proximal point iterations in a Hilbert space, Math. Programming A 87 (2000) 189–202.https://doi.org/10.1007/s101079900113Google Scholar
  28. A. Tanwani, B. Brogliato, C. Prieur: Well-posedness and output regulation for implicit time-varying evolution variational inequalities, SIAM J. Control Optimization 56/2 (2018) 751–781.https://doi.org/10.1137/16M1083657Google Scholar
  29. M. Tao, X. Yuan: On the optimal linear convergence rate of a generalized proximal point algorithm, J. Sci. Comput. 74 (2018) 826–850.https://doi.org/10.1007/s10915-017-0477-9Google Scholar
  30. A. Tikhonov, V. Arsenine: Méthodes de Résolution de Problèmes Mal Posés, Mir, Moscow (1974).Google Scholar
  31. R. Wittmann: Approximation of fixed points of nonexpansive mappings, Arch. Math. 58 (1992) 486–491.https://doi.org/10.1007/BF01190119Google Scholar

Suggested citation

B. K. Le. “R-Continuity with Applications to Convergence Analysis of Tikhonov Regularization and DC Programming.” Journal of Convex Analysis 31 (2024), No. 1, 243–254. https://doi.org/10.68381/jca31014

Download BibTeXPublished by Heldermann Verlag.

Published by Heldermann Verlag, 2024. Rights now held by Banach Press LLC.