English
Related papers

Related papers: Unconstrained polarization (Chebyshev) problems: b…

200 papers

We investigate the asymptotic behavior of greedy $s$-Riesz and Green energy sequences $\{x_{n}\}_{n=1}^{\infty}$ on the unit sphere $\mathbb{S}^{d} \subset \mathbb{R}^{d+1}$, where each point $x_n$ is defined as the minimizer of the…

Classical Analysis and ODEs · Mathematics 2026-04-17 Dmitriy Bilyk , Liudmyla Kryvonos , Ryan W. Matzke , Edward Saff

We investigate minimum weak $\alpha$-Riesz energy problems with external fields in both the unconstrained and constrained settings for generalized condensers $(A_1,A_2)$ such that the closures of $A_1$ and $A_2$ in $\mathbb R^n$ are allowed…

Classical Analysis and ODEs · Mathematics 2018-10-19 Bent Fuglede , Natalia Zorii

With the dramatic growth in the number of application domains that generate probabilistic, noisy and uncertain data, there has been an increasing interest in designing algorithms for geometric or combinatorial optimization problems over…

Data Structures and Algorithms · Computer Science 2016-05-24 Lingxiao Huang , Jian Li , Jeff M. Phillips , Haitao Wang

This paper is concerned with volume-constrained minimization problems derived from Gamow's liquid drop model for the atomic nucleus, involving the competition of a perimeter term and repulsive nonlocal potentials. We consider a large class…

Analysis of PDEs · Mathematics 2021-05-04 Marc Pegon

In this paper, we develop a unified framework for studying constrained robust optimal control problems with adjustable uncertainty sets. In contrast to standard constrained robust optimal control problems with known uncertainty sets, we…

Optimization and Control · Mathematics 2016-06-09 Xiaojing Zhang , Maryam Kamgarpour , Angelos Georghiou , Paul Goulart , John Lygeros

We address the problem of the best uniform approximation by linear combinations of a finite system of functions. If the system is Chebyshev and the problem is unconstrained, then the classical Remez algorithm provides a fast and precise…

Numerical Analysis · Mathematics 2025-07-08 Vladimir Yu. Protasov , Rinat Kamalov

It has been shown that the maximum stable set problem in some infinite graphs, and the kissing number problem in particular, reduces to a minimization problem over the cone of copositive kernels. Optimizing over this infinite dimensional…

Optimization and Control · Mathematics 2018-12-04 Olga Kuryatnikova , Juan C. Vera

Let $(M^\circ, g)$ be an asymptotically conic manifold, in the sense that $M^\circ$ compactifies to a manifold with boundary $M$ in such a way that $g$ becomes a scattering metric on $M$. A special case of particular interest is that of…

Analysis of PDEs · Mathematics 2007-05-23 Colin Guillarmou , Andrew Hassell

The present paper is devoted to the study of the well-posedness issue for the density-dependent Euler equations in the whole space. We establish local-in-time results for the Cauchy problem pertaining to data in the Besov spaces embedded in…

Analysis of PDEs · Mathematics 2013-02-27 Raphaël Danchin

The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence…

Metric Geometry · Mathematics 2019-07-12 Gergely Ambrus

Derived from the concentration-compactness principle, the concept of generalized minimizer can be used to define generalized solutions of variational problems which may have components ``infinitely'' distant from each other. In this article…

Analysis of PDEs · Mathematics 2024-06-25 Jules Candau-Tilh

We demonstrate a set A and a value of s for which the sequence of N-point discrete minimal Riesz s-energy configurations on A does not have an asymptotic distribution in the weak-star sense as N tends to infinity.

Classical Analysis and ODEs · Mathematics 2011-09-21 Matthew T. Calef

We derive Adams inequalities for potentials on general measure spaces, extending and improving previous results obtained by the authors. The integral operators involved, which we call "Riesz subcritical", have kernels whose decreasing…

Analysis of PDEs · Mathematics 2019-09-17 Luigi Fontana , Carlo Morpurgo

We consider the Cauchy problem for the Zakharov-Kuznetsov equation in the cylinder. We improve the local wellposedness to spaces of regularity $s > 1/2$. The result is optimal in terms of the corresponding bilinear estimate or Picard…

Analysis of PDEs · Mathematics 2025-02-05 Gonzalo Cao-Labora

Given a metric space, the $(k,z)$-clustering problem consists of finding $k$ centers such that the sum of the of distances raised to the power $z$ of every point to its closest center is minimized. This encapsulates the famous $k$-median…

Data Structures and Algorithms · Computer Science 2022-08-01 Vincent Cohen-Addad , David Saulpic , Chris Schwiegelshohn

We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…

Metric Geometry · Mathematics 2022-11-10 Yihan Zhang , Shashank Vatedka

There are many ways to generate a set of nodes on the sphere for use in a variety of problems in numerical analysis. We present a survey of quickly generated point sets on $\mathbb{S}^2$, examine their equidistribution properties,…

Numerical Analysis · Mathematics 2016-10-25 D. P. Hardin , T. J. Michaels , E. B. Saff

We consider a constrained minimal energy problem with an external field over noncompact classes of infinite dimensional vector measures on a locally compact space. The components are positive measures (charges) that are constrained from…

Classical Analysis and ODEs · Mathematics 2010-10-12 Natalia Zorii

Parameterized complexity allows us to analyze the time complexity of problems with respect to a natural parameter depending on the problem. Reoptimization looks for solutions or approximations for problem instances when given solutions to…

Computational Complexity · Computer Science 2019-07-31 Hans-Joachim Böckenhauer , Elisabet Burjons , Martin Raszyk , Peter Rossmanith

Best approximation (BA) is an interesting field in functional analysis that has attracted a lot of attention from many researchers for a very long period of time up-to-date. Of greatest consideration is the characterization of the Chebyshev…

Functional Analysis · Mathematics 2023-02-07 Samson Owiti , Benard Okelo , Julia Owino
‹ Prev 1 3 4 5 6 7 10 Next ›