Skip to main content

Monotonic Optimization

  • Chapter
  • First Online:
Convex Analysis and Global Optimization

Part of the book series: Springer Optimization and Its Applications ((SOIA,volume 110))

Abstract

This chapter presents a mathematical framework for monotonic optimization—an important new field of global optimization which has been emerged in the last 15 years. The basic concepts are introduced, then the basic polyblock algorithm along with the SIT (Successive Incumbent Transcending) Algorithm for canonical monotonic optimization is described. Finally some important applications in economics and engineering, particularly in communication and networking systems, are discussed.

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

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 129.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 129.00
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Astorino, A., Miglionico, G.: Optimizing sensor cover energy via DC Programming. Optim. Lett. (2014). doi:10.1007/s11590-014-0778-y

    MathSciNet  MATH  Google Scholar 

  • BjĹŤrnson, E., Jorswieck, E.: Optimal resource allocation in coordinated multi-cell systems. Foundations and Trends in Communications and Information Theory, vol. 9(2–3), pp. 113–381 (2012). doi:10.1561/0100000069

    MATH  Google Scholar 

  • BjĹŤrnson, E., Zheng, G., Bengtson, M., Ottersen, B.: Robust monotonic optimization framework for multicell MISO systems. IEEE Trans. Signal Process. 60 (5), 2508–2521 (2012)

    Article  MathSciNet  Google Scholar 

  • Charnes, A., Cooper, W.W.: Programming with linear fractional functionals. Nav. Res. Logist. 9, 181–186 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  • Cheon, M.-S., Ahmed, S., Al-Khayyal, F.: A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs. Math. Program. Ser. B 108, 617–634 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  • Falk, J.E., Palocsay, S.W.: Optimizing the sum of linear fractional functions. In: Floudas, C., Pardalos, P. (eds) Global Optimization, pp. 221–258. Princeton University Press, Princeton (1992)

    Google Scholar 

  • Hoai, P.T., Tuy, H.: Monotonic Optimization for Sensor Cover Energy Problem. Institute of Mathematics, Hanoi (2016). Preprint

    Google Scholar 

  • Hoai-Phuong, N.T., Tuy, H.: A unified monotonic approach to generalized linear fractional programming. J. Glob. Optim. 26, 229–259 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  • Jorswieck, E.A., Larson, E.G.: Monotonic optimization framework for the two-user MISO interference channel. IEEE Trans. Commun. 58, 2159–2168 (2010)

    Article  Google Scholar 

  • Konno, H., Abe, N.: Minimization of the sum of three linear fractions. J. Glob. Optim. 15, 419–432 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  • Konno, H., Yajima, Y.: Minimizing and maximizing the product of linear fractional functions. In: Floudas, C., Pardalos, P. (eds.) Recent Advances in Global Optimization, pp. 259–273. Princeton University Press, Princeton (1992)

    Google Scholar 

  • Konno, H., Yamashita, Y.: Minimization od the sum and the product of several linear fractional functions. Nav. Res. Logist. 44, 473–497 (1997)

    Article  Google Scholar 

  • Konno, H., Yajima, Y., Matsui, T.: Parametric simplex algorithms for solving a special class of nonconvex minimization problems. J. Glob. Optim. 1, 65–82 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  • Plastria, F.: Continuous location problems. In: Drezner, Z., Hamacher, H.W. (eds.) Facility Location, pp. 225–262. Springer, Berlin (1995)

    Chapter  Google Scholar 

  • PrĂ©kopa, A.: Contributions to the theory of stochastic programming. Math. Program. 4, 202–221 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  • PrĂ©kopa, A.: Stochastic Programming. Kluwer, Dordrecht (1995)

    Book  MATH  Google Scholar 

  • Qian, L.P., Jun Zhang, Y.: S-MAPEL: monotonic optimization for non-convex joint power control and scheduling problems. IEEE Trans. Wirel. Commun. 9, 1708–1719 (2010)

    Article  Google Scholar 

  • Qian, L.P., Jun Zhang, Y., Huang, J.W.: MAPEL: achieving global optimality for a nonconvex wireless power control problem. IEEE Trans. Wirel. Commun. 8, 1553–1563 (2009)

    Article  Google Scholar 

  • Qian, L.P., Jun Zhang, Y., Huang, J.: Monotonic optimization in communications and networking systems. Found. Trends Netw. 7, 1–75 (2012)

    Article  MATH  Google Scholar 

  • Rubinov, A., Tuy, H., Mays, H.: Algorithm for a monotonic global optimization problem. Optimization 49, 205–221 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  • Schaible, S.: Fractional Programming. In: Horst,R., Pardalos, P. (eds.) Handbook of Global Optimization, pp. 495–608. Kluwer, Dordrecht (1992)

    Google Scholar 

  • Shi, J.S., Yamamoto, Y.: A D.C. approach to the largest empty sphere problem in higher dimension. In: Floudas, C., Pardalos, P. (eds.) State of the Art in Global Optimization, pp. 395–411. Kluwer, Dordrecht (1996)

    Chapter  Google Scholar 

  • Stancu-Minasian, I.M.: Fractional Programming, Theory, Methods and Applications. Kluwer, Dordrecht (1997)

    Book  MATH  Google Scholar 

  • Thach, P.T.: The design centering problem as a d.c. programming problem. Math. Program. 41, 229–248 (1988)

    Google Scholar 

  • Tuy, H.: Monotonic Optimization: Problems and Solution Approaches. SIAM J. Optim. 11, 464–494 (2000a)

    Google Scholar 

  • Tuy, H.: D(C)-optimization and robust global optimization. J. Glob. Optim. 47, 485–501 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  • Tuy, H., Hoai-Phuong, N.T.: A robust algorithm for quadratic optimization under quadratic constraints. J. Glob. Optim. 37, 557–569 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  • Tuy, H., Nghia, N.D., Vinh, L.S.: A discrete location problem. Acta Math. Vietnam. 28, 185–199 (2003)

    MathSciNet  MATH  Google Scholar 

  • Tuy, H., Al-Khayyal, F., Thach, P.T.: Monotonic optimization: branch and cut methods. In: Audet, C., Hansen, P., Savard, G. (eds.) Essays and Survey on Global Optimization, pp. 39–78. GERAD/Springer, New York (2005)

    Chapter  Google Scholar 

  • Tuy, H., Minoux, M., Hoai-Puong, N.T.: Discrete monotonic optimization with application to a discrete location problem. SIAM J. Optim. 17, 78–97 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  • Utschick, W., Brehmer, J.: Monotonic optimization framework for coordinated beamforming in multi-cell networks. IEEE Trans. Signal Process. 60, 2496–2507 (2012)

    Article  MathSciNet  Google Scholar 

  • Vidigal, L., Director, S.: A design centering algorithm for nonconvex regions of acceptability. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 14, 13–24 (1982)

    Article  Google Scholar 

  • Yick, J., Mukherjee, B., Ghosal, D.: Wireless sensor network survey. Comput. Network 52, 2292–2320 (2008)

    Article  Google Scholar 

  • Zhang, Y.J., Qian, L.P., Huang, J.W.: Monotonic optimization communication and networking systems. Found. Trends Commun. Inf. Theory 7 (1), 1–75 (2012)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this chapter

Cite this chapter

Tuy, H. (2016). Monotonic Optimization. In: Convex Analysis and Global Optimization. Springer Optimization and Its Applications, vol 110. Springer, Cham. https://doi.org/10.1007/978-3-319-31484-6_11

Download citation

Publish with us

Policies and ethics