11 citations · 23 across the 15 of their papers we have counts for
9 papers · 1 filter
Doubly exponential convergence of the cyclic steepest descent method for strictly convex quadratics in arbitrary dimensions
Ran Gu
We study the cyclic steepest descent method (CSD) for strictly convex quadratic minimization. CSD repeats, for j consecutive iterations, the exact steepest-descent step size comput…
Automatic Model-Order Selection for Nonnegative Matrix Factorization via Column Regularization
Yulin He, Ran Gu
Nonnegative matrix factorization represents nonnegative signals as additive combinations of latent components, but its factorization rank, and hence the model order, must usually b…
Masked Symmetric Nonnegative Matrix Factorization for Community Detection in Incomplete Networks
Anqi Liu, Ran Gu, Rui-Jin Zhang
Community detection in complex networks is frequently challenged by incomplete or noisy adjacency matrices. Traditional symmetric nonnegative matrix factorization methods typically…
Structured Spectral Step-Sizes and Rebound-Aware Ordering for Gradient Methods
Yijia Zhou, Ran Gu, Ya-xiang Yuan
The performance of gradient methods depends critically on step-size selection. Spectral step-size design involves constructing candidates from finite history and ordering them duri…
Convergence-Guaranteed Algorithms for l1/2-Regularized Quadratic Programs with Assignment Constraints
Lijun Xie, Ran Gu, Xin Liu
This paper addresses a quadratic problem with assignment constraints, an NP-hard combinatorial optimization problem arisen from facility location, multiple-input multiple-output de…
Heuristic Bundle Upper Bound Based Polyhedral Bundle Method for Semidefinite Programming
Zilong Cui, Ran Gu
Semidefinite programming (SDP) is a fundamental class of convex optimization problems with diverse applications in mathematics, engineering, machine learning, and related disciplin…
A Vectorized Positive Semidefinite Penalty Method for Unconstrained Binary Quadratic Programming
Xinyue Huo, Ran Gu
The unconstrained binary quadratic programming (UBQP) problem is a class of problems of significant importance in many practical applications, such as in combinatorial optimization…
A Random Active Set Method for Strictly Convex Quadratic Problem with Simple Bounds
Ran Gu, Bing Gao
Active set method aims to find the correct active set of the optimal solution and it is a powerful method for solving strictly convex quadratic problem with bound constraints. To g…
A fast two-stage algorithm for non-negative matrix factorization in streaming data
Ran Gu, Qiang Du, Simon J. L. Billinge
In this article, we study algorithms for nonnegative matrix factorization (NMF) in various applications involving streaming data. Utilizing the continual nature of the data, we dev…