Semi-definite programming for the nearest circulant semi-definite matrix problem

DOI10.37193/CJM.2021.01.02zbMATH Open1488.49051OpenAlexW3133378529WikidataQ113999575 ScholiaQ113999575MaRDI QIDQ3384547FDOQ3384547

Authors: Suliman Al-Homidan 

Publication date: 15 December 2021

Published in: Carpathian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.37193/cjm.2021.01.02

Recommendations

• Computing the nearest circulant positive semi-definite matrix to a noisy matrix
• Solving Hankel matrix approximation problem using semidefinite programming
• Approximate Toeplitz matrix problem using semidefinite programming
• Structure methods for solving the nearest correlation matrix problem
• Semidefinite and second-order cone optimization approach for the Toeplitz matrix approximation problem

zbMATH Keywords

circulant matrixnon-smooth optimizationsemi-definite programminginexact Gauss-Newton methodconjugate gradients methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Numerical linear algebra (65F99) Semidefinite programming (90C22) Newton-type methods (49M15)

Cited In (4)

• Computing a nearest symmetric positive semidefinite matrix
• Computing the nearest circulant positive semi-definite matrix to a noisy matrix
• Solving Hankel matrix approximation problem using semidefinite programming
• Semidefinite programming for the nearest Hurwitz semidefinite matrix problem

This page was built for publication: Semi-definite programming for the nearest circulant semi-definite matrix problem

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