First-order algorithms for a class of fractional optimization problems
From MaRDI portal
Abstract: We consider in this paper a class of single-ratio fractional minimization problems, in which the numerator part of the objective is the sum of a nonsmooth nonconvex function and a smooth nonconvex function while the denominator part is a nonsmooth convex function. In this work, we first derive its first-order necessary optimality condition, by using the first-order operators of the three functions involved. Then we develop first-order algorithms, namely, the proximity-gradient-subgradient algorithm (PGSA), PGSA with monotone line search (PGSA_ML) and PGSA with nonmonotone line search (PGSA_NL). It is shown that any accumulation point of the sequence generated by them is a critical point of the problem under mild assumptions. Moreover, we establish global convergence of the sequence generated by PGSA or PGSA_ML and analyze its convergence rate, by further assuming the local Lipschitz continuity of the nonsmooth function in the numerator part, the smoothness of the denominator part and the Kurdyka- Lojasiewicz property of the objective. The proposed algorithms are applied to the sparse generalized eigenvalue problem associated with a pair of symmetric positive semidefinite matrices and the corresponding convergence results are obtained according to their general convergence theorems. We perform some preliminary numerical experiments to demonstrate the efficiency of the proposed algorithms
Recommendations
- A proximal algorithm with backtracked extrapolation for a class of structured fractional programming
- Proximal-gradient algorithms for fractional programming
- Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs
- Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems
- Fractional optimization problems
Cites work
- A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
- A direct approach to sparse discriminant analysis in ultra-high dimensions
- A Parametric Linear Complementarity Technique for Optimal Portfolio Selection with a Risk-Free Asset
- A parametric linear complementarity technique for the computation of equilibrium prices in a single commodity spatial model
- A proximal difference-of-convex algorithm with extrapolation
- A Scale-Invariant Approach for Sparse Signal Recovery
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- 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
- Coordinate-independent sparse sufficient dimension reduction and variable selection
- DC formulations and algorithms for sparse optimization problems
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Error bounds for analytic systems and their applications
- Error bounds in mathematical programming
- Fractional programming
- Fractional Programming for Communication Systems—Part I: Power Control and Beamforming
- Fractional programming with convex quadratic forms and functions
- From error bounds to the complexity of first-order descent methods for convex functions
- Global optimization of fractional programs
- Globally Optimal Energy-Efficient Power Control and Receiver Design in Wireless Networks
- scientific article; zbMATH DE number 1095224 (Why is no real title available?)
- scientific article; zbMATH DE number 757682 (Why is no real title available?)
- Minimization of the ratio of functions defined as sums of the absolute values
- Non-negative matrix factorization with sparseness constraints
- Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming
- On Nonlinear Fractional Programming
- On Some Properties of Programming Problems in Parametric form Pertaining to Fractional Programming
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- On the use of optimization models for portfolio selection: A review and some computational results
- Optimal solutions for sparse principal component analysis
- Parametric approaches to fractional programs
- Programming with linear fractional functionals
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Sparse Generalized Eigenvalue Problem Via Smooth Optimization
- Sparse Generalized Eigenvalue Problem: Optimal Statistical Rates via Truncated Rayleigh Flow
- Sparse Reconstruction by Separable Approximation
- Sparsity constrained nonlinear optimization: optimality conditions and algorithms
- Two-Point Step Size Gradient Methods
- Variational Analysis
Cited in
(15)- A proximal algorithm with backtracked extrapolation for a class of structured fractional programming
- Proximal-gradient algorithms for fractional programming
- Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems
- A Bregman proximal subgradient algorithm for nonconvex and nonsmooth fractional optimization problems
- Sparse recovery: the square of _1/_2 norms
- Parameterized proximal-gradient algorithms for L1/L2 sparse signal recovery
- Full splitting algorithms for fractional programs with structured numerators and denominators
- An implementable proximal extragradient method for structured fractional programming
- A single-loop proximal subgradient algorithm for A class structured fractional programs
- Minimizing quotient regularization model
- Robust penalized Dantzig selector: error analysis, oracle inequalities, and algorithmic efficiency
- An efficient proximal algorithm for squared L1 over L2 regularized sparse recovery
- Subgradient splitting methods for nonsmooth fractional programming with fixed-point constraints
- Tensor-based Dinkelbach method for computing generalized tensor eigenvalues and its applications
- On the global convergence of the proximal gradient method for Tikhonov regularized correction of absolute value equations
This page was built for publication: First-order algorithms for a class of fractional optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5026841)
