What Is Optimization Toolbox?

Selected BibliographySelected Bibliography[1] Biggs, M.C., “Constrained Minimization Using Recursive QuadraticProgramming,” Towards Global Optimization (L.C.W. Dixon and G.P. Szergo,eds.), North-Holland, pp 341-349, 1975.[2] Brayton, R.K., S.W. Director, G.D. Hachtel, and L. Vidigal, “A NewAlgorithm for Statistical Circuit Design Based on Quasi-Newton Methods andFunction Splitting,” IEEE Transactions on Circuits and Systems, Vol. CAS-26,pp 784-794, Sept. 1979.[3] Broyden, C.G., “The Convergence of a Class of Double-rank MinimizationAlgorithms,”; J.Inst.Maths.Applics., Vol. 6, pp 76-90, 1970.[4] Censor, Y., “Pareto Optimality in Multiobjective Problems,” Appl. Math.Optimiz., Vol. 4, pp 41-59, 1977.[5] Conn, N.R., N.I.M. Gould, and Ph.L. Toint, Trust-Region Methods,MPS/SIAM Series on Optimization, SIAM and MPS, 2000.[6] Da Cunha, N.O. and E. Polak, “Constrained Minimization UnderVector-valued Criteria in Finite Dimensional Spaces,” J. Math. Anal. Appl.,Vol. 19, pp 103-124, 1967.[7] Dantzig, G., Linear Programming and Extensions, Princeton UniversityPress, Princeton, 1963.[8] Dantzig, G., A. Orden, and P. Wolfe, “Generalized Simplex Method forMinimizing a Linear from Under Linear Inequality Constraints,” Pacific J.Math. Vol. 5, pp 183-195.[9] Davidon, W.C., “Variable Metric Method for Minimization,” A.E.C.Research and Development Report, ANL-5990, 1959.[10] Dennis, J.E., Jr., “Nonlinear least-squares,” State of the Art in NumericalAnalysis ed. D. Jacobs, Academic Press, pp 269-312, 1977.[11] Dennis, J.E., Jr. and R.B. Schnabel, Numerical Methods forUnconstrained Optimization and Nonlinear Equations, Prentice-Hall Seriesin Computational Mathematics, Prentice-Hall, 1983.3-53