Coordinate Descent Methods for Fractional Minimization
Ganzhao Yuan

TL;DR
This paper introduces two coordinate descent algorithms for solving structured fractional minimization problems, guaranteeing convergence to stationary points and demonstrating superior performance on machine learning and signal processing tasks.
Contribution
It proposes novel coordinate descent methods tailored for fractional problems with convex or concave denominators, with convergence guarantees and practical efficiency.
Findings
Methods converge to coordinate-wise stationary points.
Algorithms outperform existing methods in accuracy on real data.
Convergence is linear or sublinear depending on conditions.
Abstract
We consider a class of structured fractional minimization problems, in which the numerator part of the objective is the sum of a differentiable convex function and a convex non-smooth function, while the denominator part is a convex or concave function. This problem is difficult to solve since it is non-convex. By exploiting the structure of the problem, we propose two Coordinate Descent (CD) methods for solving this problem. The proposed methods iteratively solve a one-dimensional subproblem \textit{globally}, and they are guaranteed to converge to coordinate-wise stationary points. In the case of a convex denominator, under a weak \textit{locally bounded non-convexity condition}, we prove that the optimality of coordinate-wise stationary point is stronger than that of the standard critical point and directional point. Under additional suitable conditions, CD methods converge…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Optimization Algorithms Research · Sparse and Compressive Sensing Techniques · Iterative Methods for Nonlinear Equations
