相关论文: Linear Matrix Inequality Representation of Sets
We consider a continuous time linear multi inventory system with unknown demands bounded within ellipsoids and controls bounded within ellipsoids or polytopes. We address the problem of "-stabilizing the inventory since this implies some…
Robust matrix completion (RMC) is a widely used machine learning tool that simultaneously tackles two critical issues in low-rank data analysis: missing data entries and extreme outliers. This paper proposes a novel scalable and learnable…
We consider the class of nonlinear optimal control problems (OCP) with polynomial data, i.e., the differential equation, state and control con- straints and cost are all described by polynomials, and more generally for OCPs with smooth…
The aim in packing problems is to decide if a given set of pieces can be placed inside a given container. A packing problem is defined by the types of pieces and containers to be handled, and the motions that are allowed to move the pieces.…
Convex analysis is a modern branch of mathematics with many applications. As Large Language Models (LLMs) start to automate research-level math and sciences, it is important for LLMs to demonstrate the ability to understand and reason with…
We consider matrix Riccati inequality arising in the theory of absolute stability, $H_\infty$ control problem, $LQ$ problem, and optimal estimation problem. In the case of sign definite frequency domain function, the solvability of Riccati…
Various control schemes rely on a solution of a convex optimization problem involving a particular robust quadratic constraint, which can be reformulated as a linear matrix inequality using the well-known $\mathcal{S}$-lemma. However, the…
Detecting hidden convexity is one of the tools to address nonconvex minimization problems. After giving a formal definition of hidden convexity, we introduce the notion of conditional infimum, as it will prove instrumental in detecting…
In this paper, we mainly study metric subregularity for a convex constraint system defined by a convex set-valued mapping and a convex constraint subset. The main work is to provide several primal equivalent conditions for metric…
A popular approach for addressing uncertainty in variational inequality problems is by solving the expected residual minimization (ERM) problem. This avenue necessitates distributional information associated with the uncertainty and…
The prescribed Ricci curvature problem consists in finding a Riemannian metric $g$ on a manifold $M$ such that the Ricci curvature of $g$ equals a given $(0,2)$-tensor field $T$. We survey the recent progress on this problem in the case…
The main result of this paper states that for any group $G$ with an automatic structure $L$ with unique representatives one can construct a uniform partial algorithm which detects $L$-rational subgroups and gives their preimages in $L$.…
We consider the completeness problem for left-invariant Lorentzian metrics on 3-dimensional non-unimodular Lie groups, all of which have Lie algebra of the form $\mathbb{R} \ltimes_A \mathbb{R}^2$, where $A$ is a real $2 \times 2$ matrix…
Linear interpolation convexity (LIC) has served as the crucial condition for the uniqueness of interaction energy minimizers. We introduce the concept of the LIC radius which extends the LIC condition. Uniqueness of minimizer up to…
Perspective distortion (PD) leads to substantial alterations in the shape, size, orientation, angles, and spatial relationships of visual elements in images. Accurately determining camera intrinsic and extrinsic parameters is challenging,…
Many problems of systems control theory boil down to solving polynomial equations, polynomial inequalities or polyomial differential equations. Recent advances in convex optimization and real algebraic geometry can be combined to generate…
We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at random from a matrix M. Can we complete the matrix and recover…
The illumination conjecture is a classical open problem in convex and discrete geometry, asserting that every compact convex body~$K$ in $\mathbb R^n$ can be illuminated by a set of no more than $2^n$ points. If $K$ has smooth boundary, it…
In this paper, we advocate the adoption of metric preservation as a powerful prior for learning latent representations of deformable 3D shapes. Key to our construction is the introduction of a geometric distortion criterion, defined…
Linear matrix inequalities (LMIs) $I_d + \sum_{j=1}^g A_jx_j + \sum_{j=1}^g A_j^*x_j^*\succeq0$ play a role in many areas of applications and the set of solutions to one is called a spectrahedron. LMIs in (dimension--free) matrix variables…