Related papers: The degree of the central curve in semidefinite, l…
Let V $\subset$ C n be an equidimensional algebraic set and g be an n-variate polynomial with rational coefficients. Computing the critical points of the map that evaluates g at the points of V is a cornerstone of several algorithms in real…
We propose new estimates for the frontier of a set of points. They are defined as kernel estimates covering all the points and whose associated support is of smallest surface. The estimates are written as linear combinatio- ns of kernel…
We consider the finiteness problem for central configurations of the $n-$body problem. We prove that, for $n\geq4$, there exists a (Zariski) closed subset $B$ in the mass space $\mathbb{R}^{n}$, such that if $(m_1,...,m_n) \in…
Semidefinite programs (SDPs) are standard convex problems that are frequently found in control and optimization applications. Interior-point methods can solve SDPs in polynomial time up to arbitrary accuracy, but scale poorly as the size of…
Contrary to previous approaches bringing together algebraic geometry and signatures of paths, we introduce a Zariski topology on the space of paths itself, and study path varieties consisting of all paths whose iterated-integrals signature…
The purpose of this paper is two-fold. We first prove a series of results, concerned with the notion of Zariski multiplicity, mainly for non-singular algebraic curves. These results are required in the paper "A Theory of Branches for…
The boundary of the convex hull of a compact algebraic curve in real 3-space defines a real algebraic surface. For general curves, that boundary surface is reducible, consisting of tritangent planes and a scroll of stationary bisecants. We…
We present an efficient, parallel, constrained optimization technique for approximating CAD curves with super-convergent rates. The optimization function is a disparity measure in terms of a piece-wise polynomial approximation and a curve…
An exact algorithm is presented for solving edge weighted graph partitioning problems. The algorithm is based on a branch and bound method applied to a continuous quadratic programming formulation of the problem. Lower bounds are obtained…
Let $K\subseteq{\mathbb R}^n$ be a convex semialgebraic set. The semidefinite extension degree ${\mathrm{sxdeg}}(K)$ of $K$ is the smallest number $d$ such that $K$ is a linear image of an intersection of finitely many spectrahedra, each of…
Semidefinite programs (SDPs) -- some of the most useful and versatile optimization problems of the last few decades -- are often pathological: the optimal values of the primal and dual problems may differ and may not be attained. Such SDPs…
We survey both old and new developments in the theory of algorithms in real algebraic geometry -- starting from effective quantifier elimination in the first order theory of reals due to Tarski and Seidenberg, to more recent algorithms for…
We study certain generic systems of real polynomial equations associated with triangulations of convex polytopes and investigate their number of real solutions. Our main focus is set on pairs of plane algebraic curves which form a so-called…
In this notes we study complex projective plane curves whose graded module of Jacobian syzygies is generated by its minimal degree component. Examples of such curves include the smooth curves as well as the maximal Tjurina curves. However,…
In this paper, we study randomized and cyclic coordinate descent for convex unconstrained optimization problems. We improve the known convergence rates in some cases by using the numerical semidefinite programming performance estimation…
A new algorithm for computing a point on a polynomial or rational curve in B\'{e}zier form is proposed. The method has a geometric interpretation and uses only convex combinations of control points. The new algorithm's computational…
We propose a branch-and-bound algorithm for minimizing a bilinear functional of the form \[ f(X,Y) = \mathrm{tr}((X\otimes Y)Q)+\mathrm{tr}(AX)+\mathrm{tr}(BY) , \] of pairs of Hermitian matrices $(X,Y)$ restricted by joint semidefinite…
We present new convergence analyses for parallel subspace correction methods for unconstrained semicoercive and nearly semicoercive convex optimization problems, generalizing the theory of singular and nearly singular linear problems to a…
The classical Severi degree counts the number of algebraic curves of fixed genus and class passing through points in a surface. We express the Severi degrees of CP1 x CP1 as matrix elements of the exponential of a single operator M on Fock…
Abstracting neural networks with constraints they impose on their inputs and outputs can be very useful in the analysis of neural network classifiers and to derive optimization-based algorithms for certification of stability and robustness…