Abstract
In this paper we cosider a constrained version of a modification of the Curry-Altman step-size algorithm. This modification of the Curry-Altman algorithm (see
Preview
Unable to display preview. Download preview PDF.
References
Altman M., Generalized Gradient Methods of Minimizing a Functional, Bull. Acad. Polon. Sci. Ser.Sci. Math. Astronom. Phys. 14, pp. 313–318, 1966.
Curry H., The Method of Steepest Descent for Nonlinear Nnimization Problems, Quart. Appl. Math., 2, pp 258–261, 1944.
Miličić N., O jednoj modifikaciji step-size algoritma, Zbornik radova SYM-OP-IS'83, pp 267–274, Herceg-Novi, 1983.
Rauch S.W., Convergence Theory For a Class of Nonlinear Programming Problems, SIAM J. Numer. Anal., vol. 10, No.1, 1973.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag
About this paper
Cite this paper
Djuranović-Miličić, N.I. (1986). An algorithm in constrained optimization. In: Prékopa, A., Szelezsáan, J., Strazicky, B. (eds) System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 84. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0043840
Download citation
DOI: https://doi.org/10.1007/BFb0043840
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16854-6
Online ISBN: 978-3-540-47138-7
eBook Packages: Springer Book Archive