Generalized Reduced Gradient Software for Linearly and Nonlinearly Constrained Problems
暂无分享,去创建一个
[1] Leon S. Lasdon,et al. Design and Testing of a Generalized Reduced Gradient Code for Nonlinear Programming , 1978, TOMS.
[2] B. A. Murtagh,et al. Nonlinear Programming for Large, Sparse Systems , 1976 .
[3] D. Himmelblau,et al. A new method for nonlinearly constrained optimization , 1975 .
[4] Richard P. Brent,et al. Reducing the retrieval time of scatter storage techniques , 1973, Commun. ACM.
[5] E. Polak,et al. Computational methods in optimization : a unified approach , 1972 .
[6] David Mautner Himmelblau,et al. Applied Nonlinear Programming , 1972 .
[7] Eli Hellerman,et al. Reinversion with the preassigned pivot procedure , 1971, Math. Program..
[8] D. Goldfarb. Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints , 1969 .
[9] Gene H. Golub,et al. The simplex method of linear programming using LU decomposition , 1969, Commun. ACM.
[10] Michael A. Saunders,et al. A FAST, STABLE IMPLEMENTATION OF THE SIMPLEX METHOD USING BARTELS-GOLUB UPDATING , 1976 .
[11] D. Luenberger,et al. Efficiently Converging Minimization Methods Based on the Reduced Gradient , 1976 .
[12] Eli Hellerman,et al. The Partitioned Preassigned Pivot Procedure (P4) , 1972 .
[13] James E. Kalan. Aspects of large-scale in-core linear programming , 1971, ACM '71.
[14] R. Fletcher,et al. A New Approach to Variable Metric Algorithms , 1970, Comput. J..
[15] C. M. Reeves,et al. Function minimization by conjugate gradients , 1964, Comput. J..