On the regularity condition in a convex feasibility problem

DOI10.1016/j.na.2008.02.091zbMath1155.90475OpenAlexW2070676921MaRDI QIDQ1001865

Cristina Popîrlan, Ștefan Mărușter

Publication date: 19 February 2009

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.na.2008.02.091

zbMATH Keywords

regularity propertiesconvex feasibility problemprojection algorithms

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Related Items

Regularized algorithms for hierarchical fixed-point problems, Iterative methods for the computation of fixed points of demicontractive mappings

Cites Work

• On the Mann iteration process in a Hilbert space
• Ishikawa and Mann iterative processes with error for nonlinear strongly accretive operator equations
• On the convergence of von Neumann's alternating projection algorithm for two sets
• Ishikawa and Mann iterative process with errors for nonlinear strongly accretive mappings in Banach spaces
• On the Mann-type iteration and the convex feasibility problem
• Strong and weak convergence of the sequence of successive approximations for quasi-nonexpansive mappings
• The Solution by Iteration of Nonlinear Equations in Hilbert Spaces
• On Projection Algorithms for Solving Convex Feasibility Problems
• On the Set of Subsequential Limit Points of Successive Approximations
• The method of projections for finding the common point of convex sets
• On the Mann Iterative Process
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities
• Unnamed Item
• Unnamed Item
• Unnamed Item