A complex transposition theorem with applications to complex programming (Q2534706)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3287789
Language Label Description Also known as
default for all languages
No label defined
    English
    A complex transposition theorem with applications to complex programming
    scientific article; zbMATH DE number 3287789

      Statements

      A complex transposition theorem with applications to complex programming (English)
      0 references
      1969
      0 references
      0 references
      0 references
      complex transposition theorem
      0 references
      applications to complex programming
      0 references
      duality theorem
      0 references
      The Motzkin transposition theorem in real space states that the system \( A x>0 \), \( B x \geq 0\), \(C x=0 \) has a solution if and only if the system \[ A^{t} y^{1}+B^{t} y^{2}+C^{t} y^{3}=0, \quad y^{1} \geq 0, \quad y^{1} \neq 0, \quad y^{2} \geq 0 \] has none. The following extension to complex space is obtained: The system \[ \Re A z>0,\ |\arg B z| \leq \pi / 2-\alpha,\ C z=0, \] has a solution if and only if the system \[ A^{*} w^{1}+B^{*} w^{2}+C^{*} w^{3}=0, \ \Im w^{1}=0, \ \Re w^{1} \geq 0, \ w^{1} \neq 0,\ \left|\arg w^{2}\right| \leq \alpha \] has none. Here \(A\), \(B\) and \(C\) are complex matrices, \(z, w^{1}, w^{2}\) and \(w^{3}\) are complex vectors, \(\alpha\) and \(\pi / 2-\alpha\) are vectors with each component in \([0, \pi/2]\). This result is then used to provide a simple proof of the duality theorem of complex linear programming.
      0 references

      Identifiers