It is well known that by adding integrality constraints to the semidefinite programming (SDP)
relaxation of the max-cut problem, the resulting integer semidefinite program is an exact …

Low-rank matrix completion consists of computing a matrix of minimal complexity that
recovers a given set of observations as accurately as possible. Unfortunately, existing …

Non-contact, real-time measurement of conveyor belt speed is critical for energy-saving
speed regulation and efficient development of coal mine conveyor systems. Existing speed …

Bayesian Networks (BNs) represent conditional probability relations among a set of random
variables (nodes) in the form of a directed acyclic graph (DAG), and have found diverse …

This paper investigates convex quadratic optimization problems involving $ n $ indicator
variables, each associated with a continuous variable, particularly focusing on scenarios …

In many applications, when building linear regression models, it is important to account for
the presence of outliers, ie, corrupted input data points. Such problems can be formulated as …

Optimization problems involving minimization of a rank-one convex function over constraints
modeling restrictions on the support of the decision variables emerge in various machine …

We consider the nonconvex set S n={(x, X, z): X= xx T, x (1-z)= 0, x≥ 0, z∈{0, 1} n}, which is
closely related to the feasible region of several difficult nonconvex optimization problems …

We study a multi-period convex quadratic optimization problem, where the state evolves
dynamically as an affine function of the state, control, and indicator variables in each period …

In this paper, we study the mixed-integer nonlinear set given by a separable quadratic
constraint on continuous variables, where each continuous variable is controlled by an …