Maximizing bilinear forms subject to linear constraints (Q1338503): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W2024045684 / rank
 
Normal rank

Revision as of 22:10, 19 March 2024

scientific article
Language Label Description Also known as
English
Maximizing bilinear forms subject to linear constraints
scientific article

    Statements

    Maximizing bilinear forms subject to linear constraints (English)
    0 references
    0 references
    5 March 1996
    0 references
    Let \(A \in\mathbb{R}^{m \times n}\), \(B \in\mathbb{R}^{m \times p}\), \(C \in\mathbb{R}^{k \times m}\), \(G \in\mathbb{R}^{p \times n}\), \(d \in\mathbb{R}^k\), \(h \in\mathbb{R}^p\). The author studies the problem of maximizing the bilinear form \((x^T Ay)/(|x|\cdot |y|)\), or its absolute value subject to linear constraints of the form \(Cx = d\), \(Gy = h\) or of the form \(Cx \in R(D)\), \(Gy \in R(H)\), where \(R(D)\) and \(R(H)\) represent the column spaces of the matrices \(D \in\mathbb{R}^{k \times r}\) and \(H \in\mathbb{R}^{p \times \ell}\). Finally, he determines the angle between two subspaces of \(\mathbb{R}^m\) and the canonical correlations for the pair \((A,B)\) subject to the linear equality constraints \(Cx = d\), \(Gy = h\).
    0 references
    0 references
    0 references
    0 references
    0 references
    quadratic programming
    0 references
    bilinear form
    0 references
    canonical correlations
    0 references
    linear equality constraints
    0 references
    0 references
    0 references