2006
DOI: 10.1016/j.jat.2005.11.006
|View full text |Cite
|
Sign up to set email alerts
|

A characterization and equations for minimal shape-preserving projections

Abstract: Let X denote a (real) Banach space and V an n-dimensional subspace. We denote by B = B(X, V ) the space of all bounded linear operators from X into V; let P(X, V ) be the set of all projections in B. For a given cone S ⊂ X, we denote by P = P S (X, V ) the set of operators P ∈ P such that P S ⊂ S. When P S = ∅, we characterize those P ∈ P S for which P is minimal. This characterization is then utilized in several applications and examples.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2006
2006
2012
2012

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 10 publications
0
4
0
Order By: Relevance
“…We begin with a corollary given in [9]; it describes how the functionals that define a projection must be chosen in order for the projection to preserve shape.…”
Section: Proofs Of Minimalitymentioning
confidence: 99%
See 1 more Smart Citation
“…We begin with a corollary given in [9]; it describes how the functionals that define a projection must be chosen in order for the projection to preserve shape.…”
Section: Proofs Of Minimalitymentioning
confidence: 99%
“…In fact, by Corollary 5.1 every element of P S σ (X, Π n ) can be constructed in this way. And that is why we are unable to appeal to the standard theory of minimal projections (described for example in [9]) which relies on best approximations from a linear space (and not from a cone). Therefore we proceed in the following way: we show that replacing δ n−1 1 −δ n−1 0 in P 0,n with any other allowable functional from S * results in an element of P S σ (X, Π n ) with norm at least as large as P 0,n .…”
Section: Proofs Of Minimalitymentioning
confidence: 99%
“…One can appropriately modify the proof given in [5], Theorem 1, as follows. The problem is equivalent to best approximating, in the numerical-radius norm, a fixed operator T 0 ∈ T from the space of operators D = {∆ ∈ B :…”
Section: Theorem 21 (Characterization) T Is a Minimal Numerical-radmentioning
confidence: 99%
“…The paper [5] gives a characterization of P S = ∅ under so-called high-dimensional assumptions (which are explained below). As illustrated, for example, in [1,4] and [6], there are many natural settings for which the high-dimensional assumptions are valid (and thus the characterization can be applied).…”
Section: Introductionmentioning
confidence: 99%