The stable Lagrange principle in sequential form for the convex programming problem in a uniformly convex space and its applications (Q2516400)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The stable Lagrange principle in sequential form for the convex programming problem in a uniformly convex space and its applications
scientific article

    Statements

    The stable Lagrange principle in sequential form for the convex programming problem in a uniformly convex space and its applications (English)
    0 references
    0 references
    0 references
    3 August 2015
    0 references
    The authors extend the stable sequential Kuhn-Tucker theorem approach developed by the second author [Zh. Vychisl. Mat. Mat. Fiz. 51, No. 9, 1594--1615 (2011; Zbl 1274.90266); translation in Comput. Math. Math. Phys. 51, No. 9, 1489--1509 (2011)] for parametric convex programming problems on Hilbert spaces to the more general context of reflexive Banach spaces. To obtain a stability result for the dual variables in the case of problems with a strictly convex objective functional, they first consider a dual regularization method and prove its convergence. As an application, an example consisting in an optimal control problem of a parabolic equation is discussed.
    0 references
    0 references
    parametric convex programming
    0 references
    stable sequential Kuhn-Tucker theorem
    0 references