35 citations · 81 across the 17 of their papers we have counts for
9 papers · 1 filter
A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints
Ganzhao Yuan
Nonsmooth composite optimization with orthogonality constraints has a wide range of applications in statistical learning and data science. However, this problem is challenging due…
Coordinate Descent Methods for Fractional Minimization
Ganzhao Yuan
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-smo…
Coordinate Descent Methods for DC Minimization: Optimality Conditions and Global Convergence
Ganzhao Yuan
Difference-of-Convex (DC) minimization, referring to the problem of minimizing the difference of two convex functions, has been found rich applications in statistical learning and…
Smoothing Proximal Gradient Methods for Nonsmooth Sparsity Constrained Optimization: Optimality Conditions and Global Convergence
Ganzhao Yuan
Nonsmooth sparsity constrained optimization encompasses a broad spectrum of applications in machine learning. This problem is generally non-convex and NP-hard. Existing solutions t…
A Block Decomposition Algorithm for Sparse Optimization
Ganzhao Yuan, Li Shen, Wei-Shi Zheng
Sparse optimization is a central problem in machine learning and computer vision. However, this problem is inherently NP-hard and thus difficult to solve in general. Combinatorial…
A Hybrid Method of Combinatorial Search and Coordinate Descent for Discrete Optimization
Ganzhao Yuan, Li Shen, Wei-Shi Zheng
Discrete optimization is a central problem in mathematical optimization with a broad range of applications, among which binary optimization and sparse optimization are two common o…
A Matrix Splitting Method for Composite Function Minimization
Ganzhao Yuan, Wei-Shi Zheng, Bernard Ghanem
Composite function minimization captures a wide spectrum of applications in both computer vision and machine learning. It includes bound constrained optimization and cardinality re…
Sparsity Constrained Minimization via Mathematical Programming with Equilibrium Constraints
Ganzhao Yuan, Bernard Ghanem
Sparsity constrained minimization captures a wide spectrum of applications in both machine learning and signal processing. This class of problems is difficult to solve since it is…
Binary Optimization via Mathematical Programming with Equilibrium Constraints
Ganzhao Yuan, Bernard Ghanem
Binary optimization is a central problem in mathematical optimization and its applications are abundant. To solve this problem, we propose a new class of continuous optimization te…