11 papers · 1 filter
Sparse Copositive Polynomial Optimization
Suhan Zhong, Jinling Zhou, Jiawang Nie +1
This paper studies the copositive optimization problem whose objective is a sparse polynomial, with linear constraints over the nonnegative orthant. We propose sparse Moment-SOS re…
Max-Min Bilinear Completely Positive Programs: A Semidefinite Relaxation with Tightness Guarantees
Sarah Yini Gao, Xindong Tang, Yancheng Yuan
Max-min bilinear optimization models, where one agent maximizes and an adversary minimizes a common bilinear objective, serve as canonical saddle-point formulations in optimization…
Log-Polynomial Optimization
Jiyoung Choi, Jiawang Nie, Xindong Tang +1
We study an optimization problem in which the objective is given as a sum of logarithmic-polynomial functions. This formulation is motivated by statistical estimation principles su…
A Tight SDP Relaxation for the Cubic-Quartic Regularization Problem
Jinling Zhou, Xin Liu, Jiawang Nie +1
This paper studies how to compute global minimizers of the cubic-quartic regularization (CQR) problem \[ \min_{s \in \mathbb{R}^n} \quad f_0+g^Ts+\frac{1}{2}s^THs+\fracβ{6}\| s \|^…
Robust Completion for Rank-1 Tensors with Noises
Jiawang Nie, Xindong Tang, Jinling Zhou
This paper studies the rank-1 tensor completion problem for cubic tensors when there are noises for observed tensor entries. First, we propose a robust biquadratic optimization mod…
Sparse Polynomial Optimization with Matrix Constraints
Jiawang Nie, Zheng Qu, Xindong Tang +1
This paper studies the hierarchy of sparse matrix Moment-SOS relaxations for solving sparse polynomial optimization problems with matrix constraints. First, we prove a sufficient a…