Constraint Aggregation in Infinite-Dimensional Spaces and Applications
An aggregation technique for constraints with values in Hilbert spaces is suggested. The technique allows to replace the original optimization problem by a sequence of subproblems having scalar or finite-dimensional constraints. Application to optimal control, games and stochastic programming are discussed in detail.
|Date of creation:||Aug 1997|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.iiasa.ac.at/Publications/Catalog/PUB_ONLINE.html
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Rockafellar, R. T. & Wets, R. J. -B., 1975. "Stochastic convex programming: Kuhn-Tucker conditions," Journal of Mathematical Economics, Elsevier, vol. 2(3), pages 349-370, December.
- Y.M. Ermoliev & A.V. Kryazhimskii & A. Ruszczynski, 1995. "Constraint Aggregation Principle in Convex Optimization," Working Papers wp95015, International Institute for Applied Systems Analysis.
When requesting a correction, please mention this item's handle: RePEc:wop:iasawp:ir97051. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel)
If references are entirely missing, you can add them using this form.