Movatterモバイル変換


[0]ホーム

URL:


Skip to main content

Advertisement

Springer Nature Link
Log in

Global Optimality Conditions and Near-Perfect Optimization in Coding

  • Conference paper

Part of the book series:Lecture Notes in Computer Science ((LNTCS,volume 3595))

Included in the following conference series:

  • 1889Accesses

Abstract

Finding ways of recognizing global optimum is the very fundamental, unsolved problem in existing optimization theories. We can not establish a true theory of optimization without it. Also, it is very hard to construct effective algorithms for finding global optimum. This paper presented a new optimization principle, called cooperative optimization, for solving this extremely important problem in optimization theory. A number of global optimality conditions are provided in a general form. The application of cooperative optimization in coding yields near-perfect results in finding global optima, significantly better than the most powerful optimization algorithm ever found so far.

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

Access this chapter

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Pardalos, P., Resende, M.: Handbook of Applied Optimization. Oxford University Press, Inc., Oxford (2002)

    Book MATH  Google Scholar 

  2. Huang, X.: A polynomial-time algorithm for solving np-hard problems in practice. SIGACT Newsletter 34, 101–108 (2003)

    Article  Google Scholar 

  3. Huang, X.: Cooperative optimization for solving large scale combinatorial problems. In: Theory and Algorithms for Cooperative Systems. Series on Computers and Operations Research, pp. 117–156. World Scientific, Singapore (2004)

    Chapter  Google Scholar 

  4. Huang, X.: A general framework for constructing cooperative global optimization algorithms. In: 4th International Conference on Frontiers in Global Optimization (2003)

    Google Scholar 

  5. Rosenfeld, A., Hummel, R., Zucker, S.: Scene labelling by relaxation operations. IEEE Transactions on System, Man, and Cybernetics SMC-6, 420 (1976)

    Google Scholar 

  6. Hopfield, J.: Neural networks and physical systems with emergent collective computational abilities. Proceedings of the National Academy of Sciences 79, 2554–2558 (1982)

    Article MathSciNet  Google Scholar 

  7. Berrou, C., Glavieux, A., Thitimajshima, P.: Near shannon limit error-correcting coding and decoding: turbo codes. In: Proceedings of the 1993 IEEE International Conference on Communication, pp. 1064–1070 (1993)

    Google Scholar 

  8. Gallager, R.G.: Low-Density Parity-Check Codes. PhD thesis, Department of Electrical Engineering, M.I.T., Cambridge, Mass (1963)

    Google Scholar 

  9. Kschischang, F.R., Frey, B.J., Andrea Loeliger, H.: Factor graphs and the sumproduct algorithm. IEEE Transactions on Information Theory 47, 498–519 (2001)

    Article MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Science and Technology, Tsinghua University, Beijing, P.R. China, 100084

    Xiaofei Huang

Authors
  1. Xiaofei Huang

    You can also search for this author inPubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong Kong

    Lusheng Wang

Rights and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Huang, X. (2005). Global Optimality Conditions and Near-Perfect Optimization in Coding. In: Wang, L. (eds) Computing and Combinatorics. COCOON 2005. Lecture Notes in Computer Science, vol 3595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11533719_92

Download citation

Publish with us


[8]ページ先頭

©2009-2025 Movatter.jp