English
Related papers

Related papers: On types of KKT points in polynomial optimization

200 papers

Let $V$ be a vector space over a finite field $k$. We give a condition on a subset $A \subset V$ that allows for a local criterion for checking when a function $f:A \to k$ is a restriction of a polynomial function of degree $<m$ on $V$. In…

Combinatorics · Mathematics 2018-12-05 David Kazhdan , Tamar Ziegler

We prove that if f is a self-map of an algebraic variety over a field K, then under certain conditions on X, f and K the set of possible periods of K-valued periodic points of f is finite.

Number Theory · Mathematics 2007-05-23 Najmuddin Fakhruddin

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…

Symbolic Computation · Computer Science 2016-05-10 Mohab Safey El Din , Pierre-Jean Spaenlehauer

Let f(z) be a rational function of degree at least 2 with coefficients in a number field K, and assume that the second iterate f^2(z) of f(z) is not a polynomial. The second author previously proved that for any b in K, the forward orbit…

Number Theory · Mathematics 2011-05-30 Liang-Chung Hsia , Joseph H. Silverman

The study of inner and cyclic functions in $\ell^p_A$ spaces requires a better understanding of the zeros of the so-called optimal polynomial approximants. We determine that a point of the complex plane is the zero of an optimal polynomial…

Complex Variables · Mathematics 2021-04-19 Raymond Cheng , William T. Ross , Daniel Seco

We present a formally verified global optimization framework. Given a semialgebraic or transcendental function $f$ and a compact semialgebraic domain $K$, we use the nonlinear maxplus template approximation algorithm to provide a certified…

Logic in Computer Science · Computer Science 2015-01-06 Victor Magron , Xavier Allamigeon , Stéphane Gaubert , Benjamin Werner

Given a polynomial $f$ and a semi-algebraic set $S$, we provide a symbolic algorithm to find the equations and inequalities defining a semi-algebraic set $Q$ which is identical to the closure of the image of $S$ under $f$, i.e.,…

Algebraic Geometry · Mathematics 2022-10-26 Ngoc Hoang Anh Mai

Let $\K$ be a field of characteristic zero and $\Kbar$ be an algebraic closure of $\K$. Consider a sequence of polynomials$G=(g\_1,\dots,g\_s)$ in $\K[X\_1,\dots,X\_n]$, a polynomial matrix $\F=[f\_{i,j}] \in \K[X\_1,\dots,X\_n]^{p \times…

Symbolic Computation · Computer Science 2018-03-01 Jonathan D. Hauenstein , Mohab Safey El Din , Éric Schost , Thi Xuan Vu

We consider a special class of nonconvex semidefinite programming problems and show that every point satisfying the Karush--Kuhn--Tucker (KKT) conditions is globally optimal despite nonconvexity. This property is related to pseudoconvex…

Optimization and Control · Mathematics 2025-06-23 Akatsuki Nishioka , Yoshihiro Kanno

Let $R$ be a Dedekind ring, $K$ its quotient field, and $L=K(\alpha)$ a finite field extension of $K$ defined by a monic irreducible polynomial $f(x)\in R[x]$. We give an easy version of Dedekind's criterion which computationally improves…

Number Theory · Mathematics 2018-10-09 A. Deajim , L. El Fadil

Following our first article, we continue to investigate ultrametic modules over a ring of twisted polynomials of the form $[K;\vfi]$, where $\vfi$ is a ring endomorphism of $K$. The main motivation comes from the the theory of valued…

Logic · Mathematics 2019-04-25 Gönenç Onay

Let $S=K[x_1,...,x_n]$ or $S=K[[x_1,...,x_n]]$ be either a polynomial or a formal power series ring in a finite number of variables over a field $K$ of characteristic $p > 0$ with $[K:K^p] < \infty$. Let $R$ be the hypersurface $S/fS$ where…

Commutative Algebra · Mathematics 2018-04-23 Khaled Alhazmy

We consider the problem of certifying an inequality of the form $f(x)\geq 0$, $\forall x\in K$, where $f$ is a multivariate transcendental function, and $K$ is a compact semialgebraic set. We introduce a certification method, combining…

Optimization and Control · Mathematics 2013-07-29 Xavier Allamigeon , Stéphane Gaubert , Victor Magron , Benjamin Werner

We study a cardinality-constrained optimization problem with nonnegative variables in this paper. This problem is often encountered in practice. Firstly we study some properties on the optimal solutions of this optimization problem under…

Optimization and Control · Mathematics 2019-06-04 Zhongyi Jiang , Baiyi Wu , Qiying Hu

Let K be a field and let S = K[x_1, ..., x_n] be a polynomial ring. Consider a homogenous ideal I in S. Let t_i denote reg(Tor_i (S/I, K)), the maximal degree of an ith syzygy of S/I. We prove bounds on the numbers t_i for i > n/2 purely in…

Commutative Algebra · Mathematics 2011-12-02 Jason McCullough

Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring over the field $K$, and let $I\subset S$ be a graded ideal. It is shown that the higher iterated Hilbert coefficients of the graded $S$-modules $\Tor_i^S(M,I^k)$ and $\Ext^i_S(M,I^k)$ are…

Commutative Algebra · Mathematics 2016-10-11 Seyed Shahab Arkian

Let $k[x]_{(x)}$ be the polynomial ring $k[x]$ localized in the maximal ideal $(x)\subseteq k[x]$. We study the Hilbert functor parameterizing ideals of colength $n$ in this ring {\it having support at the origin}. The main result of this…

Algebraic Geometry · Mathematics 2007-05-23 Roy M. Skjelnes

We prove a fast computable criterion that expresses non-flatness in terms of torsion: Let R be a regular algebra of finite type over a field K of characteristic zero and let F be a module finitely generated over an R-algebra of finite type.…

Commutative Algebra · Mathematics 2017-09-29 Janusz Adamus , Hadi Seyedinejad

The goal of this paper is to study operators of the form, \[ Tf(x)= \psi(x)\int f(\gamma_t(x))K(t)\: dt, \] where $\gamma$ is a real analytic function defined on a neighborhood of the origin in $(t,x)\in \R^N\times \R^n$, satisfying…

Classical Analysis and ODEs · Mathematics 2011-05-24 Elias M. Stein , Brian Street

In this article we provide an experimental algorithm that in many cases gives us an upper bound of the global infimum of a real polynomial on $\R^{n}$. It is very well known that to find the global infimum of a real polynomial on $\R^{n}$,…

Optimization and Control · Mathematics 2018-09-25 María López Quijorna