Maximizing bilinear forms subject to linear constraints
From MaRDI portal
Recommendations
- A simple bilinear optimization problem
- A linear programming approach to solving bilinear programmes
- Bilinear minimax problems with linear constraints: Theory and numerical experiment
- Critical angles between two convex cones. II: Special cases
- Proofs for finding the maxima of two quadratic forms under some constraints
Cites work
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 3277086 (Why is no real title available?)
- A generalization of the Eckart-Young-Mirsky matrix approximation theorem
- Canonical correlation analysis with linear constraints
- Computing Truncated Singular Value Decomposition Least Squares Solutions by Rank Revealing QR-Factorizations
- Numerical Methods for Computing Angles Between Linear Subspaces
- Perturbation analysis of the canonical correlations of matrix pairs
- Rang revealing QR factorizations
- Some Applications of the Rank Revealing QR Factorization
- Some Modified Matrix Eigenvalue Problems
- Stationary values of the ratio of quadratic forms subject to linear constraints
Cited in
(6)- Canonical analysis relative to a closed subspace
- scientific article; zbMATH DE number 4024896 (Why is no real title available?)
- Bilinear minimax problems with linear constraints: Theory and numerical experiment
- A fifth bibliography of fractional programming*
- Optimal bounds for bilinear forms associated with linear equations
- Matrix-trace Cauchy-Schwarz inequalities and applications in canonical correlation analysis
This page was built for publication: Maximizing bilinear forms subject to linear constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1338503)
