2017
DOI: 10.1016/j.laa.2017.05.045
|View full text |Cite
|
Sign up to set email alerts
|

The minus order and range additivity

Abstract: We study the minus order on the algebra of bounded linear operators on a Hilbert space. By giving a characterization in terms of range additivity, we show that the intrinsic nature of the minus order is algebraic. Applications to generalized inverses of the sum of two operators, to systems of operator equations and to optimization problems are also presented.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
18
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 13 publications
(18 citation statements)
references
References 31 publications
(42 reference statements)
0
18
0
Order By: Relevance
“…Also A * W A = A * W B, so that W 1/2 A * ≤ W 1/2 B. In the same way W 1/2 B * ≤ W 1/2 C, then since * ≤ is transitive, W 1/2 A * ≤ W 1/2 C and therefore A * W A = A * W C. On the other hand, if A * W ≤ B and B * W ≤ C, then A − ≤ B and B − ≤ C, and since − ≤ is transitive (see [18,Proposition 3.11]), we also have that A − ≤ C. Then, by Proposition 5.1, A * W ≤ C and the relation * W ≤ is a partial order. In a similar way, it can be proven that * W ≤ , ≤ * W are transitive.…”
Section: Definition Givenmentioning
confidence: 92%
See 2 more Smart Citations
“…Also A * W A = A * W B, so that W 1/2 A * ≤ W 1/2 B. In the same way W 1/2 B * ≤ W 1/2 C, then since * ≤ is transitive, W 1/2 A * ≤ W 1/2 C and therefore A * W A = A * W C. On the other hand, if A * W ≤ B and B * W ≤ C, then A − ≤ B and B − ≤ C, and since − ≤ is transitive (see [18,Proposition 3.11]), we also have that A − ≤ C. Then, by Proposition 5.1, A * W ≤ C and the relation * W ≤ is a partial order. In a similar way, it can be proven that * W ≤ , ≤ * W are transitive.…”
Section: Definition Givenmentioning
confidence: 92%
“…The left minus order was defined in [18] for operators in L(H). Using Theorem 3.3, it is easy to see that this notion is weaker than the minus order, in the infinite dimensional setting.…”
Section: Minus Order and Compatibilitymentioning
confidence: 99%
See 1 more Smart Citation
“…Different definitions where given for the minus order, for example, using generalized inverses in the matrix case, see [33]. We give the following definition, equivalent to those appearing in [38] and [20]. Definition.…”
Section: Applications: Schur Complements Of Selfadjoint Operatorsmentioning
confidence: 99%
“…Finally, given T ∈ P • L h with R(T )+N (T ) = H we shall prove that A N is optimal in A T with respect to the minus order in L(H). For this we use the following result due to Dijić, Fongi and Maestripieri [13,Proposition 3.2]). where the minimum is taken with respect to the minus order.…”
Section: Optimal Decompositionsmentioning
confidence: 99%