Related papers: The Minimal Resultant Locus

Block-coordinate algorithms are recognized to furnish efficient iterative schemes for addressing large-scale problems, especially when the computation of full derivatives entails substantial memory requirements and computational efforts. In…

The matrix completion problem consists of finding or approximating a low-rank matrix based on a few samples of this matrix. We propose a new algorithm for matrix completion that minimizes the least-square distance on the sampling set over…

We consider the inverse optimization problem associated with the polynomial program f^*=\min \{f(x): x\in K\}$ and a given current feasible solution $y\in K$. We provide a systematic numerical scheme to compute an inverse optimal solution.…

In this article, we develop a dynamical theory for what shall be called a skew product on the Berkovich projective line, $\phi_*: \mathbb{P}^1_{\text{an}}(K) \to \mathbb{P}^1_{\text{an}}(K)$ over a non-Archimedean field $K$. These functions…

Let $K$ be a number field, let $S$ be a finite set of places of $K$, and let $R_S$ be the ring of $S$-integers of $K$. A $K$-morphism $f:\mathbb{P}^1_K\to\mathbb{P}^1_K$ has simple good reduction outside $S$ if it extends to an…

We initiate the study of nonsmooth optimization problems under bounded local subgradient variation, which postulates bounded difference between (sub)gradients in small local regions around points, in either average or maximum sense. The…

This article focuses on numerical efficiency of projection algorithms for solving linear optimization problems. The theoretical foundation for this approach is provided by the basic result that bounded finite dimensional linear optimization…

Nonnegative matrix factorization is the following problem: given a nonnegative input matrix $V$ and a factorization rank $K$, compute two nonnegative matrices, $W$ with $K$ columns and $H$ with $K$ rows, such that $WH$ approximates $V$ as…

In this article, we present a greedy algorithm based on a tensor product decomposition, whose aim is to compute the global minimum of a strongly convex energy functional. We prove the convergence of our method provided that the gradient of…

Inspired by regularization techniques in statistics and machine learning, we study complementary composite minimization in the stochastic setting. This problem corresponds to the minimization of the sum of a (weakly) smooth function endowed…

For a graph $G$, the parameter treedepth measures the minimum depth among all forests $F$, called elimination forests, such that $G$ is a subgraph of the ancestor-descendant closure of $F$. We introduce a logic, called neighborhood operator…

We approach the Max-3-Cut problem through the lens of maximizing complex-valued quadratic forms and demonstrate that low-rank structure in the objective matrix can be exploited, leading to alternative algorithms to classical semidefinite…

We present algorithms for classifying rational polygons with fixed denominator and number of interior lattice points. Our approach is to first describe maximal polygons and then compute all subpolygons, where we eliminate redundancy by a…

In this paper, we investigate the problem of finding tight linear lower bounding functions for multivariate polynomials over boxes. These functions are obtained by the expansion of polynomials into Bernstein form and using the linear least…

Let A = S/J be a standard artinian graded algebra over the polynomial ring S. A theorem of Macaulay dictates the possible growth of the Hilbert function of A from any degree to the next, and if this growth is the maximal possible then…

Let $k$ be an algebraic closed field of characteristic zero. Let $K$ be the rational function field $K=k(t)$. Let $\phi$ be a non isotrivial rational function in $K(z)$. We prove a bound for the cardinality of the set of $K$--rational…

The inverse Galois problem is concerned with finding a Galois extension of a field $K$ with given Galois group. In this paper we consider the particular case where the base field is $K=\F_p(t)$. We give a conjectural formula for the minimal…

Let $K$ be a function field over an algebraically closed field $k$ of characteristic $0$, let $\varphi\in K(z)$ be a rational function of degree at least equal to $2$ for which there is no point at which $\varphi$ is totally ramified, and…

This paper provides characterizations of the weak solutions of optimization problems where a given vector function $F,$ from a decision space $X$ to an objective space $Y$, is "minimized" on the set of elements $x\in C$ (where $C\subset X$…

We present a sublinear query algorithm for outputting a near-optimal low-rank approximation to any positive semidefinite Toeplitz matrix $T \in \mathbb{R}^{d \times d}$. In particular, for any integer rank $k \leq d$ and $\epsilon,\delta >…