An effective algorithm for generalized Sylvester equation minimization problem under columnwise orthogonal constraints

MaRDI QIDQ3380646zbMATH OpenFDO

Authors

Publication date 29 September 2021

zbMATH Keywords

minimization problemgeneralized Sylvester equationRiemannian conjugate gradient methodcolumnwise orthogonal constraint

Mathematics Subject Classification ID

Matrix equations and identities (15A24) Numerical methods for matrix equations (65F45)

Recommendations

• On the numerical solution of generalized Sylvester matrix equations
• Conjugate gradient least squares algorithm for solving the generalized coupled Sylvester-conjugate matrix equations
• Iterative algorithms for the minimum-norm solution and the least-squares solution of the linear matrix equations A₁XB₁ + C₁X^TD₁ = M₁, A₂XB₂ + C₂ X^TD₂ = M₂
• Krylov subspace methods for the generalized Sylvester equation
• Generalized conjugate direction algorithm for solving general coupled Sylvester matrix equations

Cited in

(1)

• An efficient method for solving generalized Sylverster equation minimization problem under the nuclear and spectral norm

This page was built for publication: An effective algorithm for generalized Sylvester equation minimization problem under columnwise orthogonal constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3380646)