Abstract
(N ×N)-matrix is called additive when its elements are pair-wise sums of N real numbers a i . For a quadratic binary functional with an additive connection matrix we succeeded in finding the global minimum expressing it through external parameters of the problem. Computer simulations show that energy surface of a quadratic binary functional with an additive matrix is complicate enough.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hartmann, A.K., Rieger, H. (eds.): New optimization algorithms in physics. Wiley-VCH, Berlin (2004)
Junger, M.: The Spin Glass Ground State Server, http://www.informatik.uni-koeln.de/ls_juenger/research/sgs/sgs.html
Hertz, J., Krogh, A., Palmer, R.: Introduction to the Theory of Neural Computation. Addison-Wesley, NY (1991)
Kryzhanovsky, B.V., Magomedov, B.M., Mikaelyan, A.L.: A Relation between the Depth of a Local Minimum and the Probability of Its Detection in the Generalized Hopfield Model. Doklady Mathematics 72(3), 986–990 (2005)
Kryzhanovsky, B.V., Kryzhanovsky, V.M., Mikaelian, A.L.: Binary optimization: A relation between the depth of a local minimum and the probability of its detection. In: 4th International Conference on Informatics in Control, Automation and Robotics, ICINCO 2007, Anger, France, pp. 5–10 (2007)
Litinskii, L.B.: High-symmetry Hopfield-type neural networks. Theoretical and Mathematical Physics 118(1), 107–127 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Litinskii, L. (2009). Minimization of Quadratic Binary Functional with Additive Connection Matrix. In: Alippi, C., Polycarpou, M., Panayiotou, C., Ellinas, G. (eds) Artificial Neural Networks – ICANN 2009. ICANN 2009. Lecture Notes in Computer Science, vol 5768. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04274-4_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-04274-4_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04273-7
Online ISBN: 978-3-642-04274-4
eBook Packages: Computer ScienceComputer Science (R0)