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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Pardalos, P., Resende, M.: Handbook of Applied Optimization. Oxford University Press, Inc., Oxford (2002)
Huang, X.: A polynomial-time algorithm for solving np-hard problems in practice. SIGACT Newsletter 34, 101–108 (2003)
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)
Huang, X.: A general framework for constructing cooperative global optimization algorithms. In: 4th International Conference on Frontiers in Global Optimization (2003)
Rosenfeld, A., Hummel, R., Zucker, S.: Scene labelling by relaxation operations. IEEE Transactions on System, Man, and Cybernetics SMC-6, 420 (1976)
Hopfield, J.: Neural networks and physical systems with emergent collective computational abilities. Proceedings of the National Academy of Sciences 79, 2554–2558 (1982)
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)
Gallager, R.G.: Low-Density Parity-Check Codes. PhD thesis, Department of Electrical Engineering, M.I.T., Cambridge, Mass (1963)
Kschischang, F.R., Frey, B.J., Andrea Loeliger, H.: Factor graphs and the sumproduct algorithm. IEEE Transactions on Information Theory 47, 498–519 (2001)
Author information
Authors and Affiliations
School of Information Science and Technology, Tsinghua University, Beijing, P.R. China, 100084
Xiaofei Huang
- Xiaofei Huang
You can also search for this author inPubMed Google Scholar
Editor information
Editors and Affiliations
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
Publisher Name:Springer, Berlin, Heidelberg
Print ISBN:978-3-540-28061-3
Online ISBN:978-3-540-31806-4
eBook Packages:Computer ScienceComputer Science (R0)
Share this paper
Anyone you share the following link with will be able to read this content:
Sorry, a shareable link is not currently available for this article.
Provided by the Springer Nature SharedIt content-sharing initiative