An algorithm for matrix recovery of high-loss-rate network traffic data

DOI10.1016/J.APM.2021.03.036MaRDI QIDQ2243486zbMATH OpenOpenAlexFDO

Authors Zhenyu Ming, Yanwei Xu, Mayank Bakshi, Liping Zhang

Publication date 11 November 2021

Published in Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.apm.2021.03.036

zbMATH Keywords

alternating direction method of multipliersnuclear normcross validationnetwork traffic

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Recommendations

• A parallel low rank matrix optimization method for recovering Internet traffic network data via link flow measurement
• T-product factorization method for internet traffic data completion with spatio-temporal regularization
• Low-rank traffic matrix completion with marginal information
• Recovering low-rank matrices from corrupted observations via the linear conjugate gradient algorithm
• A sparsity adaptive measurement algorithm for network traffic matrix

Cites work

• A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions
• A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications
• An Adaptive Correction Approach for Tensor Completion
• An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
• Compressed sensing
• Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
• On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming
• Parallel matrix factorization for low-rank tensor completion
• Semidefinite Programming
• The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent

Cited in

(6)

• Network traffic recovery from link-load measurements using tensor triple decomposition strategy for third-order traffic tensors
• Low-rank traffic matrix completion with marginal information
• A parallel low rank matrix optimization method for recovering Internet traffic network data via link flow measurement
• A sparsity adaptive measurement algorithm for network traffic matrix
• T-product factorization method for internet traffic data completion with spatio-temporal regularization
• Low rank matrix minimization with a truncated difference of nuclear norm and Frobenius norm regularization

This page was built for publication: An algorithm for matrix recovery of high-loss-rate network traffic data

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