2 citations · 2 across the 6 of their papers we have counts for
6 papers
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…
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…
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…
Distributionally Robust Optimization with Moment Ambiguity Sets
Jiawang Nie, Liu Yang, Suhan Zhong +1
This paper studies distributionally robust optimization (DRO) when the ambiguity set is given by moments for the distributions. The objective and constraints are given by polynomia…
The Saddle Point Problem of Polynomials
Jiawang Nie, Zi Yang, Guangming Zhou
This paper studies the saddle point problem of polynomials. We give an algorithm for computing saddle points. It is based on solving Lasserre's hierarchy of semidefinite relaxation…
Minimizing Rational Functions by Exact Jacobian SDP Relaxation Applicable to Finite Singularities
Feng Guo, Li Wang, Guangming Zhou
This paper considers the optimization problem of minimizing a rational function. We reformulate this problem as polynomial optimization by the technique of homogenization. These tw…