Abstract
I will in this brief discussion offer critical remarks on the recent comparative experiments of Miele [1], Sandgren [2] and Schittkowski [3]. Because of my closeness to the work of my former doctoral student, Eric Sandgren, it is difficult for me to be completely objective in evaluating his work. I will comment on his work in spite of this obvious bias.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Miele, A., and Gonzalez, S., “On the Comparative Evaluation of Algorithms for Mathematical Programming Problems,” Nonlinear Programming, 3, ed. by Mangasarian, Meyer and Robinson, Academic Press, 1978, pp. 337–359.
Sandgren, E., “The Utility of Nonlinear Programming Algorithms,” Ph.D. Dissertation, Purdue University, Dec. 1977, available from University Microfilm, 300 North Zeeb Road, Ann Arbor, Michigan 48106, USA, document no. 7813115.
Schittkowski, K., Nonlinear Programming Codes Information, Tests, Performance, Lecture Notes in Economics and Mathematical Systems, 183, Springer-Verlag, Berlin, 1980.
Han, S.P., “Superlinear Convergent Variable Metric Algorithms for General Nonlinear Programming Problems,” Mathematical Programming, 11, No. 3, 1976, pp. 263–282.
Saaty, T.L., “A Scaling Method for Priorities in Hierarchical Structures,” J. Math. Psych., 15, 1977, pp. 234–281.
Lootsma, F.A., “Ranking of Nonlinear Optimization Codes According to Efficiency and Robustness,” in Konstruktive Methoden der finiten nichtlinearen Optimierung, ed. Collatz, Meinardus and Wetterling, Birkhauser, Basel Switzerland, 1980.
Eason, E.D. and Fenton, R.G., “A Comparison of Numerical Optimization Methods for Engineering Design,” ASME Journal of Engineering for Industry, Series B, Vol. 96, No. 1, Feb. 1974, pp. 196200.
Sandgren, E. and Ragsdell, K.M., “The Utility of Nonlinear Programming Algorithms: A Comparative Study–Part 1 and 2,” ASME Journal of Mechanical Design, 102, No. 3, pp. 540–551, July 1980.
Fattier, J.E., Sin, Y.T., Root, R.R., Ragsdell, K.M. and Reklaitis, G.V., “On the Computational Utility of Posynomial Geometric Programming Solution Methods,” to appear in Mathematical Programming.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1982 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ragsdell, K.M. (1982). Remarks on the Comparative Experiments of Miele, Sandgren, and Schittkowski. In: Mulvey, J.M. (eds) Evaluating Mathematical Programming Techniques. Lecture Notes in Economics and Mathematical Systems, vol 199. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-95406-1_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-95406-1_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-11495-6
Online ISBN: 978-3-642-95406-1
eBook Packages: Springer Book Archive