A Perturbation Framework for Convex Minimization and Monotone Inclusion Problems with Nonlinear Compositions

References

• [1] Adly S, Attouch H, Vo VN (2022) Newton-type inertial algorithms for solving monotone equations governed by sums of potential and nonpotential operators. Appl. Math. Optim. 85:44.Crossref, Google Scholar
• [2] Alwadani S, Bauschke HH, Wang X (2021) Attouch-Théra duality, generalized cycles, and gap vectors. SIAM J. Optim. 31:1926–1946.Crossref, Google Scholar
• [3] Attouch H (1984) Variational Convergence for Functions and Operators (Pitman, Boston).Google Scholar
• [4] Attouch H, Brezis H (1986) Duality for the sum of convex functions in general Banach spaces. Barroso A, ed. Aspects of Mathematics and Its Applications (North-Holland, Amsterdam), 125–133.Crossref, Google Scholar
• [5] Attouch H, Briceño-Arias LM, Combettes PL (2010) A parallel splitting method for coupled monotone inclusions. SIAM J. Control Optim. 48:3246–3270.Crossref, Google Scholar
• [6] Auslender A, Cominetti R, Haddou M (1997) Asymptotic analysis for penalty and barrier methods in convex and linear programming. Math. Oper. Res. 22:43–62.Link, Google Scholar
• [7] Baillon J-B, Haddad G (1977) Quelques propriétés des opérateurs angle-bornés et n-cycliquement monotones. Israel J. Math. 26:137–150.Crossref, Google Scholar
• [8] Bauschke HH, Combettes PL (2017) Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd ed. (Springer, New York).Crossref, Google Scholar
• [9] Bolte J, Chen Z, Pauwels E (2020) The multiproximal linearization method for convex composite problems. Math. Programming A182:1–36.Crossref, Google Scholar
• [10] Boţ RI (2010) Conjugate Duality in Convex Optimization (Springer, Berlin).Crossref, Google Scholar
• [11] Briceño-Arias LM, Combettes PL (2009) Convex variational formulation with smooth coupling for multicomponent signal decomposition and recovery. Numerical Math. Theory Methods Appl. 2:485–508.Crossref, Google Scholar
• [12] Briceño-Arias LM, Combettes PL (2011) A monotone+skew splitting model for composite monotone inclusions in duality. SIAM J. Optim. 21:1230–1250.Crossref, Google Scholar
• [13] Briceño-Arias LM, Combettes PL (2013) Monotone operator methods for Nash equilibria in non-potential games. Bailey D, Bauschke HH, Borwein P, Garvan F, Théra M, Vanderwerff JD, Wolkowicz H, eds. Computational and Analytical Mathematics (Springer, New York), 143–159.Crossref, Google Scholar
• [14] Briceño-Arias LM, Davis D (2018) Forward-backward-half forward algorithm for solving monotone inclusions. SIAM J. Optim. 28:2839–2871.Crossref, Google Scholar
• [15] Bùi MN, Combettes PL (2020) Warped proximal iterations for monotone inclusions. J. Math. Anal. Appl. 491:124315.Crossref, Google Scholar
• [16] Bùi MN, Combettes PL (2022) Multivariate monotone inclusions in saddle form. Math. Oper. Res. 47:1082–1109.Link, Google Scholar
• [17] Burke JV (1985) Descent methods for composite nondifferentiable optimization problems. Math. Programming 33:260–279.Crossref, Google Scholar
• [18] Burke JV, Engle A (2020) Strong metric (sub)regularity of Karush-Kuhn-Tucker mappings for piecewise linear-quadratic convex-composite optimization and the quadratic convergence of Newton’s method. Math. Oper. Res. 45:1164–1192.Link, Google Scholar
• [19] Burke JV, Hoheisel T, Nguyen QV (2021) A study of convex convex-composite functions via infimal convolution with applications. Math. Oper. Res. 46:1324–1348.Link, Google Scholar
• [20] Cevher V, Vũ BC (2021) A reflected forward-backward splitting method for monotone inclusions involving Lipschitzian operators. Set-Valued Variational Anal. 29:163–174.Crossref, Google Scholar
• [21] Chen G, Teboulle M (1994) A proximal-based decomposition method for convex minimization problems. Math. Programming 64:81–101.Crossref, Google Scholar
• [22] Combari C, Laghdir M, Thibault L (1994) Sous-différentiels de fonctions convexes composées. Ann. Sci. Math. Quebec 18:119–148.Google Scholar
• [23] Combari C, Laghdir M, Thibault L (1996) A note on subdifferentials of convex composite functionals. Arch. Math. (Basel) 67:239–252.Crossref, Google Scholar
• [24] Combettes CW, Pokutta S (2021) Complexity of linear minimization and projection on some sets. Oper. Res. Lett. 49:565–571.Crossref, Google Scholar
• [25] Combettes PL, Glaudin LE (2019) Proximal activation of smooth functions in splitting algorithms for convex image recovery. SIAM J. Imaging Sci. 12:1905–1935.Crossref, Google Scholar
• [26] Combettes PL, Pesquet J-C (2012) Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators. Set-Valued Variational Anal. 20:307–330.Crossref, Google Scholar
• [27] Combettes PL, Pesquet J-C (2020) Deep neural network structures solving variational inequalities. Set-Valued Variational Anal. 28:491–518.Crossref, Google Scholar
• [28] Combettes PL, Pesquet J-C (2021) Fixed point strategies in data science. IEEE Trans. Signal Processing 69:3878–3905.Crossref, Google Scholar
• [29] Condat L (2013) A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms. J. Optim. Theory Appl. 158:460–479.Crossref, Google Scholar
• [30] Facchinei F, Pang J-S (2003) Finite-Dimensional Variational Inequalities and Complementarity Problems (Springer, New York).Google Scholar
• [31] Jaggi M (2013) Revisiting Frank–Wolfe: Projection-free sparse convex optimization. Proc. 30th Internat. Conf. Machine Learn., vol. 28 (ACM, New York), 427–435.Google Scholar
• [32] Joly JL, Laurent PJ (1971) Stability and duality in convex minimization problems. Revue Française d’Informatique Recherche Opérationnelle Série Rouge 5:3–42.Crossref, Google Scholar
• [33] Kutateladze SS (1977) Formulas for computing subdifferentials. Soviet Math. Doklady 18:146–148.Google Scholar
• [34] Lemaire B (1985) Application of a subdifferenlial of a convex composite functional to optimal control in variational inequalities. Lecture Notes Econom. Math. Systems 255:103–117.Crossref, Google Scholar
• [35] Lescarret C (1968) Sous-différentialité de fonctions composées. Séminaire d’Analyse Unilatérale, exposé No. 2 (Montpellier, France).Google Scholar
• [36] Lewis AS, Wright SJ (2016) A proximal method for composite minimization. Math. Programming 158:501–546.Crossref, Google Scholar
• [37] Lions J-L (1969) Quelques Méthodes de Résolution des Problèmes aux Limites Non Linéaires (Dunod, Paris).Google Scholar
• [38] Malitsky Y, Tam MK (2020) A forward-backward splitting method for monotone inclusions without cocoercivity. SIAM J. Optim. 30:1451–1472.Crossref, Google Scholar
• [39] Mordukhovich BS, Nam NM, Salinas J (2012) Solving a generalized Heron problem by means of convex analysis. Amer. Math. Monthly 119:87–99.Crossref, Google Scholar
• [40] Pauwels E (2016) The value function approach to convergence analysis in composite optimization. Oper. Res. Lett. 44:790–795.Crossref, Google Scholar
• [41] Pennanen T (1999) Graph-convex mappings and K-convex functions. J. Convex Anal. 6:235–266.Google Scholar
• [42] Pennanen T (2000) Dualization of generalized equations of maximal monotone type. SIAM J. Optim. 10:809–835.Crossref, Google Scholar
• [43] Press WH, Teukolsky SA, Vetterling WT, Flannery BP (2007) Numerical Recipes—The Art of Scientific Computing, 3rd ed. (Cambridge University Press, Cambridge, MA).Google Scholar
• [44] Repetti A, Wiaux Y (2021) Variable metric forward-backward algorithm for composite minimization problems. SIAM J. Optim. 31:1215–1241.Crossref, Google Scholar
• [45] Rockafellar RT (1966) Level sets and continuity of conjugate convex functions. Trans. Amer. Math. Soc. 123:46–63.Crossref, Google Scholar
• [46] Rockafellar RT (1967) Duality and stability in extremum problems involving convex functions. Pacific J. Math. 21:167–187.Crossref, Google Scholar
• [47] Rockafellar RT (1969) Convex functions and duality in optimization problems and dynamics. Kuhn HW, Szegö GP, eds. Mathematical Systems Theory and Economics I (Springer, New York), 117–141.Crossref, Google Scholar
• [48] Rockafellar RT (1970) Convex Analysis (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• [49] Rockafellar RT (1970) Monotone operators associated with saddle-functions and minimax problems. Browder FE, ed. Nonlinear Functional Analysis, Part 1 (AMS, Providence, RI), 241–250.Crossref, Google Scholar
• [50] Rockafellar RT (1974) Conjugate Duality and Optimization (SIAM, Philadelphia).Crossref, Google Scholar
• [51] Rockafellar RT (2023) Augmented Lagrangians and hidden convexity in sufficient conditions for local optimality. Math. Programming A198:159–194.Crossref, Google Scholar
• [52] Rockafellar RT, Wets RJB (2009) Variational Analysis, 3rd ed. (Springer, New York).Google Scholar
• [53] Rubinov AM (1977) Sublinear operators and their applications. Russian Math. Surveys 32:115–175.Crossref, Google Scholar
• [54] Ryu EK, Vũ BC (2020) Finding the forward-Douglas–Rachford-forward method. J. Optim. Theory Appl. 184:858–876.Crossref, Google Scholar
• [55] Vũ BC (2013) A splitting algorithm for dual monotone inclusions involving cocoercive operators. Adv. Comput. Math. 38:667–681.Crossref, Google Scholar
• [56] Wang X, Zhang J, Zhang W (2020) The distance between convex sets with Minkowski sum structure: Application to collision detection. Comput. Optim. Appl. 77:465–490.Crossref, Google Scholar
• [57] Zălinescu C (2002) Convex Analysis in General Vector Spaces (World Scientific Publishing, River Edge, NJ).Crossref, Google Scholar
• [58] Zeidler E (1990) Nonlinear Functional Analysis and Its Applications II/B: Nonlinear Monotone Operators (Springer, New York).Google Scholar