Hierarchical problems with applications to mathematical programming with multiple sets split feasibility constraints
From MaRDI portal
Publication:401850
DOI10.1186/1687-1812-2013-283zbMath1476.47087OpenAlexW2014438872WikidataQ59295121 ScholiaQ59295121MaRDI QIDQ401850
Publication date: 27 August 2014
Published in: Fixed Point Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/1687-1812-2013-283
mathematical programmingfixed point problemminimum norm solutionhierarchical problemsmultiple sets split feasibility problemquadratic function programming
Iterative procedures involving nonlinear operators (47J25) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)
Related Items
Variational inequality problems over split fixed point sets of strict pseudo-nonspreading mappings and quasi-nonexpansive mappings with applications ⋮ Mathematical programming for the sum of two convex functions with applications to lasso problem, split feasibility problems, and image deblurring problem ⋮ Mathematical programming with multiple sets split monotone variational inclusion constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A general iterative method for hierarchical variational inequality problems in Hilbert spaces and applications
- Mann type iterative methods for finding a common solution of split feasibility and fixed point problems
- Relaxed extragradient methods for finding minimum-norm solutions of the split feasibility problem
- Fixed point theorems and weak convergence theorems for generalized hybrid mappings in Hilbert spaces
- Strong convergence theorems for maximal monotone operators with nonlinear mappings in Hilbert spaces
- An extragradient method for solving split feasibility and fixed point problems
- Approximating curve and strong convergence of the \(CQ\) algorithm for the split feasibility problem
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- A multiprojection algorithm using Bregman projections in a product space
- An iterative approach to quadratic optimization
- On variable-step relaxed projection algorithm for variational inequalities
- Viscosity approximation methods for nonexpansive mappings
- Strong convergence of a modified iterative algorithm for hierarchical fixed point problems and variational inequalities
- A general iterative method for nonexpansive mappings in Hilbert spaces
- Approximation of common fixed points of a countable family of nonexpansive mappings in a Banach space
- Split feasibility problem for quasi-nonexpansive multi-valued mappings and total asymptotically strict pseudo-contractive mapping
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
- Self-adaptive projection methods for the multiple-sets split feasibility problem
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Iteration methods for convexly constrained ill-posed problems in hilbert space
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- The relaxed CQ algorithm solving the split feasibility problem
- A note on the CQ algorithm for the split feasibility problem
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- An Iteration Formula for Fredholm Integral Equations of the First Kind
