Search Results for author: Ganzhao Yuan

Found 9 papers, 1 papers with code

A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints

no code implementations7 Apr 2023 Ganzhao Yuan

We propose a breakpoint searching method and a fifth-order iterative method to solve this problem efficiently and effectively.

Coordinate Descent Methods for Fractional Minimization

no code implementations30 Jan 2022 Ganzhao Yuan

This problem is difficult to solve since it is non-convex.

Coordinate Descent Methods for DC Minimization: Optimality Conditions and Global Convergence

no code implementations9 Sep 2021 Ganzhao Yuan

This paper proposes a coordinate descent method for minimizing a class of DC functions based on sequential nonconvex approximation.

A Decomposition Algorithm for the Sparse Generalized Eigenvalue Problem

no code implementations CVPR 2019 Ganzhao Yuan, Li Shen, Wei-Shi Zheng

The sparse generalized eigenvalue problem arises in a number of standard and modern statistical learning models, including sparse principal component analysis, sparse Fisher discriminant analysis, and sparse canonical correlation analysis.

Numerical Analysis

A Coordinate-wise Optimization Algorithm for Sparse Inverse Covariance Selection

no code implementations19 Nov 2017 Ganzhao Yuan, Haoxian Tan, Wei-Shi Zheng

Sparse inverse covariance selection is a fundamental problem for analyzing dependencies in high dimensional data.

A Matrix Splitting Method for Composite Function Minimization

no code implementations CVPR 2017 Ganzhao Yuan, Wei-Shi Zheng, Bernard Ghanem

Incorporating a new Gaussian elimination procedure, the matrix splitting method achieves state-of-the-art performance.

Convex Optimization for Linear Query Processing under Approximate Differential Privacy

1 code implementation13 Feb 2016 Ganzhao Yuan, Yin Yang, Zhenjie Zhang, Zhifeng Hao

This paper points out that under ($\epsilon$, $\delta$)-differential privacy, the optimal solution of the above constrained optimization problem in search of a suitable strategy can be found, rather surprisingly, by solving a simple and elegant convex optimization program.

Cannot find the paper you are looking for? You can Submit a new open access paper.