Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Vector Space Projections: A Numerical Approach to Signal and Image Processing, Neural Nets, and Optics
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
A block-iterative surrogate constraint splitting method for quadratic signal recovery
IEEE Transactions on Signal Processing
Robust Wideband Beamforming by the Hybrid Steepest Descent Method
IEEE Transactions on Signal Processing
| Hi-index | 7.29 |
A convex optimization problem for a strictly convex objective function over the fixed point set of a nonexpansive mapping includes a network bandwidth allocation problem, which is one of the central issues in modern communication networks. We devised an iterative algorithm, called a fixed point optimization algorithm, for solving the convex optimization problem and conducted a convergence analysis on the algorithm. The analysis guarantees that the algorithm, with slowly diminishing step-size sequences, weakly converges to a unique solution to the problem. Moreover, we apply the proposed algorithm to a network bandwidth allocation problem and show its effectiveness.