First-Order Algorithms for a Class of Fractional Optimization Problems

DOI10.1137/20M1325381zbMath1484.90123arXiv2005.06207OpenAlexW3025805701MaRDI QIDQ5026841

Na Zhang, Qia Li

Publication date: 8 February 2022

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.06207

zbMATH Keywords

first-order algorithmsfractional optimizationKL propertyproximity algorithmssparse generalized eigenvalue problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Fractional programming (90C32)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparse Generalized Eigenvalue Problem: Optimal Statistical Rates via Truncated Rayleigh Flow
• Coordinate-independent sparse sufficient dimension reduction and variable selection
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
• Global optimization of fractional programs
• 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
• From error bounds to the complexity of first-order descent methods for convex functions
• A proximal difference-of-convex algorithm with extrapolation
• DC formulations and algorithms for sparse optimization problems
• Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
• On the use of optimization models for portfolio selection: A review and some computational results
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
• Minimization of the ratio of functions defined as sums of the absolute values
• Fractional programming with convex quadratic forms and functions
• Sparsity Constrained Nonlinear Optimization: Optimality Conditions and Algorithms
• A Block Coordinate Descent Method for Regularized Multiconvex Optimization with Applications to Nonnegative Tensor Factorization and Completion
• Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
• A direct approach to sparse discriminant analysis in ultra-high dimensions
• Two-Point Step Size Gradient Methods
• BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
• 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
• Variational Analysis
• Sparse Reconstruction by Separable Approximation
• Sparse Generalized Eigenvalue Problem Via Smooth Optimization
• Globally Optimal Energy-Efficient Power Control and Receiver Design in Wireless Networks
• Fractional Programming for Communication Systems—Part I: Power Control and Beamforming
• Parametric approaches to fractional programs
• Conditional Gradient Algorithmsfor Rank-One Matrix Approximations with a Sparsity Constraint
• A Scale-Invariant Approach for Sparse Signal Recovery
• Nonmonotone Enhanced Proximal DC Algorithms for a Class of Structured Nonsmooth DC Programming
• Programming with linear fractional functionals
• On Some Properties of Programming Problems in Parametric form Pertaining to Fractional Programming
• On Nonlinear Fractional Programming
• Fractional programming

This page was built for publication: First-Order Algorithms for a Class of Fractional Optimization Problems