A convergence proof of a special version of the generalized reduced gradient method (GRGS)

 Access to full text

 Full (PDF)

1. [1] ABADIE J. and CARPENTIER J., « Generalization of the Wolfe Reduced Gradient Method to the Case of Nonlinear Constraints » in Optimization, Academie PressInc., London, 1969. Zbl0254.90049
2. [2] ABADIE J. and GUIGOU J., « Numerical Experiments with the GRG Method » in Integer and Nonlinear Programming North-Holland Publishing Companyand American Elsevier Publishing Company, 1970. Zbl0331.65041MR437059
3. [3] ABADIE J., Private Communication, June 1973. 
4. [4] BERGE C., Espaces Topologiques et Fonctions Multivoques>, Dunod, Paris, 1959. Zbl0164.52902MR105663
5. [5] COLVILLE A. R., A Comparative Study on Nonlinear Programming Code, IBM - New York Scientific Center, Report No. 320.2949, June 1968. Zbl0224.90069
6. [6] GOCHET W., LOUTE E. and SOLOW D., Comparative Computer Results of ThreeAlgorithms for Solving Prototype Geometric Programming Problems, (to bepublished in CERO). Zbl0294.90082
7. [7] SHAFTEL T. L., SMEERS Y. M. and THOMPSON G. L., A Simplex-Like Approach for Nonlinear Programs with Nonlinear Constraints,MSR Report No. 285.Carnegie Mellon University, Pittsburgh, July 1972. 
8. [8] SMEERS Y. M., A Convergence Proof for Shaftel and Thompson's Modular Design Algorithm, C.O.R.E. Discussion Paper No. 7332, Université Catholique-de Louvain, August 1973. 
9. [9] ZANGWILL W., The Convex-Simplex Method, Management Science, Vol. 14,pp. 221-238, 1, 1967. Zbl0153.49002MR269300
10. [10] ZANGWILL W., Nonlinear Programming : A Unified Approach, Prentice-Hall Inc., Englewood Cliffs, New Jersey, 1969. Zbl0195.20804MR359816