Stable iterative Lagrange principle in convex programming as a tool for solving unstable problems (Q2357119)

From MaRDI portal
Revision as of 23:38, 13 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Stable iterative Lagrange principle in convex programming as a tool for solving unstable problems
scientific article

    Statements

    Stable iterative Lagrange principle in convex programming as a tool for solving unstable problems (English)
    0 references
    0 references
    0 references
    19 June 2017
    0 references
    The authors consider a special class of convex optimization problems in Hilbert spaces. The problems involve a strongly convex goal function, both equality and inequality constraints with parameters and admit perturbations of all the functions. The authors analyse the dual function and its sub-differential defining the corresponding Lagrange multipliers. They consider the usual and iterative regularization methods for the perturbed dual problem and prove different convergence properties depending on solvability of the non-perturbed dual problem. Besides, certain concordance rules for perturbations and regularization parameters are necessary. The approach is illustrated by application to a Fredholm integral equation.
    0 references
    convex optimization
    0 references
    Hilbert spaces
    0 references
    perturbed optimization problems
    0 references
    iterative regularization
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references