Computing the nearest circulant positive semi-definite matrix to a noisy matrix

MaRDI QIDQ5049784zbMATH OpenFDO

Authors Suliman Al-Homidan

Publication date 14 November 2022

Full work available at URL http://yokohamapublishers.jp/online2/opjnca/vol22/p309.html

zbMATH Keywords

alternating projectionscirculant matrixhybrid methodsnon-smooth optimizationpermutative matrixSQP methodpositive semi-definite matrix

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Random matrices (algebraic aspects) (15B52) Numerical linear algebra (65F99)

Recommendations

• Semi-definite programming for the nearest circulant semi-definite matrix problem
• Structured low rank approximation
• Semidefinite and second-order cone optimization approach for the Toeplitz matrix approximation problem
• Approximate Toeplitz matrix problem using semidefinite programming
• Solving Hankel matrix approximation problem using semidefinite programming

Cited in

(3)

• Computing Closest Stable Nonnegative Matrix
• Semi-definite programming for the nearest circulant semi-definite matrix problem
• Computing a nearest symmetric positive semidefinite matrix

This page was built for publication: Computing the nearest circulant positive semi-definite matrix to a noisy matrix

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