Successive approximation technique for a class of large-scale NLP problems and its application to dynamic programming (Q1109685)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Successive approximation technique for a class of large-scale NLP problems and its application to dynamic programming |
scientific article |
Statements
Successive approximation technique for a class of large-scale NLP problems and its application to dynamic programming (English)
0 references
1989
0 references
Two successive approximation techniques are presented for a class of large-scale nonlinear programming problems with decomposable constraints and a class of high-dimensional discrete optimal control problems respectively. It is shown that: (a) the accumulation point of the sequence produced by the first method is a Kuhn-Tucker point if the constraint functions are decomposable and if the uniqueness condition holds; (b) the sequence converges to an optimum solution if the objective function is strictly pseudoconvex and if the constraints functions are decomposable and quasiconcave; and (c) similar conclusions for the second method hold also for a class of discrete optimal control problems under some assumptions.
0 references
successive approximation techniques
0 references
large-scale nonlinear programming
0 references
decomposable constraints
0 references
high-dimensional discrete optimal control
0 references
Kuhn-Tucker point
0 references
nonconvex optimization
0 references