Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem

DOI10.1080/02331934.2011.613166zbMath1296.90119OpenAlexW1987493814MaRDI QIDQ2841142

Yuning Yang, Qingzhi Yang

Publication date: 24 July 2013

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2011.613166

zbMATH Keywords

convex feasibility problemhalfspacealternating projection methodrelaxed technology

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (4)

The extension of the linear inequality method for generalized rational Chebyshev approximation to approximation by general quasilinear functions ⋮ Multivariate approximation by polynomial and generalized rational functions ⋮ Numerical methods for solving some matrix feasibility problems ⋮ General algorithms for split common fixed point problem of demicontractive mappings

Cites Work

• A finitely convergent ``row-action method for the convex feasibility problem
• Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces.
• Inexact implicit methods for monotone general variational inequalities
• Some recent advances in projection-type methods for variational inequalities
• Relaxed Alternating Projection Methods
• A relaxed projection method for variational inequalities
• Cyclic subgradient projections
• A relaxation method for reconstructing objects from noisy X-rays
• On the Goldstein-Levitin-Polyak gradient projection method
• On Projection Algorithms for Solving Convex Feasibility Problems
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• The relaxed CQ algorithm solving the split feasibility problem
• A note on the CQ algorithm for the split feasibility problem

This page was built for publication: Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem