Skip to main content
SpringerLink
Log in

An accelerated procedure for solving binary optimization problems

  • Optimization Methods
  • Published:
Journal of Computer and Systems Sciences International Aims and scope

Abstract

The problem of minimization of multiextremal quadratic functional constructed in the state space with binary variables is studied. To accelerate the local field (an analog of the gradient in a continuous space), it is proposed to binarize the matrix based on which the functional is constructed, coarsening its entries in sign to the values 0, ± 1. It is shown that the binarization procedure can be performed in an optimal way such that the calculates direction of the local field coincides with considerable probability with its true direction. The procedure is oriented to solving problems in the configuration space of high dimension, since the binarization of the matrix considerably reduces the required amount of main memory and the computational complexity of the algorithm.

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. J. J. Hopfield, “Neural Networks and Physical Systems with Emergent Collective Computational Abilities,” Proc. Nat. Acad. Sci. U.S.A. 79, 2554–2558 (1982).

    Article  MathSciNet  Google Scholar 

  2. J. J. Hopfield and D. W. Tank, “Neural Computation of Decisions in Optimization Problems,” Biological Cybernetics 52, 141–152 (1986).

    MathSciNet  Google Scholar 

  3. Y. Fu and P. W. Anderson, “Application of Statistical Mechanics to NP-Complete Problems in Combinatorial Optimization,” J. Physics A 19, 1605–1620 (1986).

    Article  MATH  MathSciNet  Google Scholar 

  4. T. Poggio and F. Girosi, “Regularization Algorithms for Learning That are Equivalent to Multilayer Networks,” Science, 247 978–982 (1990).

    Article  MathSciNet  Google Scholar 

  5. S. Mulder and D. A. Wunsch, “Million City Traveling Salesman Problem Solution by Divide and Conquer Clustering and Adaptive Resonance Neural Networks. II,” Neuron Networks 16(5), 827–832 (2003).

    Article  Google Scholar 

  6. B. V. Kryzhanovskii, B. M. Magomedov, and A. L. Mikaelyan, “Interrelation of the Depth of a Local Minimum and the Probability of Its Finding in the Generalized Hopfield model,” Dokl. Akad. Nauk 405(3), 320–324 (2005).

    MathSciNet  Google Scholar 

  7. F. Wu and P. K. S. Tam, “A Neural Network Methodology of Quadratic Optimization,” Int. J. Neural Systems 9(2), 87–93 (1999).

    Article  Google Scholar 

  8. G. Pinkas and R. Dechter, “Improving Connectionist Energy Minimization,” J. Art. Intell. Res. 3((195)), 23–48 (1995).

    Google Scholar 

  9. B. Kryzhanovsky and B. Magomedov, “Application of Domain Neural Network to Optimization Tasks,” Lecture Notes in Computer Science 3697 ICANN’ (2005), pp. 397–403.

  10. B. V. Kryzhanovsky, B. M. Magomedov, and A. B. Fonarev, “On the Probability of Finding Local Minima in Optimization Problems,” in Proceedings of International Joint Conference on Networks IJCNN-06, Vancouver, 5888–5892 (2006).

  11. L. B. Litinskii, “Eigenvalue Problem Approach to Discrete Minimization,” ICANN, LNCS 3697. Warsawa, 2005, pp. 405–410.

  12. A. K. Hartmann and H. Rieger, Optimization Algorithms in Physics (Wiley-VCH, Berlin, 2001).

    Book  Google Scholar 

  13. K. A. Smith, “Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research,” INFORMS J. Computing 11(1), 15–34 (1999).

    Article  MATH  Google Scholar 

  14. G. Joya, M. Atencia, and F. Sandoval, “Hopfield Neural Networks for Optimization: Study of the Different Dynamics,” Neurocomputing 43(1–4), 219–237 (2002).

    Article  MATH  Google Scholar 

  15. L. B. Litinskii and B. M. Magomedov, “Global Minimization of a Quadratic Functional: Neural Networks Approach,” Patt. Rec. Im. Anal. 15(1), 80–82 (2005).

    Google Scholar 

  16. New Optimization Algorithms in Physics, Ed. by A. K. Hartmann and H. Rieger (Wiley-VCH, Berlin, 2004).

    MATH  Google Scholar 

  17. S. Boettecher, “Extremal Optimization for Sherrington-Kirkpatrick Spin Glasses,” Eur. Phys. J. B 46, 501 (2005).

    Article  Google Scholar 

  18. A. Hartmann, “Calculation of Ground States of Four-Dimensional +/− J Ising Spin Glasses,” Phys. Rev. 60, 5135–5138.

  19. D. O. Hebb, The Organization of Behavior (Wiley, New York, 1949).

    Google Scholar 

  20. B. Widrow and Jr. M. E. Hoff, “Adaptive Switching Circuits,” IRE Western Electric Show and Convention Record Part 4, 96–104 (1960).

Download references

Author information

Authors and Affiliations

  1. Institute for Systems Research, Russian Academy of Sciences, ul. Avtozavodskaya 23, Moscow, 109280, Russia

    B. V. Kryzhanovsky & V. M. Kryzhanovsky

Authors
  1. B. V. Kryzhanovsky
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. M. Kryzhanovsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © B.V. Kryzhanovsky, V.M. Kryzhanovsky, 2009, published in Izvestiya Akademii Nauk. Teoriya i Sistemy Upravleniya, 2009, No. 5, pp. 62–68.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kryzhanovsky, B.V., Kryzhanovsky, V.M. An accelerated procedure for solving binary optimization problems. J. Comput. Syst. Sci. Int. 48, 732–738 (2009). https://doi.org/10.1134/S1064230709050074

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1064230709050074

Keywords

Search

Navigation