3 papers
math.OC2025
A Generating Polynomial Based Two-Stage Optimization Method for Tensor Rank Decomposition
Zequn Zheng, Hongchao Zhang, Guangming Zhou
The tensor rank decomposition, also known as canonical polyadic(CP) or simply tensor decomposition, has a long history in multilinear algebra. However, computing a rank decompositi…
math.OC2024
The Rank-1 Completion Problem for Cubic Tensors
Jinling Zhou, Jiawang Nie, Zheng Peng +1
This paper studies the rank- tensor completion problem for cubic tensors. First of all, we show that this problem is equivalent to a special rank- matrix recovery problem. Wh…
math.OC2024
Robust approximation of chance constrained optimization with polynomial perturbation
Bo Rao, Liu Yang, Suhan Zhong +1
This paper proposes a robust approximation method for solving chance constrained optimization (CCO) of polynomials. Assume the CCO is defined with an individual chance constraint t…