Steered sequential projections for the inconsistent convex feasibility problem

DOI10.1016/J.NA.2004.07.018zbMath1113.90120OpenAlexW2136607915MaRDI QIDQ1888607

Maroun Zaknoon, Yair Censor, Alvaro Rodolfo de Pierro

Publication date: 26 November 2004

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.2004.07.018

Mathematics Subject Classification ID

Convex programming (90C25) Iterative procedures involving nonlinear operators (47J25) Fixed-point theorems (47H10) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Methods of reduced gradient type (90C52)

Related Items (8)

Dual averaging with adaptive random projection for solving evolving distributed optimization problems ⋮ Convergence of the multiplicative algebraic reconstruction technique for the inconsistent system of equations ⋮ On the behaviour of the underrelaxed Hildreth's row-action method for computing projections onto Polyhedra ⋮ Numerical methods for solving some matrix feasibility problems ⋮ From convex feasibility to convex constrained optimization using block action projection methods and underrelaxation ⋮ On linear infeasibility arising in intensity-modulated radiation therapy inverse planning ⋮ Incremental Constraint Projection Methods for Monotone Stochastic Variational Inequalities ⋮ The method of cyclic projections for closed convex sets in a Hilbert space under the presence of computational errors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Successive projections on hyperplanes
• Strong underrelaxation in Kaczmarz's method for inconsistent systems
• Approximation of fixed points of nonexpansive mappings
• Approximate iterations in Bregman-function-based proximal algorithms
• A practical general approximation criterion for methods of multipliers based on Bregman distances
• Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
• On products of projections
• The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
• An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
• Incremental Subgradient Methods for Nondifferentiable Optimization
• A New Class of Incremental Gradient Methods for Least Squares Problems
• Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings
• Gradient Convergence in Gradient methods with Errors
• On Projection Algorithms for Solving Convex Feasibility Problems
• The method of projections for finding the common point of convex sets
• Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback--Leibler distance minimization

This page was built for publication: Steered sequential projections for the inconsistent convex feasibility problem