Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs

References

• [1] Aragón Artacho FJ, Campoy R, Vuong PT (2020) Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm. Vietnam J. Math. 48(2):363–376.Crossref, Google Scholar
• [2] Attouch H, Bolte J (2009) On the convergence of the proximal algorithm for nonsmooth functions involving analytic features. Math. Programming 116(1–2):5–16.Crossref, Google Scholar
• [3] 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–2):91–129.Crossref, Google Scholar
• [4] Bauschke HH, Combettes PL (2017) Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd ed. (Springer, Cham, Switzerland).Crossref, Google Scholar
• [5] Beck A (2017) First-Order Methods in Optimization (Society for Industrial and Applied Mathematics, Philadelphia).Crossref, Google Scholar
• [6] Beck A, Hallak N (2020) On the convergence to stationary points of deterministic and randomized feasible descent directions methods. SIAM J. Optim. 30(1):56–79.Crossref, Google Scholar
• [7] Bolte J, Pauwels E (2016) Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs. Math. Oper. Res. 41(2):442–465.Link, Google Scholar
• [8] Bolte J, Sabach S, Teboulle M (2014) Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math. Programming 146(1–2):459–494.Crossref, Google Scholar
• [9] Bolte J, Daniilidis A, Lewis A, Shiota M (2007) Clarke subgradients of stratifiable functions. SIAM J. Optim. 18(2):556–572.Crossref, Google Scholar
• [10] Boţ RI, Csetnek ER (2017) Proximal-gradient algorithms for fractional programming. Optimization 66(8):1383–1396.Crossref, Google Scholar
• [11] Chen L, He S, Zhang SZ (2011) When all risk-adjusted performance measures are the same: In praise of the Sharpe ratio. Quant. Finance 11(10):1439–1447.Crossref, Google Scholar
• [12] Crouzeix JP, Ferland JA, Schaible S (1985) An algorithm for generalized fractional programs. J. Optim. Theory Appl. 47(1):35–49.Crossref, Google Scholar
• [13] Dinkelbach W (1967) On nonlinear fractional programming. Management Sci. 13(7):492–498.Link, Google Scholar
• [14] Frankel P, Garrigos G, Peypouquet J (2014) Splitting methods with variable metric for Kurdyka–łojasiewicz functions and general convergence rates. J. Optim. Theory Appl. 165(3):874–900.Crossref, Google Scholar
• [15] Ibaraki T (1981) Solving mathematical programming problems with fractional objective functions. Schaible S, Ziemba W, eds. Generalized Concavity in Optimization and Economics (Academic Press, New York), 441–472.Google Scholar
• [16] Ibaraki T (1983) Parametric approaches to fractional programs. Math. Programming 26(3):345–362.Crossref, Google Scholar
• [17] Kruger AY (2003) On Fréchet subdifferentials. J. Math. Sci. 116(2003):3325–3358.Crossref, Google Scholar
• [18] Kurdyka K (1998) On gradients of functions definable in o-minimal structures. Ann. Inst. Fourier (Grenoble) 48(3):769–783.Crossref, Google Scholar
• [19] Li G, Pong TK (2018) Calculus of the exponent of Kurdyka–łojasiewicz inequality and its applications to linear convergence of first-order methods. Foundations Comput. Math. 18(5):1199–1232.Crossref, Google Scholar
• [20] Lojasiewicz S (1963) Une propriété topologique des sous-ensembles analytiques réels. Les Equations aux Derivees Partielles (Éditions du Centre National de la Recherche Scientifique, Paris), 87–89.Google Scholar
• [21] Mordukhovich BS (2006) Variational Analysis and Generalized Differentiation I. Basic Theory (Springer, Berlin).Google Scholar
• [22] Mordukhovich BS, Nam NM, Yen ND (2006) Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming. Optimization 55(5–6):685–708.Crossref, Google Scholar
• [23] Nesterov Y (2004) Introductory Lectures on Convex Optimization: A Basic Course (Kluwer Academic, Boston).Crossref, Google Scholar
• [24] Noll D (2013) Convergence of non-smooth descent methods using the Kurdyka–łojasiewicz inequality. J. Optim. Theory Appl. 160(2):553–572.Crossref, Google Scholar
• [25] Ochs P (2019) Unifying abstract inexact convergence theorems and block coordinate variable metric iPiano. SIAM J. Optim. 29(1):541–570.Crossref, Google Scholar
• [26] Ochs P, Chen Y, Brox T, Pock T (2014) iPiano: Inertial proximal algorithm for nonconvex optimization. SIAM J. Imaging Sci. 7(2):1388–1419.Crossref, Google Scholar
• [27] Pang JS, Razaviyayn M, Alvarado A (2016) Computing B-stationary points of nonsmooth DC programs. Math. Oper. Res. 42(1):95–118.Link, Google Scholar
• [28] Rahimi Y, Wang C, Dong H, Lou Y (2019) A scale-invariant approach for sparse signal recovery. SIAM J. Sci. Comput. 41(6):3649–3672.Crossref, Google Scholar
• [29] Rockafellar RT, Wets RJB (1998) Variational Analysis (Springer, Berlin).Crossref, Google Scholar
• [30] Schaible S (1976) Fractional programming II. On Dinkelbach’s algorithm. Management Sci. 22(8):868–873.Link, Google Scholar
• [31] Zeng L, Yu P, Pong TK (2021) Analysis and algorithms for some compressed sensing models based on L1/L2 minimization. SIAM J. Optim. 31(2):1576–1603.Crossref, Google Scholar