SQP algorithms for solving Toeplitz matrix approximation problem

DOI10.1002/NLA.282zbMath1071.65081OpenAlexW2098271112MaRDI QIDQ5317867

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) Applications of mathematical programming (90C90) Methods of successive quadratic programming type (90C55)

Related Items (3)

Approximate Toeplitz matrix problem using semidefinite programming ⋮ Semidefinite and second-order cone optimization approach for the Toeplitz matrix approximation problem ⋮ Global convergence of the alternating projection method for the Max-Cut relaxation problem

Uses Software

• filterSQP

Cites Work

• Unnamed Item
• Unnamed Item

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