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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Numerical Methods for Computing Angles Between Linear Subspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rang revealing QR factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Truncated Singular Value Decomposition Least Squares Solutions by Rank Revealing QR-Factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Applications of the Rank Revealing QR Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Modified Matrix Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of the Eckart-Young-Mirsky matrix approximation theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stationary values of the ratio of quadratic forms subject to linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbation analysis of the canonical correlations of matrix pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5561562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical correlation analysis with linear constraints / rank
 
Normal rank

Latest revision as of 10:38, 23 May 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