activity
20162026
collaborators

10 papers

math.CO2026

A Twelve-Row Seed and a One-Row Extension for Five-Column Recursive-Line Zarankiewicz Numbers

Min Xi, Jingya Chang

We prove that the five-column recursive-line Zarankiewicz number satisfies for every integer . The proof is based on an explicit seed config…

math.OC2023

A gradient projection method for semi-supervised hypergraph clustering problems

Jingya Chang, Dongdong Liu, Min Xi

Semi-supervised clustering problems focus on clustering data with labels. In this paper,we consider the semi-supervised hypergraph problems. We use the hypergraph related tensor to…

math.OC2023

Multi-Linear Pseudo-PageRank for Hypergraph Partitioning

Yannan Chen, Wen Li, Jingya Chang

Motivated by the PageRank model for graph partitioning, we develop an extension of PageRank for partitioning uniform hypergraphs. Starting from adjacency tensors of uniform hypergr…

math.OC2023

Hyperspectral super-resolution via low rank tensor triple decomposition

Xiaofei Cui, Jingya Chang

Hyperspectral image (HSI) and multispectral image (MSI) fusion aims at producing a super-resolution image (SRI). In this paper, we establish a nonconvex optimization model for imag…

math.OC2023

Weighted structure tensor total variation for image denoising

Xiuhan Sheng, Lijuan Yang, Jingya Chang

For image denoising problems, the structure tensor total variation (STV)-based models show good performances when compared with other competing regularization approaches. However,…

math.OC2023

A tensor optimization algorithm for computing Lagrangians of hypergraphs

Jingya Chang, Bin Xiao, Xin Zhang

The Lagrangian of a hypergraph is a crucial tool for studying hypergraph extremal problems. Though Lagrangians of some special structure hypergraphs have closed-form solutions, it…

math.OC2023

An adaptive weighted self-representation method for incomplete multi-view clustering

Lishan Feng, Guoxu Zhou, Jingya Chang

For multi-view data in reality, part of its elements may be missing because of human or machine error. Incomplete multi-view clustering (IMC) clusters the incomplete multi-view dat…

math.OC2022

An adaptive cubic regularization method for computing extreme eigenvalues of tensors

Jingya Chang, Zhi zhu

In this paper, we compute the H- and Z-eigenvalues of even order symmetric tensors by using the adaptive cubic regularization algorithm.

math.CO2017

Computing the -Spectral Radii of Uniform Hypergraphs with Applications

Jingya Chang, Weiyang Ding, Liqun Qi +1

The -spectral radius of a uniform hypergraph covers many important concepts, such as Lagrangian and spectral radius of the hypergraph, and is crucial for solving spectral extrem…

math.CO2016

Computing Eigenvalues of Large Scale Sparse Tensors Arising from a Hypergraph

Jingya Chang, Yannan Chen, Liqun Qi

The spectral theory of higher-order symmetric tensors is an important tool to reveal some important properties of a hypergraph via its adjacency tensor, Laplacian tensor, and signl…