Iterative schemes for convex minimization problems with constraints

From MaRDI portal





Summary: We first introduce and analyze one implicit iterative algorithm for finding a solution of the minimization problem for a convex and continuously Fréchet differentiable functional, with constraints of several problems: the generalized mixed equilibrium problem, the system of generalized equilibrium problems, and finitely many variational inclusions in a real Hilbert space. We prove strong convergence theorem for the iterative algorithm under suitable conditions. On the other hand, we also propose another implicit iterative algorithm for finding a fixed point of infinitely many nonexpansive mappings with the same constraints, and derive its strong convergence under mild assumptions.



Cites work









This page was built for publication: Iterative schemes for convex minimization problems with constraints

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