Difference-of-Convex Algorithm with Extrapolation for Nonconvex, Nonsmooth Optimization Problems

References

• [1] Aharon M, Elad M, Bruckstein A (2006) K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation. IEEE Trans. Signal Processing 54(11):4311–4322.Crossref, Google Scholar
• [2] An NT, Nam NM (2017) Convergence analysis of a proximal point algorithm for minimizing differences of functions. Optimization 66(1):129–147.Crossref, Google Scholar
• [3] Attouch H, Bolte J (2009) On the convergence of the proximal algorithm for nonsmooth functions involving analytic features. Math. Programming 116:5–16.Crossref, Google Scholar
• [4] Attouch H, Bolte J, Svaiter BF (2013) Convergence of descent methods for semi-algebraic and tame problems: Proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methods. Math. Programming 137(1):91–129.Crossref, Google Scholar
• [5] Attouch H, Bolte J, Redont P, Soubeyran A (2010) Proximal alternating minimization and projection methods for nonconvex problems: An approach based on the Kurdyka-Łojasiewicz inequality. Math. Oper. Res. 35(2):438–457.Link, Google Scholar
• [6] Beck A, Eldar YC (2013) Sparsity constrained nonlinear optimization: Optimality conditions and algorithms. SIAM J. Optim. 23(3):1480–1509.Crossref, Google Scholar
• [7] Beck A, Teboulle M (2009) A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1):183–202.Crossref, Google Scholar
• [8] Bertero M, Boccacci P, Desiderà G, Vicidomini G (2009) Image deblurring with Poisson data: From cells to galaxies. Inverse Problems 25(12):123006.Crossref, Google Scholar
• [9] Biswas P, Lian TC, Wang TC, Ye Y (2006) Semidefinite programming based algorithms for sensor network localization. ACM Trans. Sensor Networks 2(2):188–220.Crossref, Google Scholar
• [10] Bolte J, Sabach S, Teboulle M (2014) Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Programming 146(1):459–494.Crossref, Google Scholar
• [11] Bolte J, Sabach S, Teboulle M, Vaisbourd Y (2018) First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems. SIAM J. Optim. 28(3):2131–2151.Crossref, Google Scholar
• [12] Bradley PS, Mangasarian OL (1998) Feature selection via concave minimization and support vector machines. Shavlik J, ed. Machine Learn. Proc. 15th Internat. Conf. (ICML ‘98) (ICML, San Francisco), 82–90.Google Scholar
• [13] de Oliveira W, Tcheou MP (2019) An inertial algorithm for DC programming. Set-Valued Variational Anal. 27:895–919.Crossref, Google Scholar
• [14] Donoho DL (2006) Compressed sensing. IEEE Trans. Inform. Theory 52(4):1289–1306.Crossref, Google Scholar
• [15] Fan J, Li R (2001) Variable selection via nonconcave penalized likelihood and its oracle properties. J. Amer. Statist. Assoc. 165(3):1348–1360.Crossref, Google Scholar
• [16] Frankel P, Garrigos G, Peypouquet P (2015) Splitting methods with variable metric for Kurdyka–Łojasiewicz functions and general convergence rates. J. Optim. Theory Appl. 165(3):874–900.Crossref, Google Scholar
• [17] Gotoh J-y, Takeda A, Tono K (2018) DC formulations and algorithms for sparse optimization problems. Math. Programming 169(1):141–176.Crossref, Google Scholar
• [18] Halko N, Martinsson PG, Tropp JA (2011) Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions. SIAM Rev. 53(2):217–288.Crossref, Google Scholar
• [19] Kaplan A, Tichatschke R (1998) Proximal point methods and nonconvex optimization. J. Global Optim. 13(4):389–406.Crossref, Google Scholar
• [20] Kim M, Leskovec J (2011) The network completion problem: Inferring missing nodes and edges in networks. Proc. 2011 SIAM Internat. Conf. Data Mining (SIAM, Philadelphia), 47–58.Google Scholar
• [21] Koren Y, Bell R, Volinsky C (2009) Matrix factorization techniques for recommender systems. Computer 42(8):30–37.Crossref, Google Scholar
• [22] Le Thi H, Pham Dinh T, Le H, Vo X (2015) DC approximation approaches for sparse optimization. Eur. J. Oper. Res. 244(1):26–46.Crossref, Google Scholar
• [23] Le Thi HA, Pham Dinh T (2005) The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann. Oper. Res. 133:23–46.Crossref, Google Scholar
• [24] Le Thi HA, Le HM, Phan DN, Tran B (2021) Novel DCA based algorithms for a special class of nonconvex problems with application in machine learning. Appl. Math. Comput. 409:125904.Crossref, Google Scholar
• [25] Li H, Lin Z (2015) Accelerated proximal gradient methods for nonconvex programming. Adv. Neural Inform. Processing Systems, 377–387.Google Scholar
• [26] Liu G, Lin Z, Yan S, Sun J, Yu Y, Ma Y (2013) Robust recovery of subspace structures by low-rank representation. IEEE Trans. Pattern Anal. Machine Intelligence 35(1):171–184.Crossref, Google Scholar
• [27] Lu H, Freund RM, Nesterov Y (2018) Relatively smooth convex optimization by first-order methods, and applications. SIAM J. Optim. 28(1):333–354.Crossref, Google Scholar
• [28] Lu Z, Zhou Z (2019) Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming. SIAM J. Optim. 29(4):2725–2752.Crossref, Google Scholar
• [29] Lu Z, Zhou Z, Sun Z (2019) Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth dc minimization. Math. Programming 176(1):369–401.Crossref, Google Scholar
• [30] Mukkamala MC, Ochs P (2019) Beyond alternating updates for matrix factorization with inertial Bregman proximal gradient algorithms. Adv. Neural Inform. Processing Systems 32, 4266–4276.Google Scholar
• [31] Mukkamala MC, Ochs P, Pock T, Sabach S (2020) Convex-concave backtracking for inertial Bregman proximal gradient algorithms in nonconvex optimization. SIAM J. Math. Data Sci. 2(3):658–682.Crossref, Google Scholar
• [32] Nesterov Y (1983) A method of solving a convex programming problem with convergence rate O(1/k2). Soviet Math. Doklady 27:372–376.Google Scholar
• [33] O’Donoghue B, Candès E (2015) Adaptive restart for accelerated gradient schemes. Foundations Comput. Math. 15(3):715–732.Crossref, Google Scholar
• [34] Pham Dinh T, Le Thi HA (1997) Convex analysis approach to D.C. programming: Theory, algorithms and applications. Acta Math. Vietnam 22(1):289–355.Google Scholar
• [35] Phan D, Le H, Le Thi HA (2018) Accelerated difference of convex functions algorithm and its application to sparse binary logistic regression. Proc. 27th Internat. Joint Conf. Artificial Intelligence 23rd Eur. Conf. Artificial Intelligence, 1369–1375.Google Scholar
• [36] Polyak B (1964) Some methods of speeding up the convergence of iteration methods. USSR Comput. Math. Math. Phys. 4(5):1–17.Crossref, Google Scholar
• [37] Rockafellar R, Wets R (2009) Variational Analysis (Springer, Berlin).Google Scholar
• [38] Wen B, Chen X, Pong TK (2018) A proximal difference-of-convex algorithm with extrapolation. Comput. Optim. Appl. 69(2):297–324.Crossref, Google Scholar
• [39] Yao Q, Kwok JT, Gao F, Chen W, Liu TY (2017) Efficient inexact proximal gradient algorithm for nonconvex problems. Proc. 26th Internat. Joint Conf. Artificial Intelligence, 3308–3314.Google Scholar
• [40] Zhang CH (2010) Nearly unbiased variable selection under minimax concave penalty. Ann. Statist. 38(2):894–942.Crossref, Google Scholar