activity
20192026
most citedAlgorithm for distance list extraction from pair distribution functions

11 citations · 23 across the 15 of their papers we have counts for

collaborators

16 papers

math.OC2026

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…

math.NA2026

Semi-discrete quadratic Wasserstein energy and state-dependent Langevin exploration

Ran Gu, Gaoyue Guo, Kelvin Shuangjian Zhang

We study the semi-discrete quadratic Wasserstein energy. The energy is nonsmooth at collisions of sites. We prove local Lipschitz continuity on the full configuration space, togeth…

math.OC2026

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…

math.OC2026

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…

math.OC2026

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…

cs.AI2026

Large Language Model for Discrete Optimization Problems: Evaluation and Step-by-step Reasoning

Tianhao Qian, Guilin Qi, Z. Y. Wu +3

This work investigated the capabilities of different models, including the Llama-3 series of models and CHATGPT, with different forms of expression in solving discrete optimization…

math.OC2025

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…

math.OC2025

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…

cs.LG2025

CbLDM: A Diffusion Model for recovering nanostructure from atomic pair distribution function

Jiarui Cao, Zhiyang Zhang, Heming Wang +4

The nanostructure inverse problem is an attractive problem that helps researchers to understand the relationship between the properties and the structure of nanomaterials. This stu…

math.NA2025

Convergence analysis of Wirtinger Flow for Poisson phase retrieval

Bing Gao, Ran Gu, Shigui Ma

This paper presents a rigorous theoretical convergence analysis of the Wirtinger Flow (WF) algorithm for Poisson phase retrieval, a fundamental problem in imaging applications. Unl…

math.OC2024

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…

cond-mat.mtrl-sci2023★ 3 cited

Stretched Non-negative Matrix Factorization

Ran Gu, Yevgeny Rakita, Ling Lan +9

An algorithm is described and tested that carries out a non negative matrix factorization (NMF) ignoring any stretching of the signal along the axis of the independent variable. Th…

math.OC2021

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…

math.OC2021★ 8 cited

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…

cond-mat.mtrl-sci2020★ 1 cited

Validation of non-negative matrix factorization for assessment of atomic pair-distribution function (PDF) data in a real-time streaming context

Chia-Hao Liu, Christopher J. Wright, Ran Gu +9

We validate the use of matrix factorization for the automatic identification of relevant components from atomic pair distribution function (PDF) data. We also present a newly devel…

cond-mat.mtrl-sci2019★ 11 cited

Algorithm for distance list extraction from pair distribution functions

Ran Gu, Soham Banerjee, Qiang Du +1

We present an algorithm to extract the distance list from atomic pair distribution functions (PDFs) in a highly automated way. The algorithm is constructed via curve fitting based…