Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems

In this paper, we consider a class of nonsmooth sum-of-ratios fractional optimization problems with block structure. This model class is ubiquitous and encompasses several important nonsmooth optimization problems in the literature. We first propose an inertial proximal block coordinate method for solving this class of problems by exploiting the underlying structure. The global convergence of our method is guaranteed under the Kurdyka– Łojasiewicz (KL) property and some mild assumptions. We then identify the explicit exponents of the KL property for three important structured fractional optimization problems. In particular, for the sparse generalized eigenvalue problem with either cardinality regularization or sparsity constraint, we show that the KL exponents are 1 / 2, and so, the proposed method exhibits linear convergence rate. Finally, we illustrate our theoretical results with both analytic and simulated numerical examples.

[1]  Ting Kei Pong,et al.  Kurdyka–Łojasiewicz Exponent via Inf-projection , 2021, Foundations of Computational Mathematics.

[2]  Lixin Shen,et al.  A proximal algorithm with backtracked extrapolation for a class of structured fractional programming , 2022 .

[3]  Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs , 2020, Mathematics of Operations Research.

[4]  Dmitriy Drusvyatskiy,et al.  Efficiency of minimizing compositions of convex functions and smooth maps , 2016, Math. Program..

[5]  Wei Yu,et al.  Fractional Programming for Communication Systems—Part I: Power Control and Beamforming , 2018, IEEE Transactions on Signal Processing.

[6]  Nadav Hallak,et al.  Proximal Mapping for Symmetric Penalty and Sparsity , 2018, SIAM J. Optim..

[7]  Kean Ming Tan,et al.  Sparse generalized eigenvalue problem: optimal statistical rates via truncated Rayleigh flow , 2016, Journal of the Royal Statistical Society: Series B (Statistical Methodology).

[8]  Guoyin Li,et al.  Calculus of the Exponent of Kurdyka–Łojasiewicz Inequality and Its Applications to Linear Convergence of First-Order Methods , 2016, Foundations of Computational Mathematics.

[9]  Akiko Takeda,et al.  Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem , 2017, SIAM J. Optim..

[10]  Radu Ioan Bot,et al.  Proximal-gradient algorithms for fractional programming , 2016, Optimization.

[11]  Eduard A. Jorswieck,et al.  Energy Efficiency in Wireless Networks via Fractional Programming Theory , 2015, Found. Trends Commun. Inf. Theory.

[12]  Marco Locatelli.  Alternative branching rules for some nonconvex problems , 2015, Optim. Methods Softw..

[13]  Prabhu Babu,et al.  Sparse Generalized Eigenvalue Problem Via Smooth Optimization , 2014, IEEE Transactions on Signal Processing.

[14]  Marc Teboulle,et al.  Proximal alternating linearized minimization for nonconvex and nonsmooth problems , 2013, Mathematical Programming.

[15]  Heinz H. Bauschke,et al.  Restricted Normal Cones and Sparsity Optimization with Affine Constraints , 2012, Found. Comput. Math..

[16]  Bastian Goldlücke,et al.  Variational Analysis , 2014, Computer Vision, A Reference Guide.

[17]  Hai Yen Le.  Generalized subdifferentials of the rank function , 2013, Optim. Lett..

[18]  Benar Fux Svaiter,et al.  Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methods , 2013, Math. Program..

[19]  Marc Teboulle,et al.  Conditional Gradient Algorithmsfor Rank-One Matrix Approximations with a Sparsity Constraint , 2011, SIAM Rev..

[20]  Lei-Hong Zhang,et al.  On optimizing the sum of the Rayleigh quotient and the generalized Rayleigh quotient on the unit sphere , 2013, Comput. Optim. Appl..

[21]  Hédy Attouch,et al.  On the convergence of the proximal algorithm for nonsmooth functions involving analytic features , 2008, Math. Program..

[22]  F. Giannessi.  Variational Analysis and Generalized Differentiation , 2006 .

[23]  N. D. Yen,et al.  Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming , 2006 .

[24]  K. Kurdyka,et al.  Explicit bounds for the Łojasiewicz exponent in the gradient inequality for polynomials , 2005 .

[25]  H. P. Benson,et al.  On the Global Optimization of Sums of Linear Fractional Functions over a Convex Set , 2004 .

[26]  A. Kruger.  On Fréchet Subdifferentials , 2003 .

[27]  K. Kurdyka.  On gradients of functions definable in o-minimal structures , 1998 .

[28]  I. Stancu-Minasian.  Nonlinear Fractional Programming , 1997 .

[29]  S. Schaible,et al.  An algorithm for generalized fractional programs , 1985 .

[30]  Toshihide Ibaraki,et al.  Parametric approaches to fractional programs , 1983, Math. Program..