Alternating direction method for a class of constrained matrix approximation problems

zbMATH Open1316.49040MaRDI QIDQ4906148FDOQ4906148

Authors: Qing-Na Li 

Publication date: 7 February 2013

Full work available at URL: http://www.yokohamapublishers.jp/online2/oppjo/vol8/p765.html

Recommendations

• A new algorithm for constrained matrix least squares approximations
• An alternating direction method for solving convex nonlinear semidefinite programming problems
• Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm
• A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems
• Solving large-scale least squares semidefinite programming by alternating direction methods

zbMATH Keywords

convex optimizationalternating direction methodMoreau-Yosida regularizationmatrix approximation problemsspectral norm optimization

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Cited In (9)

• Alternating direction methods for solving a class of Sylvester-like matrix equations
• The Alternating Direction Methods for Solving the Sylvester-Type Matrix Equation<br> <em>AXb + CX^⊤D = E^*</em>
• Title not available (Why is that?)
• An alternating direction method for finding Dantzig selectors
• A class of multilevel structured low-rank approximation arising in material processing
• A remark on the theory of the commutative alternating direction method
• A semismooth Newton-CG based dual PPA for matrix spectral norm approximation problems
• Positive definite matrix approximation with condition number constraint
• Novel alternating update method for low rank approximation of structured matrices

This page was built for publication: Alternating direction method for a class of constrained matrix approximation problems

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