An intermixed iteration for constrained convex minimization problem and split feasibility problem

DOI10.1186/s13660-019-2222-4zbMath1499.47029OpenAlexW2980410450MaRDI QIDQ2068052

Kanyanee Saechou, Atid Kangtunyakarn

Publication date: 19 January 2022

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/s13660-019-2222-4

zbMATH Keywords

strong convergencevariational inequalityconstrained convex minimization problemsplit feasibility problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Variational inequalities (49J40) Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)

Related Items

An iterative method for solving split monotone variational inclusion problems and finite family of variational inequality problems in Hilbert spaces

Cites Work

• Unnamed Item
• Unnamed Item
• An intermixed algorithm for strict pseudo-contractions in Hilbert spaces
• A new iterative algorithm for the set of fixed-point problems of nonexpansive mappings and the set of equilibrium problem and variational inequality problem
• Some iterative methods for finding fixed points and for solving constrained convex minimization problems
• Weak and strong convergence theorems for nonspreading-type mappings in Hilbert spaces
• An extragradient method for solving split feasibility and fixed point problems
• A multiprojection algorithm using Bregman projections in a product space
• An iterative approach to quadratic optimization
• Iterative algorithm of common solutions for a constrained convex minimization problem, a quasi-variational inclusion problem and the fixed point problem of a strictly pseudo-contractive mapping
• A general iterative method for nonexpansive mappings in Hilbert spaces
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• Projection methods for variational inequalities with application to the traffic assignment problem
• STRONG CONVERGENCE OF NEW VISCOSITY RULES OF NONEXPANSIVE MAPPINGS
• General iterative methods for equilibrium and constrained convex minimization problem
• Variational inequalities
• Weak convergence of the sequence of successive approximations for nonexpansive mappings

This page was built for publication: An intermixed iteration for constrained convex minimization problem and split feasibility problem