Related papers: The Minimal Resultant Locus

We investigate fundamental properties of the proximal point algorithm for Lipschitz convex functions on (proper, geodesic) Gromov hyperbolic spaces. We show that the proximal point algorithm from an arbitrary initial point can find a point…

We introduce and study the notion of an outer bi-Lipschitz extension of a map between Euclidean spaces. The notion is a natural analogue of the notion of a Lipschitz extension of a Lipschitz map. We show that for every map $f$ there exists…

We propose a second-order method for unconditional minimization of functions $f(z)$ of complex arguments. We call it the Mixed Newton Method due to the use of the mixed Wirtinger derivative $\frac{\partial^2f}{\partial\bar z\partial z}$ for…

For a field $K$, and a root $\alpha$ of an irreducible polynomial over $K$ (in some algebraic closure) the number of roots of $f(x)$ lying in $K(\alpha)$ is studied here. Given such an $f(x)$ of degree $n$ for which $r$ of the roots are i n…

This paper studies a class of simple bilevel optimization problems where we minimize a composite convex function at the upper-level subject to a composite convex lower-level problem. Existing methods either provide asymptotic guarantees for…

An extension $K/k$ of analytic (i.e. real valued complete) fields is called small if it is topologically-algebraically generated by finitely many elements. We prove that this property is inherited by subextensions and hence topological…

Let L be a linear differential operator with coefficients in some differential field k of characteristic zero with algebraically closed field of constants. Let k^a be the algebraic closure of k. For a solution y, Ly=0, we determine the…

This paper investigates a category of constrained fractional optimization problems that emerge in various practical applications. The objective function for this category is characterized by the ratio of a numerator and denominator, both…

This paper develops an efficient algorithm for computing the Euclidean projection onto the top-k-sum constraint, a key operation in financial risk management and matrix optimization problems. Existing projection methods rely on sorting and…

We prove and apply an optimal low-rank approximation of the Cauchy kernel over separated real domains. A skeleton decomposition is the minimum over real-valued functions of the maximum relative pointwise error. We present an algorithm to…

In this experimental study we consider Steiner tree approximations that guarantee a constant approximation of ratio smaller than $2$. The considered greedy algorithms and approaches based on linear programming involve the incorporation of…

We provide an irreducibility test in the ring K[[x]][y] whose complexity is quasi-linear with respect to the discriminant valuation, assuming the input polynomial F square-free and K a perfect field of characteristic zero or greater than…

It is well known that limits can be computed by restricting along an initial functor, and that this often simplifies limit computation. We systematically study the algorithmic implications of this idea for diagrams indexed by a finite…

Finding a positive state-space realization with the minimum dimension for a given transfer function is an open problem in control theory. In this paper, we focus on positive realizations in Markov form and propose a linear programming…

Questions concerning small fractional parts of polynomials and pseudo-polynomials have a long history in analytic number theory. In this paper, we improve on earlier work by Madritsch and Tichy. In particular, let $f=P+\phi$ where $P$ is a…

In this paper, we establish a theorem on extension of Lipschitz maps $f$ definable in Hensel minimal fields $K$. This may be regarded as a definable, non-Archimedean, non-locally compact version of Kirszbraun's extension theorem. We proceed…

For the strictly positive case (the suboptimal case), given stable rational matrix functions $G$ and $K$, the set of all $H^\infty$ solutions $X$ to the Leech problem associated with $G$ and $K$, that is, $G(z)X(z)=K(z)$ and $\sup_{|z|\leq…

We present results about minimization of convex functionals defined over a finite set of vectors in a finite dimensional Hilbert space, that extend several known results for the Benedetto-Fickus frame potential. Our approach depends on…

The simplex algorithm for linear programming is based on the fact that any local optimum with respect to the polyhedral neighborhood is also a global optimum. We show that a similar result carries over to submodular maximization. In…

In this paper we present three different results dealing with the number of $(\leq k)$-facets of a set of points: 1. We give structural properties of sets in the plane that achieve the optimal lower bound $3\binom{k+2}{2}$ of $(\leq…