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.
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
References
Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Belmont (1999)
Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation. Prentice Hall, New Jersey (1989)
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)
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)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.: Optimization by simulated annealing. Science 220, 621–680 (1983)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2013 Springer-Verlag London
About this chapter
Cite this chapter
Bhatnagar, S., Prasad, H., Prashanth, L. (2013). Deterministic Algorithms for Local Search. In: Stochastic Recursive Algorithms for Optimization. Lecture Notes in Control and Information Sciences, vol 434. Springer, London. https://doi.org/10.1007/978-1-4471-4285-0_2
Download citation
DOI: https://doi.org/10.1007/978-1-4471-4285-0_2
Publisher Name: Springer, London
Print ISBN: 978-1-4471-4284-3
Online ISBN: 978-1-4471-4285-0
eBook Packages: EngineeringEngineering (R0)