[1] Murtagh, B. A., Saunder, M. A., Appendix A: MINOS5.2, Technical Report SOL 83-20, MINOS 5.0 Users Guide, Sys tems Optimization Laboratory, Dept. Of Operations Re search, Stanford University, CA (1988). [2] Smith, S., Lasdon, L., “Solving large sparse nonlinear pro gramming using GRG”, ORSA Journal on Computing, 4 (1), 2-15 (1992). [3] Drud, A. S., “CONOPT-A large-scale GRG code”, ORSA Journal on Computing, 6 (2), 207 -216 (1994). [4] Lucia, A., Xu, J., “Chemical process optimization using Newton-like methods”, Computers Chem. Engng., 14 (2), 119-138 (1990). [5] Ternet, D. J., Biegler, L. T., “Recent improvements to a multiplier-free reduced Hessian successive quadratic pro gramming algorithm”, Computers Chem. Engng., 22, (7- 8, 963-978 (1998). [6] Vasantharajan, S., Viswanathan, J., Biegler, L. T., “Re duced successive quadratic programming implementation for large-scale optimization problems with smaller degrees of freedom”, Computers Chem. Engng., 14 (8), 907-915 (1990). [7] Polyak, R., “Modified barrier functions (theory and meth ods)”, Mathematical Programming, 54 (2), 177-222 (1992). [8] Vassiliadis, V. S., Floudas, C. A., “The modified barrier function approach for large -scale optimization”, Comput ers Chem. Engng., 21 (8), 855-874 (1997). [9] Vassiliadis, V. S., Brooks, S. A., “Application of the mod ified barrier method in large-scale quadratic programming problems”, Computers Chem. Engng., 22 (9), 1197-1205 (1998). [10] Dembo, R. S., Steihaug, T., “Truncated-Newton algorithms for large-scale unconstrained optimization”, Mathematical Programming, 26 (2), 190-212 (1983). [11] Nash, S. G., Nocedal, J., “A numerical study of the limited memory BFGS method and truncated-Newton method for large scale optimization”, SIAM Journal on Optimization, 1 (2), 358-372 (1991). [12] Pytlak, R., “An efficient algorithm for large-scale nonlin ear programming problems with simple bounds on the vari ables”, SIAM Journal on Optimization, 8 (2), 532-560 (1998). [13] Byrd, R. H., Lu, P., Nocedal, J., Zhu, C., “A limited mem ory algorithm for bound constrained optimization”, SIAM J. Sci. Comput., 16 (4), 1190-2108 (1995). [14] Liang, X. M., Xu, C. X., “A trust region algorithm for bound constrained minimization ”, Optimization, 41 (3), 279-289 (1997). [15] Hock, W., Schittkowski, K., Test Examples for Nonlinear Programming Codes, Springer, Berlin (1981). |