Advertisement

Deterministic Algorithms for Local Search

  • S. BhatnagarEmail author
  • H. Prasad
  • L. Prashanth
Chapter
Part of the Lecture Notes in Control and Information Sciences book series (LNCIS, volume 434)

Abstract

Most algorithms for stochastic optimization can be viewed as noisy versions of well-known incremental update deterministic optimization algorithms. Hence, we review in this chapter, some of the well-known algorithms for deterministic optimization. We shall study the noisy versions of these algorithms in later chapters.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Belmont (1999)zbMATHGoogle Scholar
  2. 2.
    Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation. Prentice Hall, New Jersey (1989)zbMATHGoogle Scholar
  3. 3.
    Bhatnagar, S.: Adaptive multivariate three-timescale stochastic approximation algorithms for simulation based optimization. ACM Transactions on Modeling and Computer Simulation 15(1), 74–107 (2005)CrossRefGoogle Scholar
  4. 4.
    Gelfand, S.B., Mitter, S.K.: Recursive stochastic algorithms for global optimization in \({\cal R}^{d_*}\). SIAM Journal on Control and Optimization 29(5), 999–1018 (1991)MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Kirkpatrick, S., Gelatt, C.D., Vecchi, M.: Optimization by simulated annealing. Science 220, 621–680 (1983)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag London 2013

Authors and Affiliations

  1. 1.Department of Computer Science and AutomationIndian Institute of ScienceBangaloreIndia

Personalised recommendations