Constraint Aggregation in Infinite-Dimensional Spaces and Applications

An aggregation technique for constraints with values in Hilbert spaces is suggested. The technique allows us to replace the original optimization problem by a sequence of subproblems having scalar or finite-dimensional constraints. Applications to optimal control, games, and stochastic programming are discussed in detail.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.