Zur Methode der approximierenden Optimierung

Research output: Contribution to journalArticlepeer-review


To meet difficulties of convergence and “stepsize-choosing” within the Method of Approximation Programming (MAP) of GRIFFITH and STEWART a modified approximation method for nonlinear programming problems is given. It is proved to be convergent for convex problems. The running times and gained numerical experience is discussed for numerous test problems.
Original languageGerman
Pages (from-to)23-33
JournalMathematische Operationsforschung und Statistik
Issue number1
Publication statusPublished - 1974

Cite this