Some generalizations and applications of a complex transposition theorem
The well known Motzkin transposition theorem states that the system in real space \[ A x>0,\ B x \geq 0,\ C x=0 \] has a solution if and only if \[ A^t y^1+B^t y^2+C^ty^3{3}=0, \quad y^1 \geq 0, \quad y^1 \neq 0, \quad y^2 \geq 0 \] has none. This was extended to complex space [cf. the authors, Linear Algebra Appl. 2, 49--56 (1969; Zbl 0181.04002)] in the following way. The system \[ \Re A z>0,\ |\arg B z| \leq \pi / 2-\alpha,\ C z=0 \] has a solution, if and only if \[ A^{*} w^{1}+B^{*} w^{2}+C^{*} w^{3}=0, \quad \Im w^{1}=0, \quad \Re w^{1} \geq 0, \quad w^{1} \neq 0, \quad\left|\arg w^{2}\right| \leq \alpha \] has none. Here all vectors and matrices are complex except that \(\alpha\) is a real vector of angles in the closed interval \([0, \pi/2]\). Various alternate forms and generalizations of this last result are given. Numerous special cases are then listed that extend many well-known transposition theorems in real space.
- A complex transposition theorem with applications to complex programming
- A theorem on alternatives for pairs of matrices
- scientific article; zbMATH DE number 3121281 (Why is no real title available?)
- scientific article; zbMATH DE number 3326230 (Why is no real title available?)
- scientific article; zbMATH DE number 3185418 (Why is no real title available?)
- Linear programming in complex space
- A continuous-time generalization of Gordan's transposition theorem
- Theorems of the alternative for complex linear inequalities
- Duality for nonlinear programming in complex space
- Existence theory for the complex linear complementarity problem
- Solution of the complex linear complementarity problem
- A theorem of Fritz John in complex programming
- On the complex complementarity problem
- Modulus-based matrix splitting methods for complex linear complementarity problem
This page was built for publication: Some generalizations and applications of a complex transposition theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2535716)