What Is Optimization Toolbox?

Selected Bibliography[24] Han, S.P., “A Globally Convergent Method for Nonlinear Programming,”J. Optimization Theory and Applications, Vol. 22, p. 297, 1977.[25] Hock, W. and K. Schittkowski, “A Comparative Performance Evaluationof 27 Nonlinear Programming Codes,” Computing, Vol. 30, p. 335, 1983.[26] Hollingdale, S.H., Methods of Operational Analysis in Newer Uses ofMathematics (James Lighthill, ed.), Penguin Books, 1978.[27] Levenberg, K., “A Method for the Solution of Certain Problems in LeastSquares,” Quart. Appl. Math. Vol. 2, pp 164-168, 1944.[28] Madsen, K. and H. Schjaer-Jacobsen, “Algorithms for Worst CaseTolerance Optimization,” IEEE Transactions of Circuits and Systems, Vol.CAS-26, Sept. 1979.[29] Marquardt, D., “An Algorithm for Least-Squares Estimation of NonlinearParameters,” SIAM J. Appl. Math. Vol. 11, pp 431-441, 1963.[30] Moré, J.J., “The Levenberg-Marquardt Algorithm: Implementation andTheory,” Numerical Analysis, ed. G. A. Watson, Lecture Notes in Mathematics630, Springer Verlag, pp 105-116, 1977.[31] NAG Fortran Library Manual, Mark 12, Vol. 4, E04UAF, p. 16.[32] Nelder, J.A. and R. Mead, “A Simplex Method for Function Minimization,”Computer J., Vol.7, pp 308-313, 1965.[33] Nocedal, J. and S.J. Wright, Numerical Optimization, Springer Series inOperations Research, Springer Verlag, 1999.[34] Powell, M.J.D., “The Convergence of Variable Metric Methods forNonlinearly Constrained Optimization Calculations,” Nonlinear Programming3, (O.L. Mangasarian, R.R. Meyer and S.M. Robinson, eds.), Academic Press,1978.[35] Powell, M.J.D., “A Fast Algorithm for Nonlinearly ConstrainedOptimization Calculations,” Numerical Analysis, G.A.Watsoned.,LectureNotes in Mathematics, Springer Verlag, Vol. 630, 1978.3-55