On Projection Algorithms for Solving Convex Feasibility Problems

Authors:
Heinz H. Bauschke;Jonathan M. Borwein
Affiliations:
-;-
Venue:
SIAM Review
Year:
1996

Citing 0
Cited 72

Iterative Averaging of Entropic Projections for Solving Stochastic Convex Feasibility Problems

Computational Optimization and Applications
Iterative Methods of Solving Stochastic Convex Feasibility Problems andApplications

Computational Optimization and Applications
Downward Sets and their separation and approximation properties

Journal of Global Optimization
Learning Additive Models Online with Fast Evaluating Kernels

COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
Computation of symmetric positive definite Toeplitz matrices by the hybrid steepest descent method

Signal Processing
Constrained image recovery in a product space

ICIP '95 Proceedings of the 1995 International Conference on Image Processing (Vol.2)-Volume 2 - Volume 2
Projection Support Vector Machine Generators

Machine Learning
Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces

Journal of Approximation Theory
Finding best approximation pairs relative to two closed convex sets in Hilbert spaces

Journal of Approximation Theory
Efficient Computation of the Hausdorff Distance Between Polytopes by Exterior Random Covering

Computational Optimization and Applications
Online learning over graphs

ICML '05 Proceedings of the 22nd international conference on Machine learning
Algorithms for the quasiconvex feasibility problem

Journal of Computational and Applied Mathematics
The rate of convergence for the cyclic projections algorithm I: angles between convex sets

Journal of Approximation Theory
The rate of convergence for the cyclic projections algorithm II: norms of nonlinear operators

Journal of Approximation Theory
A finite steps algorithm for solving convex feasibility problems

Journal of Global Optimization
Efficient fast stereo acoustic echo cancellation based on pairwise optimal weight realization technique

EURASIP Journal on Applied Signal Processing
On the Mann-type iteration and the convex feasibility problem

Journal of Computational and Applied Mathematics
How good are projection methods for convex feasibility problems?

Computational Optimization and Applications
Parallel algorithms for variational inequalities over the Cartesian product of the intersections of the fixed point sets of nonexpansive mappings

Journal of Approximation Theory
Approximation of common fixed points of an infinite family of nonexpansive mappings in Banach spaces

Computers & Mathematics with Applications
Existence and approximation of solutions for Fredholm equations of the first kind with applications to a linear moment problem

Optimization Methods & Software
The rate of convergence for the cyclic projections algorithm III: Regularity of convex sets

Journal of Approximation Theory
Enlarged cores and bargaining schemes in games with fuzzy coalitions

Fuzzy Sets and Systems
A Deep Monotone Approximation Operator Based on the Best Quadratic Lower Bound of Convex Functions

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Strong convergence theorems for an infinite family of nonexpansive mappings in Banach spaces

Journal of Computational and Applied Mathematics
Hybrid viscosity-like approximation methods for nonexpansive mappings in Hilbert spaces

Computers & Mathematics with Applications
Acoustic feedback cancellation based on weighted adaptive projection subgradient method in hearing aids

Signal Processing
Normalized incremental subgradient algorithm and its application

IEEE Transactions on Signal Processing
A collaborative training algorithm for distributed learning

IEEE Transactions on Information Theory
New iterative scheme with nonexpansive mappings for equilibrium problems and variational inequality problems in Hilbert spaces

Journal of Computational and Applied Mathematics
Algorithms for the quasiconvex feasibility problem

Journal of Computational and Applied Mathematics
Robust reduced-rank adaptive algorithm based on parallel subgradient projection and Krylov subspace

IEEE Transactions on Signal Processing
Adaptive constrained learning in reproducing Kernel Hilbert spaces: the robust beamforming case

IEEE Transactions on Signal Processing
Efficient controls for finitely convergent sequential algorithms

ACM Transactions on Mathematical Software (TOMS)
Minimal infeasible constraint sets in convex integer programs

Journal of Global Optimization
Particle swarm optimization (PSO) for structural damage detection

ASMCSS'09 Proceedings of the 3rd International Conference on Applied Mathematics, Simulation, Modelling, Circuits, Systems and Signals
Nonsmooth penalty and subgradient algorithms to solve the problem of projection onto a polytope

Cybernetics and Systems Analysis
Iterative methods for the computation of fixed points of demicontractive mappings

Journal of Computational and Applied Mathematics
Strong convergence of shrinking projection methods for quasi-φ-nonexpansive mappings and equilibrium problems

Journal of Computational and Applied Mathematics
Functions with prescribed best linear approximations

Journal of Approximation Theory
A note on Solodov and Tseng's methods for maximal monotone mappings

Journal of Computational and Applied Mathematics
Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality

Mathematics of Operations Research
Slow convergence of sequences of linear operators II: Arbitrarily slow convergence

Journal of Approximation Theory
Describing the Result of a Classifier to the End-User: Geometric-based Sensitivity

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Minimization of equilibrium problems, variational inequality problems and fixed point problems

Journal of Global Optimization
Variable target value relaxed alternating projection method

Computational Optimization and Applications
A Parallel Splitting Method for Coupled Monotone Inclusions

SIAM Journal on Control and Optimization
Incremental Subgradients for Constrained Convex Optimization: A Unified Framework and New Methods

SIAM Journal on Optimization
Operator Splittings, Bregman Methods and Frame Shrinkage in Image Processing

International Journal of Computer Vision
Aggregating Large Sets of Probabilistic Forecasts by Weighted Coherent Adjustment

Decision Analysis
The general iterative methods for nonexpansive mappings in Banach spaces

Journal of Global Optimization
Fixed point optimization algorithm and its application to network bandwidth allocation

Journal of Computational and Applied Mathematics
Algorithms for the Split Variational Inequality Problem

Numerical Algorithms
Full length article: Convergence of non-periodic infinite products of orthogonal projections and nonexpansive operators in Hilbert space

Journal of Approximation Theory
Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers

Foundations and Trends® in Machine Learning
On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints

Computational Optimization and Applications
Generalized projections onto convex sets

Journal of Global Optimization
Strong convergence of a general iterative algorithm for equilibrium problems and variational inequality problems

Mathematical and Computer Modelling: An International Journal
Convergence of Krasnoselskii-Mann iterations of nonexpansive operators

Mathematical and Computer Modelling: An International Journal
Modified hybrid steepest-descent methods for variational inequalities and fixed points

Mathematical and Computer Modelling: An International Journal
A superlinearly convergent projection algorithm for solving the convex inequality problem

Operations Research Letters
Hybrid extragradient-like methods for generalized mixed equilibrium problems, systems of generalized equilibrium problems and optimization problems

Journal of Global Optimization
Convex feasibility modeling and projection methods for sparse signal recovery

Journal of Computational and Applied Mathematics
Products of Finitely Many Resolvents of Maximal Monotone Mappings in Reflexive Banach Spaces

SIAM Journal on Optimization
An acceleration scheme for cyclic subgradient projections method

Computational Optimization and Applications
Convergence and perturbation resilience of dynamic string-averaging projection methods

Computational Optimization and Applications
Proximity algorithms for the L1/TV image denoising model

Advances in Computational Mathematics
Two-step projection methods for a system of variational inequality problems in Banach spaces

Journal of Global Optimization
A generalized f-projection method for countable families of weak relatively nonexpansive mappings and the system of generalized Ky Fan inequalities

Journal of Global Optimization
Full length article: Subgradient projection algorithms for convex feasibility problems in the presence of computational errors

Journal of Approximation Theory
Iterative processes for common fixed points of two different families of mappings with applications

Journal of Global Optimization
An infeasible-point subgradient method using adaptive approximate projections

Computational Optimization and Applications

Quantified Score

Hi-index	0.08

Visualization

Abstract

Due to their extraordinary utility and broad applicability in many areas of classical mathematics and modern physical sciences (most notably, computerized tomography), algorithms for solving convex feasibility problems continue to receive great attention. To unify, generalize, and review some of these algorithms, a very broad and flexible framework is investigated. Several crucial new concepts which allow a systematic discussion of questions on behaviour in general Hilbert spaces and on the quality of convergence are brought out. Numerous examples are given.