Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems
From MaRDI portal
Publication:6155872
Abstract: 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--Lojasiewicz (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.
Recommendations
- First-order algorithms for a class of fractional optimization problems
- General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
- Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
- Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs
- A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
Cites work
- scientific article; zbMATH DE number 6511278 (Why is no real title available?)
- scientific article; zbMATH DE number 3371284 (Why is no real title available?)
- A proximal algorithm with backtracked extrapolation for a class of structured fractional programming
- Alternative branching rules for some nonconvex problems
- An algorithm for generalized fractional programs
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Conditional gradient algorithms for rank-one matrix approximations with a sparsity constraint
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Efficiency of minimizing compositions of convex functions and smooth maps
- Explicit bounds for the Łojasiewicz exponent in the gradient inequality for polynomials
- Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs
- Fractional Programming for Communication Systems—Part I: Power Control and Beamforming
- Fractional Programming. II, On Dinkelbach's Algorithm
- Fréchet subdifferential calculus and optimality conditions in nondifferentiable programming
- Generalized subdifferentials of the rank function
- Kurdyka-Łojasiewicz exponent via inf-projection
- On Fréchet subdifferentials
- On Nonlinear Fractional Programming
- On gradients of functions definable in o-minimal structures
- On optimizing the sum of the Rayleigh quotient and the generalized Rayleigh quotient on the unit sphere
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- On the global optimization of sums of linear fractional functions over a convex set
- Parametric approaches to fractional programs
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal mapping for symmetric penalty and sparsity
- Proximal-gradient algorithms for fractional programming
- Restricted normal cones and sparsity optimization with affine constraints
- Solving the trust-region subproblem by a generalized eigenvalue problem
- Sparse Generalized Eigenvalue Problem Via Smooth Optimization
- Sparse Generalized Eigenvalue Problem: Optimal Statistical Rates via Truncated Rayleigh Flow
- Variational Analysis
Cited in
(5)- On the Global Convergence of Randomized Coordinate Gradient Descent for Nonconvex Optimization
- First-order algorithms for a class of fractional optimization problems
- Bregman proximal linearized ADMM for minimizing separable sums coupled by a difference of functions
- A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems
- Multi-block relaxed-dual linear inertial ADMM algorithm for nonconvex and nonsmooth problems with nonseparable structures
This page was built for publication: Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6155872)
