Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
W. I. Zangwill, Nonlinear Programming: A Unified Approach, Chap. 4, Prentice-Hall, Englewood Cliffs, N.J., 1969.
M. S. Bazaraa and C. M. Shetty, Nonlinear Programming, Chap. 7, Wiley, New York, 1979.
D. G. Luenberger, Linear and Nonlinear Programming, 2nd ed., Chap. 6, Addison-Wesley, Reading, MA, 1984.
H. M. Edwards, Advanced Calculus, Houghton Mifflin, Chap. 9, Boston, MA, 1969.
Rights and permissions
Copyright information
© 2007 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
(2007). General Properties of Algorithms. In: Practical Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-71107-2_3
Download citation
DOI: https://doi.org/10.1007/978-0-387-71107-2_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-71106-5
Online ISBN: 978-0-387-71107-2
eBook Packages: EngineeringEngineering (R0)