A parallel low rank matrix optimization method for recovering Internet traffic network data via link flow measurement

DOI10.1016/j.cam.2023.115331zbMath1518.65065OpenAlexW4376868954MaRDI QIDQ6133117

Zhenyu Ming, Li-ping Zhang, Ruoning Chen

Publication date: 21 July 2023

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2023.115331

zbMATH Keywords

singular value decompositionalternating direction method of multiplierstraffic networklow rank matrix optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Network design and communication in computer systems (68M10)

Cites Work

• Unnamed Item
• Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
• An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
• A fast randomized algorithm for the approximation of matrices
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• Atomic Decomposition by Basis Pursuit
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix
• The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
• A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions

This page was built for publication: A parallel low rank matrix optimization method for recovering Internet traffic network data via link flow measurement