This chapter summarizes a handful of basic principles that permit the exact solution of many optimization problems. Misled by the beautiful examples of elementary calculus, students are disappointed when they cannot solve optimization problems analytically. More experienced scholars know that exact solutions are the exception rather than the rule. However, they cherish these exceptions because they form the basis of most iteration schemes in optimization.
KeywordsCholesterol Covariance Lost Fermat Summing
Unable to display preview. Download preview PDF.
- 1.Arthur D, Vassilvitskii S (2007): k-means++: the advantages of careful seeding. 2007 Symposium on Discrete Algorithms (SODA)Google Scholar
- 6.Ciarlet PG (1989) Introduction to Numerical Linear Algebra and Optimization. Cambridge University Press, CambridgeGoogle Scholar
- 7.de Leeuw J (1994) Block relaxation algorithms in statistics. in Information Systems and Data Analysis, Bock HH, Lenski W, Richter MM, Springer, BerlinGoogle Scholar
- 9.Everitt BS (1977) The Analysis of Contingency Tables. Chapman & Hall, LondonGoogle Scholar
- 12.Hestenes MR (1981) Optimization Theory: The Finite Dimensional Case. Robert E Krieger Publishing, Huntington, NYGoogle Scholar
- 14.Ku HH, Kullback S (1974) Log-linear models in contingency table analysis. Biometrics 10:452-458Google Scholar
- 15.Kuhn HW, Tucker AW (1951) Nonlinear programming. in Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability. University of California Press, Berkeley, pp 481-492Google Scholar