Constrained convex minimization methods generating regularizing algorithms

DOI10.1134/S0081543826600146MaRDI QIDQ7267944zbMATH OpenFDO

Authors Vladimir Vasin, I. A. Gaĭnova

Publication date 17 June 2026

Published in Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0081543826600146

zbMATH Keywords

convex constraintsconvex minimizationill-posed and improper problemsiterative processregularizing algorithm

Mathematics Subject Classification ID

Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Numerical mathematical programming methods (65K05)

Cites work

• Fejér-type iterative processes in the constrained quadratic minimization problem
• Fixed points of nonexpanding maps
• Hadamard and Tyhonov well-posedness of a certain class of convex functions
• scientific article; zbMATH DE number 4015993 (Why is no real title available?)
• scientific article; zbMATH DE number 3754408 (Why is no real title available?)
• scientific article; zbMATH DE number 41702 (Why is no real title available?)
• scientific article; zbMATH DE number 3802747 (Why is no real title available?)
• scientific article; zbMATH DE number 852525 (Why is no real title available?)
• Ill-posed problems with a priori information
• Monotone Operators and the Proximal Point Algorithm
• Operators and iterative processes of Fejér type. Theory and applications.

This page was built for publication: Constrained convex minimization methods generating regularizing algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7267944)