Zur Methode der approximierenden Optimierung

Rainer Ernst Burkard; B. Grenser

doi:10.1080/02331887408801145

Zur Methode der approximierenden Optimierung

Rainer Ernst Burkard, B. Grenser

Institute of Discrete Mathematics (5050)

Research output: Contribution to journal › Article › peer-review

Abstract

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 language	German
Pages (from-to)	23-33
Journal	Mathematische Operationsforschung und Statistik
Volume	5
Issue number	1
DOIs	https://doi.org/10.1080/02331887408801145
Publication status	Published - 1974

Access to Document

10.1080/02331887408801145

Cite this

@article{3c943586d9294487ab6029e9422b9400,

title = "Zur Methode der approximierenden Optimierung",

abstract = "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.",

author = "Burkard, {Rainer Ernst} and B. Grenser",

year = "1974",

doi = "10.1080/02331887408801145",

language = "deutsch",

volume = "5",

pages = "23--33",

journal = "Mathematische Operationsforschung und Statistik",

issn = "0047-6277",

number = "1",

}

TY - JOUR

T1 - Zur Methode der approximierenden Optimierung

AU - Burkard, Rainer Ernst

AU - Grenser, B.

PY - 1974

Y1 - 1974

N2 - 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.

AB - 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.

U2 - 10.1080/02331887408801145

DO - 10.1080/02331887408801145

M3 - Artikel

SN - 0047-6277

VL - 5

SP - 23

EP - 33

JO - Mathematische Operationsforschung und Statistik

JF - Mathematische Operationsforschung und Statistik

IS - 1

ER -