Abstract
Global convergence indicates whether an algorithm is able to find an optimal or locally optimal solution for a nonlinear optimization problem. The rate of convergence is another mathematical measure which evaluates the computational efficiency of an iterative algorithm.
The really efficient laborer will be found not to crowed his day with work,….
Thoreau
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Du, DZ., Pardalos, P.M., Wu, W. (2001). Efficiency. In: Du, DZ., Pardalos, P.M., Wu, W. (eds) Mathematical Theory of Optimization. Nonconvex Optimization and Its Applications, vol 56. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-5795-8_8
Download citation
DOI: https://doi.org/10.1007/978-1-4757-5795-8_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5202-8
Online ISBN: 978-1-4757-5795-8
eBook Packages: Springer Book Archive