中文
相关论文

相关论文: On the dimension of the set of minimal projections

200 篇论文

We show that the minimum distance projection in the L1-norm from an interior point onto the boundary of a convex set is achieved by a single, unidimensional projection. Application of this characterization when the convex set is a…

最优化与控制 · 数学 2007-05-23 Hans J. H. Tuenter

The \emph{relative projection constant} $\lambda(Y, X)$ of normed spaces $Y \subset X$ is defined as $\lambda(Y, X) = \inf \{ ||P|| : P \in \mathcal{P}(X, Y) \}$, where $\mathcal{P}(X, Y)$ denotes the set of all continuous projections from…

泛函分析 · 数学 2019-02-20 Tomasz Kobos

Definition. A symmetric with respect to 0 bounded closed convex set A in a finite dimensional normed space X is called a sufficient enlargement for X (or of B(X)) if for arbitrary isometric embedding of X into a Banach space Y there exists…

泛函分析 · 数学 2007-05-23 M. I. Ostrovskii

Over the real or complex field, we establish a duality formula for projection constants of finite-codimensional subspaces of Banach spaces with the Daugavet property. If \[ Y=\bigcap_{j=1}^n \ker f_j \subset X, \qquad…

泛函分析 · 数学 2026-04-14 Tomasz Kania , Grzegorz Lewicki

Let $B_Y$ denote the unit ball of a normed linear space $Y$. A symmetric, bounded, closed, convex set $A$ in a finite dimensional normed linear space $X$ is called a {\it sufficient enlargement} for $X$ if, for an arbitrary isometric…

泛函分析 · 数学 2008-11-12 M. I. Ostrovskii

We study a property of $2$-strong uniqueness of a best approximation in a class of finite-dimensional complex normed spaces, for which the unit ball is an absolutely convex hull of finite number of points and in its dual class. We prove…

泛函分析 · 数学 2025-06-02 Tomasz Kobos , Grzegorz Lewicki

We prove that a region in a two-dimensional affine subspace of a normed space $V$ has the least 2-dimensional Hausdorff measure among all compact surfaces with the same boundary. Furthermore, the 2-dimensional Hausdorff area density admits…

度量几何 · 数学 2013-11-28 Dmitri Burago , Sergei Ivanov

In this work, we consider a class of convex optimization problems in a real Hilbert space that can be solved by performing a single projection, i.e., by projecting an infeasible point onto the feasible set. Our results improve those…

最优化与控制 · 数学 2024-04-10 Hoa T. Bui , Regina S. Burachik , Evgeni A. Nurminski , Matthew K. Tam

We prove that if X is any 2-regular projective scheme (in the sense of Castelnuovo-Mumford) then X is "small". This means that if L is a linear space and Y:= L\cap X is finite, then Y is "linearly independent" in the sense that the…

代数几何 · 数学 2007-05-23 David Eisenbud , Mark Green , Klaus Hulek , Sorin Popescu

In a normed linear space X an element x is said to be orthogonal to another element y in the sense of Birkhoff-James, written as $ x \perp_{B}y, $ iff $ \| x \| \leq \| x + \lambda y \| $ for all scalars $ \lambda.$ We prove that a normed…

泛函分析 · 数学 2024-07-30 Debmalya Sain , Kallol Paul , Kanhaiya Jha

Let X be a real normed vector space and dim X \ge 2. Let d>0 be a fixed real number. We prove that if x,y \in X and ||x-y||/d is a rational number then there exists a finite set {x,y} \subseteq S(x,y) \subseteq X with the following…

泛函分析 · 数学 2007-05-23 Apoloniusz Tyszka

Let $B_Y$ denote the unit ball of a normed linear space $Y$. A symmetric, bounded, closed, convex set $A$ in a finite dimensional normed linear space $X$ is called a {\it sufficient enlargement} for $X$ if, for an arbitrary isometric…

泛函分析 · 数学 2013-02-26 Mikhail I. Ostrovskii

The long-standing problem of minimal projections is addressed from a computational point of view. Techniques to determine bounds on the projection constants of univariate polynomial spaces are presented. The upper bound, produced by a…

数值分析 · 数学 2018-01-15 Simon Foucart , Jean-Bernard Lasserre

In this paper we consider a problem, called convex projection, of projecting a convex set onto a subspace. We will show that to a convex projection one can assign a particular multi-objective convex optimization problem, such that the…

最优化与控制 · 数学 2021-10-18 Gabriela Kováčová , Birgit Rudloff

We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex…

最优化与控制 · 数学 2024-12-11 Gabriela Kováčová , Birgit Rudloff

In this paper, we present a more complete version of the minimax theorem established in [7]. As a consequence, we get, for instance, the following result: Let $X$ be a compact, not singleton subset of a normed space $(E,\|\cdot\|)$ and let…

泛函分析 · 数学 2021-04-13 Biagio Ricceri

This note demonstrates that, for all compact convex sets, high-precision linear minimization can be performed via a single evaluation of the projection and a scalar-vector multiplication. In consequence, if $\varepsilon$-approximate linear…

最优化与控制 · 数学 2025-12-17 Zev Woodstock

The discretization of least-squares problems for linear ill-posed operator equations in Hilbert spaces is considered. The main subject of this article concerns conditions for convergence of the associated discretized minimum-norm…

数值分析 · 数学 2016-02-10 Stefan Kindermann

We derive upper bounds on the difference between the orthogonal projections of a smooth function $u$ onto two finite element spaces that are nearby, in the sense that the support of every shape function belonging to one but not both of the…

数值分析 · 数学 2014-08-19 Evan S. Gawlik , Adrian J. Lew

Let W be a projective variety of dimension n+1, L a free line bundle on W, X in $H^0(L^d)$ a hypersurface of degree d which is generic among those given by sums of monomials from $L$, and let $f : Y \to X$ be a generically finite map from a…

代数几何 · 数学 2007-05-23 L. Chiantini , A. F. Lopez , Z. Ran
‹ 上一页 1 2 3 10 下一页 ›