General Properties of Algorithms


In Chap. 1, an optimization algorithm has been informally introduced as a sequence of steps that can be executed repeatedly in order to obtain a series of progressively improved solutions, starting with an initial estimate of the solution. In this chapter, a more formal and mathematical description of an algorithm will be supplied and some fundamental concepts pertaining to all algorithms in general will be studied.


General Property Initial Point Limit Point Global Convergence Nonlinear Program 
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.


  1. 1.
    W. I. Zangwill, Nonlinear Programming: A Unified Approach, Chap. 4, Prentice-Hall, Englewood Cliffs, N.J., 1969.MATHGoogle Scholar
  2. 2.
    M. S. Bazaraa and C. M. Shetty, Nonlinear Programming, Chap. 7, Wiley, New York, 1979.MATHGoogle Scholar
  3. 3.
    D. G. Luenberger, Linear and Nonlinear Programming, 2nd ed., Chap. 6, Addison-Wesley, Reading, MA, 1984.MATHGoogle Scholar
  4. 4.
    H. M. Edwards, Advanced Calculus, Houghton Mifflin, Chap. 9, Boston, MA, 1969.Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2007

Personalised recommendations