An algorithm in constrained optimization

  • Nada I. Djuranović-Miličić
Conference paper
Part of the Lecture Notes in Control and Information Sciences book series (LNCIS, volume 84)


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


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Altman M., Generalized Gradient Methods of Minimizing a Functional, Bull. Acad. Polon. Sci. Ser.Sci. Math. Astronom. Phys. 14, pp. 313–318, 1966.Google Scholar
  2. 2.
    Curry H., The Method of Steepest Descent for Nonlinear Nnimization Problems, Quart. Appl. Math., 2, pp 258–261, 1944.Google Scholar
  3. 3.
    Miličić N., O jednoj modifikaciji step-size algoritma, Zbornik radova SYM-OP-IS'83, pp 267–274, Herceg-Novi, 1983.Google Scholar
  4. 4.
    Rauch S.W., Convergence Theory For a Class of Nonlinear Programming Problems, SIAM J. Numer. Anal., vol. 10, No.1, 1973.Google Scholar

Copyright information

© Springer-Verlag 1986

Authors and Affiliations

  • Nada I. Djuranović-Miličić
    • 1
  1. 1.Department of Mathematics Faculty of Technology and MetallurgyUniversity of BelgradeYugoslavia

Personalised recommendations