Convergence Analysis of Parametric Optimization Methods

  • Abhijit Gosavi
Part of the Operations Research/Computer Science Interfaces Series book series (ORCS, volume 25)


This chapter deals with some simple convergence results related to the parametric optimization methods discussed in Chapter 7. The main idea underlying “convergence analysis” of a method is to identify (mathematically) the solution to which the method converges. Hence to prove that an algorithm works, one must show that the algorithm converges to the optimal solution. In this chapter, this is precisely what we will attempt to do with some algorithms of Chapter 7.


Markov Chain Simulated Annealing Stationary Point Gradient Descent Convergence Analysis 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2003

Authors and Affiliations

  • Abhijit Gosavi
    • 1
  1. 1.Department of Industrial EngineeringThe State University of New YorkBuffaloUSA

Personalised recommendations