Stochastic Optimization Algorithms

View Sample PDF

Author(s): Pierre Collet (Universite de Strasbourg, France)and Jean-Philippe Rennard (Grenoble Graduate School of Business, France)
Copyright: 2008
Pages: 17
Source title: Intelligent Information Technologies: Concepts, Methodologies, Tools, and Applications
Source Author(s)/Editor(s): Vijayan Sugumaran (Oakland University, Rochester, USA)
DOI: 10.4018/978-1-59904-941-0.ch064

Keywords: Artificial Intelligence / Computer Science & IT / Information Science Reference

Purchase

View Stochastic Optimization Algorithms on the publisher's website for pricing and purchasing information.

Abstract

When looking for a solution, deterministic methods have the enormous advantage that they do find global optima. Unfortunately, they are very CPU intensive, and are useless on untractable NP-hard problems that would require thousands of years for cutting-edge computers to explore. In order to get a result, one needs to revert to stochastic algorithms that sample the search space without exploring it thoroughly. Such algorithms can find very good results, without any guarantee that the global optimum has been reached; but there is often no other choice than using them. This chapter is a short introduction to the main methods used in stochastic optimization.

The IRMA Community

Research IRM

Stochastic Optimization Algorithms

Purchase

Abstract

Related Content

IRMA Sponsors