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

DOI10.1186/S13660-019-2222-4MaRDI QIDQ2068052zbMATH OpenOpenAlexFDO

Authors Kanyanee Saechou, Atid Kangtunyakarn

Publication date 19 January 2022

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

constrained convex minimization problemsplit feasibility problemstrong convergencevariational inequality

Mathematics Subject Classification ID

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

Recommendations

• Iterative scheme for finding solutions of the general split feasibility problem and the general constrained minimization problems
• An iterative algorithm for fixed point problem and convex minimization problem with applications
• Modified intermixed iteration for solving the split general system of variational inequality problems and applications
• An iterative method for equilibrium and constrained convex minimization problems
• The hybrid steepest descent method for split variational inclusion and constrained convex minimization problems

Cites work

• A general iterative method for nonexpansive mappings in Hilbert spaces
• A multiprojection algorithm using Bregman projections in a product space
• A new iterative algorithm for the set of fixed-point problems of nonexpansive mappings and the set of equilibrium problem and variational inequality problem
• An extragradient method for solving split feasibility and fixed point problems
• An intermixed algorithm for strict pseudo-contractions in Hilbert spaces
• An iterative approach to quadratic optimization
• General iterative methods for equilibrium and constrained convex minimization problem
• scientific article; zbMATH DE number 6921240 (Why is no real title available?)
• 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
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• Nonlinear functional analysis. Fixed point theory and its applications
• Projection methods for variational inequalities with application to the traffic assignment problem
• Some iterative methods for finding fixed points and for solving constrained convex minimization problems
• Strong convergence of new viscosity rules of nonexpansive mappings
• Variational inequalities
• Weak and strong convergence theorems for nonspreading-type mappings in Hilbert spaces
• Weak convergence of the sequence of successive approximations for nonexpansive mappings

Cited in

(3)

• An iterative method for solving split monotone variational inclusion problems and finite family of variational inequality problems in Hilbert spaces
• The approximate solution of the general split variational inequality problem by intermixed iteration
• A three-intermixed algorithm for common fixed point problems with applications to convex optimization and network allocation

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

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