ON DUAL REGULARIZATION IN CONVEX PROGRAMMING IN UNIFORMLY CONVEX SPACE |
3 | |
2013 |
scientific article | 519.85+517.977 | ||
172-180 | convex programming, sequential optimization, minimizing sequence, uniformly convex space, reflexive space, Lagrange principle, Kuhn-Tucker theorem in nondifferential form, duality, regularization |
Uniformly convex reflexive Banach spaces are proposed to be used instead of Hilbert spaces introduced earlier in the dual regularization method for convex programming problems. By an illustrative example of an optimal control problem for a linear parabolic equation, we show a real gain achieved by the use of uniformly convex Banach spaces as spaces of the optimization problem for admissible elements and the operators given by constraints. |
![]() |