A localization technique for linear preserver problems
نویسندگان
چکیده
منابع مشابه
Linear Preserver Problems
Linear preserver problems is an active research area in matrix and operator theory. These problems involve certain linear operators on spaces of matrices or operators. We give a general introduction to the subject in this article. In the first three sections, we discuss motivation, results, and problems. In the last three sections, we describe some techniques, outline a few proofs, and discuss ...
متن کاملSome General Techniques on Linear Preserver Problems
Several general techniques on linear preserver problems are described. The first one is based on a transfer principle in Model Theoretic Algebra that allows one to extend linear preserver results on complex matrices to matrices over other algebraically closed fields of characteristic 0. The second one concerns the use of some simple geometric technique to reduce linear preserver problems to sta...
متن کاملRESOLUTION METHOD FOR MIXED INTEGER LINEAR MULTIPLICATIVE-LINEAR BILEVEL PROBLEMS BASED ON DECOMPOSITION TECHNIQUE
In this paper, we propose an algorithm base on decomposition technique for solvingthe mixed integer linear multiplicative-linear bilevel problems. In actuality, this al-gorithm is an application of the algorithm given by G. K. Saharidis et al for casethat the rst level objective function is linear multiplicative. We use properties ofquasi-concave of bilevel programming problems and decompose th...
متن کاملA goal programming approach for fuzzy flexible linear programming problems
We are concerned with solving Fuzzy Flexible Linear Programming (FFLP) problems. Even though, this model is very practical and is useful for many applications, but there are only a few methods for its situation. In most approaches proposed in the literature, the solution process needs at least, two phases where each phase needs to solve a linear programming problem. Here, we propose a method t...
متن کاملSome Linear Preserver Problems on B(h) concerning Rank and Corank
As a continuation of the work on linear maps between operator algebras which preserve certain subsets of operators with finite rank, or finite corank, here we consider the problem inbetween, that is, we treat the question of preserving operators with infinite rank and infinite corank. Since, as it turns out, in this generality our preservers cannot be written in a nice form what we have got use...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2010
ISSN: 0024-3795
DOI: 10.1016/j.laa.2010.07.032