Related papers: A Semidefinite Approach for Truncated K-Moment Pro…
Let $K_f$ be a closed semi-algebraic set in $\dR^d$ such that there exist bounded real polynomials $h_1,{...},h_n$ on $K_f$. It is proved that the moment problem for $K_f$ is solvable provided it is for all sets $K_f\cap C_\lambda$, where…
Semidefinite programming (SDP) is a fundamental convex optimization problem with wide-ranging applications. However, solving large-scale instances remains computationally challenging due to the high cost of solving linear systems and…
The problem of minimizing the rank of a symmetric positive semidefinite matrix subject to constraints can be cast equivalently as a semidefinite program with complementarity constraints (SDCMPCC). The formulation requires two positive…
In this paper, we devote our interest to solving the real cubic truncated moment problem. We provide some results that allow to get a complete solution via a minimal representing measure. Some numerical examples are also presented to…
The Moment-SOS hierarchy initially introduced in optimization in 2000, is based on the theory of the K-moment problem and its dual counterpart, polynomials that are positive on K. It turns out that this methodology can be also applied to…
The semidefinite programming (SDP) relaxation has proven to be extremely strong for many hard discrete optimization problems. This is in particular true for the quadratic assignment problem (QAP), arguably one of the hardest NP-hard…
We extend \cite{chen2025srkbp} by analyzing the complexity of the $k$-block-positivity testing algorithm that stems from the optimization problem in Definition \ref{definition:SDP-k-block-positivity}. In this paper, we investigate a…
The problem of sparse approximation and the closely related compressed sensing have received tremendous attention in the past decade. Primarily studied from the viewpoint of applied harmonic analysis and signal processing, there have been…
Applying the method of moments to the chemical master equation (CME) appearing in stochastic chemical kinetics often leads to the so-called closure problem. Recently, several authors showed that this problem can be partially overcome using…
This paper introduces a new robust interior point method analysis for semidefinite programming (SDP). This new robust analysis can be combined with either logarithmic barrier or hybrid barrier. Under this new framework, we can improve the…
In this paper we study the truncated matrix trigonometric moment problem. We obtained a bijective parameterization of all solutions of this moment problem (both in nondegenerate and degenerate cases) via an operator approach. We use…
Let $\tau$ be a locally convex topology on the countable dimensional polynomial $\reals$-algebra $\rx:=\reals[X_1,...,X_n]$. Let $K$ be a closed subset of $\reals^n$, and let $M:=M_{\{g_1, ... g_s\}}$ be a finitely generated quadratic…
Compressed sensing is a technique for finding sparse solutions to underdetermined linear systems. This technique relies on properties of the sensing matrix such as the restricted isometry property. Sensing matrices that satisfy the…
Given a multi-index sequence $\mu_{\mathbf{k}}$, $\mathbf{k} = (k_1,..., k_n) \in \mathbb{N}_0^n$, necessary and sufficient conditions are given for the existence of a regular Borel polymeasure $\gamma$ on the unit interval $I= [0,1]$ such…
In this paper, we propose a new sequential quadratic semidefinite programming (SQSDP) method for solving degenerate nonlinear semidefinite programs (NSDPs), in which we produce iteration points by solving a sequence of stabilized quadratic…
We show that any submodular minimization (SM) problem defined on a linear constraint set with constraints having up to two variables per inequality, are 2-approximable in polynomial time. If the constraints are monotone (the two variables…
A new approach to solving a class of rankconstrained semi-definite programming (SDP) problems, which appear in many signal processing applications such as transmit beamspace design in multiple-input multiple-output (MIMO) radar, downlink…
This work presents a convex-optimization-based framework for analysis and control of nonlinear partial differential equations. The approach uses a particular weak embedding of the nonlinear PDE, resulting in a linear equation in the space…
Let $\beta \equiv\beta^{(2n)}$ be a real bivariate sequence of degree $2n$. We study the existence of representing measures for $\beta$ supported in the curve $y=x^{d}$ ($d\ge 1$) in the case when all column dependence relations in the…
The classical Truncated Moment problem asks for necessary and sufficient conditions so that a linear functional $L$ on $\mathcal{P}_{d}$, the vector space of real $n$-variable polynomials of degree at most $d$, can be written as integration…