SQP algorithms for solving Toeplitz matrix approximation problem

DOI10.1002/NLA.282zbMATH Open1071.65081OpenAlexW2098271112MaRDI QIDQ5317867FDOQ5317867

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (7)

• Computation of symmetric positive definite Toeplitz matrices by the hybrid steepest descent method
• Title not available (Why is that?)
• Approximation by a Hermitian Positive Semidefinite Toeplitz Matrix
• Semidefinite and second-order cone optimization approach for the Toeplitz matrix approximation problem
• Approximate Toeplitz matrix problem using semidefinite programming
• Finding the closest Toeplitz matrix
• Global convergence of the alternating projection method for the max-cut relaxation problem

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)