A Study of Convex Convex-Composite Functions via Infimal Convolution with Applications

References

• [1] Beck A (2017) First-Order Methods in Optimization, MOS-SIAM Series on Optimization, vol. 25 (Society for Industrial and Applied Mathematics, Philadelphia).Crossref, Google Scholar
• [2] Boţ RI (2010) Conjugate Duality in Convex Optimization, Lecture Notes in Economics and Mathematical Systems, vol. 637 (Springer, Berlin).Google Scholar
• [3] Boţ RI, Wanka G (2008) The conjugate of the pointwise maximum of two convex functions revisited. J. Global Optim. 41(3):625–632.Crossref, Google Scholar
• [4] Boţ RI, Grad SM, Wanka G (2007) New constraint qualification and conjugate duality for composed convex optimization problems. J. Optim. Theory Appl. 135(2):241–255.Crossref, Google Scholar
• [5] Boţ RI, Grad SM, Wanka G (2008) A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces. Mathematische Nachrichten 281(8):1088–1107.Crossref, Google Scholar
• [6] Boţ RI, Grad SM, Wanka G (2009) Generalized Moreau-Rockafellar results for composed convex functions. Optimization 58(7):917–933.Google Scholar
• [7] Boţ RI, Hodrea IB, Wanka G (2006) Farkas-type results for inequality systems with composed convex functions via conjugate duality. J. Math. Anal. Appl. 322(1):316–328.Crossref, Google Scholar
• [8] Borwein JM (1974) Optimization with respect to partial orderings. Unpublished PhD thesis, University of Oxford, Oxford, UK.Google Scholar
• [9] Burachik RS, Jeyakumar V, Wu ZY (2006) Necessary and sufficient conditions for stable conjugate duality. Nonlinear Anal. 64(9):1998–2006.Crossref, Google Scholar
• [10] Burke JV (1985) Descent methods for composite nondifferentiable optimization problems. Math. Programming 33(3):260–279.Crossref, Google Scholar
• [11] Burke JV (1987) Second order necessary and sufficient conditions for convex composite NDO. Math. Programming 38(3):287–302.Crossref, Google Scholar
• [12] Burke JV (1991) An exact penalization viewpoint of constrained optimization. SIAM J. Control Optim. 29(4):968–998.Crossref, Google Scholar
• [13] Burke JV, Engle A (2020) Strong metric (sub)regularity of KKT mappings for piecewise linear-quadratic convex-composite optimization and the quadratic convergence of newton’s method. Math. Oper. Res. 45(3):1164–1192.Link, Google Scholar
• [14] Burke JV, Ferris MC (1995) A Gauss-Newton method for convex composite optimization. Math. Programming 71(2):179–194.Crossref, Google Scholar
• [15] Burke JV, Hoheisel T (2013) Epi-convergent smoothing with applications to convex composite functions. SIAM J. Optim. 23(3):1457–1479.Crossref, Google Scholar
• [16] Burke JV, Hoheisel T (2015) Matrix support functionals for inverse problems, regularization, and learning. SIAM J. Optim. 25(2):1135–1159.Crossref, Google Scholar
• [17] Burke JV, Poliquin R (1992) Optimality conditions for non-finite valued convex composite functions. Math. Programming Ser. B. 57(1):103–120.Crossref, Google Scholar
• [18] Burke JV, Gao Y, Hoheisel T (2018) Convex geometry of the generalized matrix-fractional function. SIAM J. Optim. 28(3):2189–2200.Crossref, Google Scholar
• [19] Burke JV, Gao Y, Hoheisel T (2019) Variational properties of matrix functions via the generalized matrix-fractional function. SIAM J. Optim. 29(3):1958–1987.Crossref, Google Scholar
• [20] Cibulka R, Dontchev A, Kruger A (2018) Strong metric subregularity of mappings in variational analysis and optimization. J. Math. Anal. Appl. 457(2):1247–1282.Crossref, Google Scholar
• [21] Clarke FH (1983) Optimization and Nonsmooth Analysis (John Wiley & Sons, New York).Google Scholar
• [22] Combari C, Laghdir M, Thibault L (1994) Sous-différentiels de fonctions convexes composées. Ann. Sci. Math. Québec 18(2):119–148.Google Scholar
• [23] Cui Y, Pang JS, Sen B (2018) Composite difference-max programs for modern statistical estimation problems. SIAM J. Optim. 28(4):3344–3374.Crossref, Google Scholar
• [24] Davis D, Drusvyatskiy D (2019) Stochastic model-based minimization of weakly convex functions. SIAM J. Optim. 29(1):207–239.Crossref, Google Scholar
• [25] Deng S (1996) On uniqueness of Lagrange multipliers in composite optimization. J. Math. Anal. Appl. 201(3):689–696.Crossref, Google Scholar
• [26] Drusvyatskiy D, Lewis AS (2018) Error bounds, quadratic growth, and linear convergence of proximal methods. Math. Oper. Res. 43(3):919–948.Link, Google Scholar
• [27] Drusvyatskiy D, Paquette C (2018) Variational analysis of spectral functions simplified. J. Convex Anal. 25(1):119–134.Google Scholar
• [28] Drusvyatskiy D, Paquette C (2019) Efficiency of minimizing compositions of convex functions and smooth maps. Math. Programming 178(1–2):503–558.Google Scholar
• [29] Duchi JC, Ruan F (2018) Stochastic methods for composite and weakly convex optimization problems. SIAM J. Optim. 28(4):3229–3259.Crossref, Google Scholar
• [30] Duchi JC, Ruan F (2019) Solving (most) of a set of quadratic equalities: Composite optimization for robust phase retrieval. Inform. Inference 8(3):471–529.Crossref, Google Scholar
• [31] Fitzpatrick SP, Simons S (2000) On the pointwise maximum of convex functions. Proc. Amer. Math. Soc. 128(12):3553–3561.Crossref, Google Scholar
• [32] Gaffke N, Krafft O (1982) Matrix inequalities in the Löwner ordering. Korte B, ed. Modern Applied Mathematics (North-Holland, Amsterdam), 595–622.Google Scholar
• [33] Hiriart-Urruty JB (2006) A note on the Legendre-Fenchel transform of convex composite functions. Alart P, Maisonneuve O, Rockafellar RT, eds. Nonsmooth Mechanics and Analysis (Springer, New York), 35–46.Crossref, Google Scholar
• [34] Hiriart-Urruty JB, Lemaréchal C (2001) Fundamentals of Convex Analysis (Springer-Verlag, New York).Crossref, Google Scholar
• [35] Horn R, Johnson CR (2013) Matrix Analysis, vol. 2 (Cambridge University Press, Cambridge, UK).Google Scholar
• [36] Jalali A, Fazel M, Xiao L (2017) Variational gram functions: Convex analysis and optimization. SIAM J. Optim. 27(4):2634–2661.Crossref, Google Scholar
• [37] Kawasaki H (1988) Second-order necessary conditions of the Kuhn-Tucker type under new constraint qualifications. J. Optim. Theory Appl. 57(2):253–264.Crossref, Google Scholar
• [38] Kiefer J (1959) Optimum experimental designs. J. Royal Stat. Soc. B 21(2):(272–319.Google Scholar
• [39] Kusraev AG, Kutateladze SS (1995) Subdifferentials: Theory and Applications, Mathematics and its Applications, vol. 323 (Kluwer Academic Publishers, Dordrecht, Netherlands).Crossref, Google Scholar
• [40] Lewis AS (1995) The convex analysis of unitarily invariant matrix functions. J. Convex Anal. 2(1–2):173–183.Google Scholar
• [41] Lewis AS (1996) Convex analysis on the Hermitian matrices. SIAM J. Optim. 6(1):164–177.Crossref, Google Scholar
• [42] Lewis AS, Wright SJ (2016) A proximal method for composite minimization. Math. Programming, Series B 158(1–2):501–546.lGoogle Scholar
• [43] Nordström K (2011) Convexity of the inverse and Moore-Penrose inverse. Linear Algebra Appl. 434:1498–1512.Crossref, Google Scholar
• [44] Pennanen T (1999) Graph-convex mappings and k-convex functions. J. Convex Anal. 6(2):235–266.Google Scholar
• [45] Powell MJD (1978) Algorithms for nonlinear constraints that use Lagrangian functions. Math. Programming 14(2):224–248.Crossref, Google Scholar
• [46] Powell MJD (1978) A fast algorithm for nonlinearly constrained optimization calculations. Watson GA, ed. Numerical Analysis, Lecture Notes in Mathematics, vol. 630 (Springer, Berlin), 144–157.Crossref, Google Scholar
• [47] Rockafellar RT (1970) Convex Analysis, Princeton Mathematical Series, vol. 28 (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
• [48] Rockafellar RT (1985) Extensions of subgradient calculus with applications to optimization. Nonlinear Anal. Theory Methods Appl. 9(7):665–698.Crossref, Google Scholar
• [49] Rockafellar RT (1989) Second-order optimality conditions in nonlinear programming obtained by way of epi-derivatives. Math. Oper. Res. 14(3):462–484.Link, Google Scholar
• [50] Rockafellar RT, Wets RJB (1998) Variational Analysis. Grundlehren der Mathematischen Wissenschaften, vol. 317 (Springer-Verlag, Berlin).Google Scholar
• [51] Shapiro A, Scheinberg K (2003) Duality and optimality conditions. Wolkowicz H, Saigal R, Vandenberghe L, eds. Handbook of Semidefinite Programming: Theory, Algorithms, and Applications (Springer, New York), 67–110.Google Scholar
• [52] von Neumann J (1962) Some matrix-inequalities and metrization of matrix-space. in Taub AH, ed. John von Neumann Collected Works, Vol. IV. (Pergaman Press, Oxford), 205–218.Google Scholar
• [53] Wright SJ (1987) Local properties of inexact methods for minimizing nonsmooth composite functions. Math. Programming 37(2):232–252.Crossref, Google Scholar
• [54] Yuan Y (1986) On the superlinear convergence of a trust region algorithm for nonsmooth optimization. Math. Programming 31(3):269–285.Crossref, Google Scholar
• [55] Zălinescu C (1983) Duality for vectorial nonconvex optimization by convexification and applications. An. Sti. Univ. “Al.I.Cuza” Iasi Sect. I a Mat. 29(3):15–34.Google Scholar