Preview
Unable to display preview. Download preview PDF.
References
J. Cullum, W. E. Donath and P. Wolfe, An Algorithm for Minimizing Certain Nondifferentiable Convex Functions, I.B.M. Research Report RC 4611, November 6, 1973.
A. M. Geoffrion, Primal Resource-Directive Approaches for Optimizing Nonlinear Decomposable Systems, Operations Research, 18 (1970), pp. 375–403.
P. Huard, Tour d'Horizon: Programmation Non Lineaire, Revue Française de Recherche Operationnelle, 5 R-1 (1971), pp. 3–48.
D. G. Luenberger, Introduction to Linear and Nonlinear Programming, Addison-Wesley Publishing Company Inc., 1973.
G. G. L. Meyer, An Open Loop Method of Feasible Directions for the Sixth Annual Princeton Conference on Information Sciences and Systems (1972), pp. 679–680.
G. G. L. Meyer, "A Drivable Method of Feasible Directions," SIAM J. Control, 11 (1973), pp. 113–118.
E. Polak, Computational Methods in Optimization: A Unified Approach, Academic Press, New York, 1971.
D. M. Topkis and A. Veinott, "On the Convergence of Some Feasible Directions Algorithms for Nonlinear Programming," SIAM J. Control, 5 (1967), pp. 268–279.
W. I. Zangwill, Nonlinear Programming: A Unified Approach, Prentice Hall, Inc., Englewood Cliffs, New Jersey, 1969.
G. Zoutendijk, Methods of Feasible Directions, Elsevier Publishing Co., Amsterdam, 1960.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1978 Springer-Verlag
About this paper
Cite this paper
Meyer, G.G.L. (1978). Methods of feasible directions with increased gradient memory. In: Stoer, J. (eds) Optimization Techniques. Lecture Notes in Control and Information Sciences, vol 7. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0006512
Download citation
DOI: https://doi.org/10.1007/BFb0006512
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08708-3
Online ISBN: 978-3-540-35890-9
eBook Packages: Springer Book Archive