English
Related papers

Related papers: Finite interpolation with minimum uniform norm in …

200 papers

The {\em line sum optimization problem} asks for a $(0,1)$-matrix minimizing the sum of given functions evaluated at its row and column sums. We show that the {\em uniform} problem, with identical row functions and identical column…

Optimization and Control · Mathematics 2021-04-28 Martin Koutecky , Shmuel Onn

It is by now well-known that one can recover a potential in the wave equation from the knowledge of the initial waves, the boundary data and the flux on a part of the boundary satisfying the Gamma-conditions of J.-L. Lions. We are…

Analysis of PDEs · Mathematics 2011-10-21 Lucie Baudouin , Sylvain Ervedoza

This paper provides universal, optimal moduli of continuity for viscosity solutions to fully nonlinear elliptic equations $F(X, D^2u) = f(X)$, based on weakest integrability properties of $f$ in different scenarios. The primary result…

Analysis of PDEs · Mathematics 2011-12-15 Eduardo V. Teixeira

We show that the unit ball of a full Hilbert $C^*$-module is sequentially compact in a certain weak topology if and only if the underlying $C^*$-algebra is finite dimensional. This provides an answer to the question posed in J.…

Operator Algebras · Mathematics 2010-05-31 Lj. Arambasic , D. Bakic , M. S. Moslehian

Superposition is an established decision procedure for a variety of first-order logic theories represented by sets of clauses. A satisfiable theory, saturated by superposition, implicitly defines a minimal term-generated model for the…

Artificial Intelligence · Computer Science 2009-11-30 Matthias Horbach , Christoph Weidenbach

We develop an interpolation-based modeling framework for parameter-dependent partial differential equations arising in control, inverse problems, and uncertainty quantification. The solution is discretized in the physical domain using…

Numerical Analysis · Mathematics 2026-04-20 Erik Burman , Mats G. Larson , Karl Larsson , Jonatan Vallin

We say that a subset of C^n is hypoconvex if its complement is the union of complex hyperplanes. Let D be the closed unit disk in C, T the unit circle. We prove two conjectures of Helton and Marshall. (See ``Frequency domain design and…

Complex Variables · Mathematics 2007-05-23 Marshall A. Whittlesey

We consider mesh functions which are discrete convex in the sense that their central second order directional derivatives are positive. Analogous to the case of a uniformly bounded sequence of convex functions, we prove that the uniform…

Numerical Analysis · Mathematics 2019-11-01 Gerard Awanou

Given a finite set $\sigma$ of the unit disc $\mathbb{D}$ and a holomorphic function $f$ in $\mathbb{D}$ which belongs to a class $X$ we are looking for a function $g$ in another class $Y$ which minimizes the norm $|g|_{Y}$ among all…

Functional Analysis · Mathematics 2010-11-04 Rachid Zarouf

Discretization of the uniform norm of functions from a given finite dimensional subspace of continuous functions is studied. We pay special attention to the case of trigonometric polynomials with frequencies from an arbitrary finite set…

Numerical Analysis · Mathematics 2021-12-14 Boris Kashin , Sergei Konyagin , Vladimir Temlyakov

We consider the Lam\'e system of linear elasticity when the inclusion has the extreme elastic constants. We show that the solutions to the Lam\'e system converge in appropriate $H^1$-norms when the shear modulus tends to infinity (the other…

Analysis of PDEs · Mathematics 2013-01-01 Habib Ammari , Hyeonbae Kang , Kyoungsun Kim , Hyundae Lee

We study the problem of ranking with submodular valuations. An instance of this problem consists of a ground set $[m]$, and a collection of $n$ monotone submodular set functions $f^1, \ldots, f^n$, where each $f^i: 2^{[m]} \to R_+$. An…

Data Structures and Algorithms · Computer Science 2010-07-16 Yossi Azar , Iftah Gamzu

We propose a first-order augmented Lagrangian algorithm (FALC) to solve the composite norm minimization problem min |sigma(F(X)-G)|_alpha + |C(X)- d|_beta subject to A(X)-b in Q; where sigma(X) denotes the vector of singular values of X,…

Optimization and Control · Mathematics 2012-08-07 Necdet Serhat Aybat , Garud Iyengar

The paper studies a general norm minimization problem on a product of normed vector spaces. We establish dual necessary and sufficient optimality conditions and derive explicit formulas for the corresponding solution sets. These formulas…

Optimization and Control · Mathematics 2026-01-14 Nguyen Duy Cuong

Tsirelson's norm $\|\cdot \|_T$ on $c_{00}$ is defined as the supremum over a certain collection of iteratively defined, monotone increasing norms $\|\cdot \|_k$. For each positive integer $n$, the value $j(n)$ is the least integer $k$ such…

Functional Analysis · Mathematics 2023-06-21 Kevin Beanland , Jędrzej Hodor

We consider a continuous function $f$ on a domain in $\mathbf C^n$ satisfying the inequality that $|\bar \partial f|\leq |f|$ off its zero set. The main conclusion is that the zero set of $f$ is a complex variety. We also obtain removable…

Complex Variables · Mathematics 2007-08-14 Xianghong Gong , Jean-Pierre Rosay

We introduce a notion of a uniform structure on the set of all representations of a given separable, not necessarilly commutative $C^*$-algebra $\mathfrak{A}$ by introducing a suitable family of metrics on the set of representations of…

Operator Algebras · Mathematics 2018-05-17 Adam Wegert

We study the supervised clustering problem under the two-component anisotropic Gaussian mixture model in high dimensions and in the non-asymptotic setting. We first derive a lower and a matching upper bound for the minimax risk of…

Statistics Theory · Mathematics 2021-11-16 Stanislav Minsker , Mohamed Ndaoud , Yiqiu Shen

We derive necessary density conditions for sampling and for interpolation in general reproducing kernel Hilbert spaces satisfying some natural conditions on the geometry of the space and the reproducing kernel. If the volume of shells is…

Functional Analysis · Mathematics 2018-04-03 Hartmut Führ , Karlheinz Gröchenig , Antti Haimi , Andreas Klotz , José Luis Romero

In submodular covering problems, we are given a monotone, nonnegative submodular function $f: 2^N \rightarrow\mathbb{R}_+$ and wish to find the min-cost set $S\subseteq N$ such that $f(S)=f(N)$. This captures SetCover when $f$ is a coverage…

Data Structures and Algorithms · Computer Science 2025-10-13 Anupam Gupta , Roie Levin