English
Related papers

Related papers: Unit balls of constant volume: which one has optim…

200 papers

We address the following generalization $P$ of the Lowner-John ellipsoid problem. Given a (non necessarily convex) compact set $K\subset R^n$ and an even integer $d$, find an homogeneous polynomial $g$ of degree $d$ such that $K\subset…

Optimization and Control · Mathematics 2014-12-24 Jean-Bernard Lasserre

In this paper, we establish hardness and approximation results for various $L_p$-ball constrained homogeneous polynomial optimization problems, where $p \in [2,\infty]$. Specifically, we prove that for any given $d \ge 3$ and $p \in…

Optimization and Control · Mathematics 2012-11-01 Ke Hou , Anthony Man-Cho So

Lasserre [La] proved that for every compact set $K\subset\mathbb R^n$ and every even number $d$ there exists a unique homogeneous polynomial $g_0$ of degree $d$ with $K\subset G_1(g_0)=\{x\in\mathbb R^n:g_0(x)\leq 1\}$ minimizing $|G_1(g)|$…

Functional Analysis · Mathematics 2021-07-26 David Alonso-Gutiérrez , Bernardo González Merino , Rafael Villa

We establish that the optimal bound for the size of the smallest integral solution of the Oppenheim Diophantine approximation problem $\abs{Q(x)-\xi}< \epsilon$ for a generic ternary form $Q$ is $\abs{x}\ll \epsilon^{-1}$. We also establish…

Number Theory · Mathematics 2018-01-04 Anish Ghosh , Alexander Gorodnik , Amos Nevo

We show that the Euclidean ball has the smallest volume among sublevel sets of nonnegative forms of bounded Bombieri norm as well as among sublevel sets of sum of squares forms whose Gram matrix has bounded Frobenius or nuclear (or, more…

Optimization and Control · Mathematics 2020-07-28 Khazhgali Kozhasov , Jean-Bernard Lasserre

Consider the sub level set K := {x : g(x) $\le$ 1} where g is a positive and homogeneous polynomial. We show that its Lebesgue volume can be approximated as closely as desired by solving a sequence of generalized eigenvalue problems with…

Optimization and Control · Mathematics 2018-10-25 Jean Lasserre

Motivated by recent work on optimal approximation by polynomials in the unit disk, we consider the following noncommutative approximation problem: for a polynomial $f$ in $d$ freely noncommuting arguments, find a free polynomial $p_n$, of…

Functional Analysis · Mathematics 2022-09-22 Palak Arora , Meric Augat , Michael Jury , Meredith Sargent

In this article, we consider the problems of finding in $d+1$ dimensions a minimum-volume axis-parallel box, a minimum-volume arbitrarily-oriented box and a minimum-volume convex body into which a given set of $d$-dimensional unit-radius…

Computational Geometry · Computer Science 2025-09-30 Helmut Alt , Sergio Cabello , Otfried Cheong , Ji-won Park , Nadja Seiferth

In this note, we first try to prove a uniform lower bound of nodal volume in elliptic homogenization setting. This lower bound is far from optimal. But, we can prove a constant lower bound in dimension two. Motivated by the proof, we extend…

Analysis of PDEs · Mathematics 2025-12-23 Jiahuan Li , Zhichen Ying

We consider the problem of finding a best uniform approximation to the standard monomial on the unit ball in $\bbC^2$ by polynomials of lower degree with complex coefficients. We reduce the problem to a one-dimensional weighted minimization…

Classical Analysis and ODEs · Mathematics 2010-02-11 I. Moale , P. Yuditskii

A great variety of fundamental optimization and counting problems arising in computer science, mathematics and physics can be reduced to one of the following computational tasks involving polynomials and set systems: given an $m$-variate…

Data Structures and Algorithms · Computer Science 2016-11-15 Damian Straszak , Nisheeth K. Vishnoi

We consider the volume of a Boolean expression of some congruent balls about a given system of centers in the $d$-dimensional Euclidean space. When the radius $r$ of the balls is large, this volume can be approximated by a polynomial of…

Metric Geometry · Mathematics 2017-12-22 Balázs Csikós

Let $f,g_1,\dots,g_m$ be polynomials with real coefficients in a vector of variables $x=(x_1,\dots,x_n)$. Denote by $\text{diag}(g)$ the diagonal matrix with coefficients $g=(g_1,\dots,g_m)$ and denote by $\nabla g$ the Jacobian of $g$. Let…

Optimization and Control · Mathematics 2023-01-24 Ngoc Hoang Anh Mai

In this paper, exact rate of decrease of best approximations of non-integer numbers by polynomials with integer coefficients of the growing exponentials is found on a disk in complex plane, on a cube in $\mathbb{R}^d$, and on a ball in…

Classical Analysis and ODEs · Mathematics 2020-01-01 R. M. Trigub

This work studies the problem of maximizing a higher degree real homogeneous multivariate polynomial over the unit sphere. This problem is equivalent to finding the leading eigenvalue of the associated symmetric tensor of higher order,…

Optimization and Control · Mathematics 2019-10-02 Yuning Yang , Guoyin Li

We begin with the observation, based on previous results, that dimension-free lower bounds on the variance of a polynomial under a log-concave measure yield dimension-free small-ball and Fourier decay estimates. Motivated by this, we…

Probability · Mathematics 2026-03-25 Itay Glazer , Dan Mikulincer

We study a family of polytopes and their duals, that appear in various optimization problems as the unit balls for certain norms. These two families interpolate between the hypercube, the unit ball for the $\infty$-norm, and its dual…

Metric Geometry · Mathematics 2022-04-14 Antoine Deza , Jean-Baptiste Hiriart-Urruty , Lionel Pournin

Whereas the norm of a vector measures amplitude (and is a 1-homogeneous function), sparsity is measured by the 0-homogeneous l0 pseudonorm, which counts the number of nonzero components. We propose a family of conjugacies suitable for the…

Optimization and Control · Mathematics 2021-06-01 Thomas Bittar , Jean-Philippe Chancelier , Michel de Lara

Motivated by problems of uncertainty propagation and robust estimation we are interested in computing a polynomial sublevel set of fixed degree and minimum volume that contains a given semialgebraic set K. At this level of generality this…

Optimization and Control · Mathematics 2012-10-12 Fabrizio Dabbene , Didier Henrion

We show that in any $d$-dimensional real normed space, unit balls can be packed with density at least \[\frac{(1-o(1))d\log d}{2^{d+1}},\] improving a result of Schmidt from 1958 by a logarithmic factor and generalizing the recent result of…

Metric Geometry · Mathematics 2025-04-23 Carl Schildkraut
‹ Prev 1 2 3 10 Next ›