Related papers: The degree of the central curve in semidefinite, l…

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…

Semialgebraic splines are functions that are piecewise polynomial with respect to a cell decomposition into sets defined by polynomial inequalities. We study bivariate semialgebraic splines, formulating spaces of semialgebraic splines in…

One of the main applications of semidefinite programming lies in linear systems and control theory. Many problems in this subject, certainly the textbook classics, have matrices as variables, and the formulas naturally contain…

The degree centrality of a node, defined as the number of nodes adjacent to it, is often used as a measure of importance of a node to the structure of a network. This metric can be extended to paths in a network, where the degree centrality…

We disprove a continuous analogue of the Hirsch conjecture proposed by Deza, Terlaky and Zinchenko, by constructing a family of linear programs with $3r+4$ inequalities in dimension $2r+2$ where the central path has a total curvature in…

Computing the real solutions to a system of polynomial equations is a challenging problem, particularly verifying that all solutions have been computed. We describe an approach that combines numerical algebraic geometry and sums of squares…

We show that a set of $n$ algebraic plane curves of constant maximum degree can be cut into $O(n^{3/2}\operatorname{polylog} n)$ Jordan arcs, so that each pair of arcs intersect at most once, i.e., they form a collection of pseudo-segments.…

It is known that point searching in basic semialgebraic sets and the search for globally minimal points in polynomial optimization tasks can be carried out using $(s\,d)^{O(n)}$ arithmetic operations, where $n$ and $s$ are the numbers of…

Let $\mathcal C$ be a real plane algebraic curve defined by the resultant of two polynomials (resp. by the discriminant of a polynomial). Geometrically such a curve is the projection of the intersection of the surfaces $P(x,y,z)=Q(x,y,z)=0$…

We survey recent generalizations and improvements of the linear programming method that involve semidefinite programming. A general framework using group representations and tools from graph theory is provided.

We identify a common scheme in several existing algorithms addressing computational problems on linear differential equations with polynomial coefficients. These algorithms reduce to computing a linear relation between vectors obtained as…

In this paper, we study a class of fractional semi-infinite polynomial programming (FSIPP) problems, in which the objective is a fraction of a convex polynomial and a concave polynomial, and the constraints consist of infinitely many convex…

We propose a new method for linear second-order cone programs. It is based on the sequential quadratic programming framework for nonlinear programming. In contrast to interior point methods, it can capitalize on the warm-start capabilities…

In algebraic geometry there is a well-known categorical equivalence between the category of normal proper integral curves over a field $k$ and the category of finitely generated field extensions of $k$ of transcendence degree $1$. In this…

We introduce a generic technique to obtain linear relaxations of semidefinite programs with provable guarantees based on the commutativity of the constraint and the objective matrices. We study conditions under which the optimal value of…

Biclustering, also called co-clustering, block clustering, or two-way clustering, involves the simultaneous clustering of both the rows and columns of a data matrix into distinct groups, such that the rows and columns within a group display…

Curve singularities are classical objects of study in algebraic geometry. The key player in their combinatorial structure is the {\it value semigroup}, or its compactification, the {\it value semiring}. One natural problem is to explicitly…

A closed subscheme of codimension two $T \subset P^2$ is a quasi complete intersection (q.c.i.) of type $(a,b,c)$ if there exists a surjective morphism $\mathcal{O} (-a) \oplus \mathcal{O} (-b) \oplus \mathcal{O} (-c) \to \mathcal{I} _T$.…

We develop a new interior-point method (IPM) for symmetric-cone optimization, a common generalization of linear, second-order-cone, and semidefinite programming. In contrast to classical IPMs, we update iterates with a geodesic of the cone…

We study a class of quadratically constrained quadratic programs (QCQPs), called {\em diagonal QCQPs\/}, which contain no off-diagonal terms $x_j x_k$ for $j \ne k$, and we provide a sufficient condition on the problem data guaranteeing…