English
Related papers

Related papers: On types of KKT points in polynomial optimization

200 papers

Let $X\subset\mathbb{R}^n$ be a convex closed and semialgebraic set and let $f$ be a polynomial positive on $X$. We prove that there exists an exponent $N\geq 1$, such that for any $\xi\in\mathbb{R}^n$ the function…

Algebraic Geometry · Mathematics 2018-12-13 Krzysztof Kurdyka , Katarzyna Kuta , Stanisław Spodzieja

The best uniform polynomial approximation of the checkmark function $f(x)=|x-\alpha |$ is considered, as $\alpha$ varies in $(-1,1)$. For each fixed degree $n$, the minimax error $E_n (\alpha)$ is shown to be piecewise analytic in $\alpha$.…

Classical Analysis and ODEs · Mathematics 2022-01-19 Peter D. Dragnev , Alan R. Legg , Ramon Orive

For various Hilbert spaces of analytic functions on the unit disk, we characterize when a function $f$ has optimal polynomial approximants given by truncations of a single power series. We also introduce a generalized notion of optimal…

Functional Analysis · Mathematics 2023-07-11 Christopher Felder

We give error bounds which demonstrate optimal rates of convergence in the CLT for the total covered volume and the number of isolated shapes, for germ-grain models with fixed grain radius over a binomial point process of $n$ points in a…

Probability · Mathematics 2010-09-30 Larry Goldstein , Mathew D. Penrose

If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…

Number Theory · Mathematics 2024-09-16 Jose Felipe Voloch

The Schm\"udgen's Positivstellensatz gives a certificate to verify positivity of a strictly positive polynomial $f$ on a compact, basic, semi-algebraic set $\mathbf{K} \subset \mathbb{R}^n$. A Positivstellensatz of this type is called…

Optimization and Control · Mathematics 2024-12-19 Etienne de Klerk , Juan Vera Lizcano

In this article, we build on previous work to present an optimization algorithm for nonlinearly constrained multi-objective optimization problems. The algorithm combines a surrogate-assisted derivative-free trust-region approach with the…

Optimization and Control · Mathematics 2023-04-20 Manuel Berkemeier , Sebastian Peitz

For an arbitrary $q$-polynomial $f$ over $\mathbb{F}_{q^n}$ we study the problem of finding those $q$-polynomials $g$ over $\mathbb{F}_{q^n}$ for which the image sets of $f(x)/x$ and $g(x)/x$ coincide. For $n\leq 5$ we provide sufficient…

Combinatorics · Mathematics 2020-09-17 Bence Csajbók , Giuseppe Marino , Olga Polverino

We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an…

Optimization and Control · Mathematics 2017-01-03 Jesús A. De Loera , Raymond Hemmecke , Matthias Köppe , Robert Weismantel

In this paper we prove a single exponential upper bound on the number of possible homotopy types of the fibres of a Pfaffian map, in terms of the format of its graph. In particular we show that if a semi-algebraic set $S \subset…

Algebraic Geometry · Mathematics 2011-02-02 Saugata Basu , Nicolai Vorobjov

Let $\alpha(\mathbb{F}_q^{d},p)$ be the maximum possible size of a point set in general position in the $p$-random subset of $\mathbb{F}_q^d$. In this note, we determine the order of magnitude of $\alpha(\mathbb{F}_q^{3},p)$ up to a…

Combinatorics · Mathematics 2026-01-15 József Balogh , Haoran Luo

Let $K$ be a number field, ${\mathcal O}_K$ its ring of integers, and $f(x, y) \in {\mathcal O}_K[x, y]$ a binary form with integer coefficents. For any given prime $p \in {\mathcal O}_K$ we determine explicitly a binary form $g$ (resp.…

Number Theory · Mathematics 2021-11-10 Elira Curri

We first show that a continuous function f is nonnegative on a closed set $K\subseteq R^n$ if and only if (countably many) moment matrices of some signed measure $d\nu =fd\mu$ with support equal to K, are all positive semidefinite (if $K$…

Optimization and Control · Mathematics 2011-05-13 Jean B. Lasserre

Let G=Aut_K (K(x)) be the Galois group of the transcendental degree one pure field extension K(x)/K. In this paper we describe polynomial time algorithms for computing the field Fix(H) fixed by a subgroup H < G and for computing the fixing…

Symbolic Computation · Computer Science 2009-04-19 Jaime Gutierrez , Rosario Rubio , David Sevilla

We introduce a new approach to isolate the real roots of a square-free polynomial $F=\sum_{i=0}^n A_i x^i$ with real coefficients. It is assumed that each coefficient of $F$ can be approximated to any specified error bound. The presented…

Data Structures and Algorithms · Computer Science 2015-03-17 Michael Sagraloff

Fixed a continuous kernel K on the $d$-dimensional torus, we consider a generalization of the univariate $sk$-spline to the torus, associated with the kernel K. It is proved an estimate which provides the rate of convergence of a given…

Functional Analysis · Mathematics 2018-04-10 Juliana Gaiba Oliveira , Sergio Antonio Tozoni

We study the problem of \emph{robust satisfiability} of systems of nonlinear equations, namely, whether for a given continuous function $f:\,K\to\mathbb{R}^n$ on a~finite simplicial complex $K$ and $\alpha>0$, it holds that each function…

Computational Complexity · Computer Science 2014-02-05 Peter Franek , Marek Krcal

It is a theorem of Ribet that an abelian variety defined over a number field $K$ has only finitely many torsion points with values in the maximal cyclotomic extension field $K^{\mathrm{cyc}}$ of $K$. Recently, R\"ossler and Szamuely…

Number Theory · Mathematics 2025-01-22 Takahiro Murotani , Yoshiyasu Ozeki

We study the properties of sets $\Sigma$ which are the solutions of the maximal distance minimizer problem, i.e. of sets having the minimal length (one-dimensional Hausdorff measure) over the class of closed connected sets $\Sigma \subset…

Metric Geometry · Mathematics 2023-10-27 Alexey Gordeev , Yana Teplitskaya

We provide conditions ensuring that the KKT-type conditions characterizes the global optimality for quadratically constrained (possibly nonconvex) quadratic programming QCQP problems in Hilbert spaces. The key property is the convexity of a…

Optimization and Control · Mathematics 2023-02-15 Ewa M. Bednarczuk , Giovanni Bruccola