SQP algorithms for solving Toeplitz matrix approximation problem

DOI10.1002/NLA.282MaRDI QIDQ5317867zbMATH OpenOpenAlexFDO

Authors Suliman Al-Homidan

Publication date 21 September 2005

Published in Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nla.282

zbMATH Keywords

Toeplitz matrixnon-smooth optimizationpositive semi-definite matrix\(l_1\) SQP methodfilter SQP

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Methods of successive quadratic programming type (90C55) Applications of mathematical programming (90C90)

Recommendations

• Approximate Toeplitz matrix problem using semidefinite programming
• Approximation by a Hermitian Positive Semidefinite Toeplitz Matrix
• Finding the closest Toeplitz matrix
• Semidefinite and second-order cone optimization approach for the Toeplitz matrix approximation problem
• scientific article; zbMATH DE number 1833345

Cited in

(7)

• Approximation by a Hermitian Positive Semidefinite Toeplitz Matrix
• Approximate Toeplitz matrix problem using semidefinite programming
• Semidefinite and second-order cone optimization approach for the Toeplitz matrix approximation problem
• Finding the closest Toeplitz matrix
• Computation of symmetric positive definite Toeplitz matrices by the hybrid steepest descent method
• Global convergence of the alternating projection method for the max-cut relaxation problem
• scientific article; zbMATH DE number 1833345 (Why is no real title available?)

Describes a project that uses

Uses Software

• filterSQP

This page was built for publication: SQP algorithms for solving Toeplitz matrix approximation problem

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