Fixed point optimization algorithm and its application to network bandwidth allocation

Research output: Contribution to journalArticle

39 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)1733-1742
Number of pages10
JournalJournal of Computational and Applied Mathematics
Issue number7
Publication statusPublished - 1 Jan 2012


  • Convex minimization problem
  • Fixed point optimization algorithm
  • Generalized convex feasible set
  • Network bandwidth allocation problem
  • Nonexpansive mapping

Fingerprint Dive into the research topics of 'Fixed point optimization algorithm and its application to network bandwidth allocation'. Together they form a unique fingerprint.

  • Cite this