Skip to main content
SpringerLink
Log in

Fixed point optimization algorithm and its application to power control in CDMA data networks

  • Full Length Paper
  • Series A
  • Published:
Mathematical Programming Submit manuscript

Abstract

We discuss the variational inequality problem for a continuous operator over the fixed point set of a nonexpansive mapping. One application of this problem is a power control for a direct-sequence code-division multiple-access data network. For such a power control, each user terminal has to be able to quickly transmit at an ideal power level such that it can get a sufficient signal-to-interference-plus-noise ratio and achieve the required quality of service. Iterative algorithms to solve this problem should not involve auxiliary optimization problems and complicated computations. To ensure this, we devise a fixed point optimization algorithm for the variational inequality problem and perform a convergence analysis on it. We give numerical examples of the algorithm as a power control.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bakushinsky A., Goncharsky A.: Ill-Posed Problems : Theory and Applications. Kluwer, Dordrecht (1994)

    Book  Google Scholar 

  2. Bauschke H.H., Borwein J.M.: On projection algorithms for solving convex feasibility problems. SIAM Rev. 38, 367–426 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bauschke H.H., Borwein J.M., Lewis A.S.: The method of cyclic projections for closed convex sets in Hilbert space. Contemp. Math. 204, 1–38 (1997)

    Article  MathSciNet  Google Scholar 

  4. Borwein J.M., Lewis A.S.: Convex Analysis and Nonlinear Optimization: Theory and Examples. Springer, New York (2000)

    MATH  Google Scholar 

  5. Combettes P.L.: A block-iterative surrogate constraint splitting method for quadratic signal recovery. IEEE Trans. Signal Process. 51, 1771–1782 (2003)

    Article  MathSciNet  Google Scholar 

  6. Facchinei F., Pang J.-S.: Finite-Dimensional Variational Inequalities and Complementarity Problems I. Springer, New York (2003)

    MATH  Google Scholar 

  7. Facchinei F., Pang J.-S.: Finite-Dimensional Variational Inequalities and Complementarity Problems II. Springer, New York (2003)

    MATH  Google Scholar 

  8. Goebel K., Kirk W.A.: Topics in Metric Fixed Point Theory. Cambridge Univ. Press, Cambridge (1990)

    Book  MATH  Google Scholar 

  9. Goebel K., Reich S.: Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings. Dekker, New York and Basel (1984)

    MATH  Google Scholar 

  10. Goodman D., Mandayam M.: Power control for wireless data. IEEE Pers. Commun. 7, 48–54 (2000)

    Article  Google Scholar 

  11. Hansen P.C.: Regularization Tools Version 4.0 for Matlab Version 7.3. Numer. Algorithms 46, 189–194 (2007)

    Article  MATH  Google Scholar 

  12. Hiriart-Urruty J.B., Lemaréchal C.: Convex Analysis and Minimization Algorithms I. Springer, New York (1993)

    Google Scholar 

  13. Hirstoaga S.A.: Iterative selection methods for common fixed point problems. J. Math. Anal. Appl. 324, 1020–1035 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  14. Iiduka H.: Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping. J. Optim. Theory Appl. 140, 463–475 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  15. Iiduka H.: Strong convergence for an iterative method for the triple-hierarchical constrained optimization problem. Nonlinear Anal. 71, 1292–1297 (2009)

    Article  MathSciNet  Google Scholar 

  16. Iiduka H.: A new iterative algorithm for the variational inequality problem over the fixed point set of a firmly nonexpansive mapping. Optimization 59, 873–885 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  17. Iiduka H., Yamada I.: A use of conjugate gradient direction for the convex optimization problem over the fixed point set of a nonexpansive mapping. SIAM J. Optim. 19, 1881–1893 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  18. Iiduka H., Yamada I.: An ergodic algorithm for the power-control games for CDMA data networks. J. Math. Model. Algorithms 8, 1–18 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  19. Ji H., Huang C.Y.: Non-cooperative uplink power control in cellular radio systems. Wirel. Netw. 4, 233–240 (1998)

    Article  Google Scholar 

  20. Maingé P.E., Moudafi A.: Strong convergence of an iterative method for hierarchical fixed-point problems. Pac. J. Optim. 3, 529–538 (2007)

    MathSciNet  MATH  Google Scholar 

  21. Meshkati F., Poor H.V., Schwartz S.C., Mandayam N.B.: An energy-efficient approach to power control and receiver design in wireless data networks. IEEE Trans. Commun. 53, 1885–1894 (2005)

    Article  Google Scholar 

  22. Moudafi A.: Krasnoselski-Mann iteration for hierarchical fixed-point problems. Inverse Probl. 23, 1635–1640 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  23. Nash J.F.: Equilibrium points in n-person games. Proc. Natl. Acad. Sci. 36, 48–49 (1950)

    Article  MathSciNet  MATH  Google Scholar 

  24. Nash J.F.: Non-cooperative games. Ann. Math. 54, 286–295 (1951)

    Article  MathSciNet  MATH  Google Scholar 

  25. Owen G.: Game Theory. W. B. Saunders Company, Philadelphia (1968)

    MATH  Google Scholar 

  26. Pang J.-S., Fukushima M.: Quasi-variational inequalities, generalized Nash equilibria, and multi-leader-follower games. Comput. Manag. Sci. 2, 21–56 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  27. Qi L., Sun D.: A survey of some nonsmooth equations and smoothing Newton methods. In: Eberhard, A., Glover, B., Hill, R., Ralph, D. (eds) Progress in Optimization. Appl. Optim., vol. 30, pp. 121–146. Kluwer, Dordrecht (1999)

    Google Scholar 

  28. Reich S.: Some problems and results in fixed point theory. Contemp. Math. 21, 179–187 (1983)

    Article  MATH  Google Scholar 

  29. Rodriguez, V.: Robust modeling and analysis for wireless date resource management. In: Proceedings of IEEE Wireless Communication Network Conference, pp. 717–722. New Orleans, LA (March 2003)

  30. Sampath, A.S., Kumar, P.S., Holtzman, J.M.: Power control and resource management for a multimedia CDMA wireless system. In: Proceedings IEEE PIMRC ’95 (1995)

  31. Saraydar C.U., Mandayam N.B., Goodman D.J.: Efficient power control via pricing in wireless data networks. IEEE Trans. Commun. 50, 291–303 (2002)

    Article  Google Scholar 

  32. Slavakis K., Yamada I., Sakaniwa K.: Computation of symmetric positive definite Toeplitz matrices by the hybrid steepest descent method. Signal Process. 83, 1135–1140 (2003)

    Article  MATH  Google Scholar 

  33. Slavakis K., Yamada I.: Robust wideband beamforming by the hybrid steepest descent method. IEEE Trans. Signal Process. 55, 4511–4522 (2007)

    Article  MathSciNet  Google Scholar 

  34. Solodov M.V., Svaiter B.F.: A new projection method for variational inequality problems. SIAM J. Control Optim. 37, 765–776 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  35. Stark H., Yang Y.: Vector Space Projections: A Numerical Approach to Signal and Image Processing, Neural Nets, and Optics. Wiley, London (1998)

    MATH  Google Scholar 

  36. Sung C.W., Wong W.S.: Power control and rate management for wireless multimedia CDMA systems. IEEE Trans. Commun. 49, 1215–1226 (2001)

    Article  MATH  Google Scholar 

  37. Sung C.W., Wong W.S.: A noncooperative power control game for multirate CDMA data networks. IEEE Trans. Wirel. Commun. 2, 186–194 (2003)

    Article  Google Scholar 

  38. Takahashi W.: Nonlinear Functional Analysis. Yokohama Publishers, Yokohama (2000)

    MATH  Google Scholar 

  39. Tse D.N.C., Hanly S.V.: Linear multiuser receivers: effective interference, effective bandwidth and user capacity. IEEE Trans. Inf. Theory 45, 641–657 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  40. Wolfe P.: Finding the nearest point in a polytope. Math. Program 11, 128–149 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  41. Yamada I. : The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of nonexpansive mappings. In: Butnariu, D., Censor, Y., Reich, S. (eds) Inherently Parallel Algorithms for Feasibility and Optimization and Their Applications, pp. 473–504. Elsevier, New York (2001)

    Chapter  Google Scholar 

  42. Yamada I., Ogura N., Shirakawa N.: A numerically robust hybrid steepest descent method for the convexly constrained generalized inverse problems. Contemp. Math. 313, 269–305 (2002)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Network Design Research Center, Kyushu Institute of Technology, Hibiya Kokusai Bldg. 1F 107, 2-2-3 Uchisaiwai-cho, Chiyoda-ku, Tokyo, 100-0011, Japan

    Hideaki Iiduka

Authors
  1. Hideaki Iiduka
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hideaki Iiduka.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Iiduka, H. Fixed point optimization algorithm and its application to power control in CDMA data networks. Math. Program. 133, 227–242 (2012). https://doi.org/10.1007/s10107-010-0427-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-010-0427-x

Keywords

Mathematics Subject Classification (2000)

Search

Navigation