On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
From MaRDI portal
Publication:429491
DOI10.1007/S10589-011-9401-7zbMATH Open1244.90155arXiv0912.4367OpenAlexW2066333552MaRDI QIDQ429491FDOQ429491
Authors: Yair Censor, Patrick L. Combettes, Ran Davidi, Gabor T. Herman, Wei Chen 
Publication date: 19 June 2012
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Abstract: The effectiveness of projection methods for solving systems of linear inequalities is investigated. It is shown that they have a computational advantage over some alternatives and that this makes them successful in real-world applications. This is supported by experimental evidence provided in this paper on problems of various sizes (up to tens of thousands of unknowns satisfying up to hundreds of thousands of constraints) and by a discussion of the demonstrated efficacy of projection methods in numerous scientific publications and commercial patents (dealing with problems that can have over a billion unknowns and a similar number of constraints).
Full work available at URL: https://arxiv.org/abs/0912.4367
Recommendations
- scientific article; zbMATH DE number 776085
- An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems
- Projection algorithms for convex feasibility problem
- Under and over projection methods for solving linear inequality systems
- Linear convergence of projection algorithms
optimizationsparse matriceslinear inequalitiesnumerical evaluationprojection methodsconvex feasibility problems
Cites Work
- A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy
- Title not available (Why is that?)
- Fundamentals of Computerized Tomography
- On Projection Algorithms for Solving Convex Feasibility Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Split Bregman Method for L1-Regularized Problems
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Title not available (Why is that?)
- Mathematical methods in image reconstruction
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- The method of projections for finding the common point of convex sets
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- Best approximation in inner product spaces
- Projection and proximal point methods: Convergence results and counterexamples.
- Title not available (Why is that?)
- Accelerating the convergence of the method of alternating projections
- The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
- Hilbertian convex feasibility problem: Convergence of projection methods
- How good are projection methods for convex feasibility problems?
- Decomposition through formalization in a product space
- Averaging strings of sequential iterations for convex feasibility problems.
- On the string averaging method for sparse common fixed-point problems
- Perturbation resilience and superiorization of iterative algorithms
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
- Title not available (Why is that?)
- General Projective Splitting Methods for Sums of Maximal Monotone Operators
- Extrapolation algorithm for affine-convex feasibility problems
- Perturbation-resilient block-iterative projection methods with application to image reconstruction from projections
- Iterative algorithms for large partitioned linear systems, with applications to image reconstruction
- On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning
- Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings
- Strong convergence of projection-like methods in Hilbert spaces
- Improving the speed of convergence in the method of projections onto convex sets
- Efficient controls for finitely convergent sequential algorithms
- On the behavior of a block-iterative projection method for solving convex feasibility problems
- A discrete spherical x-ray transform of orientation distribution functions using bounding cubes
- Title not available (Why is that?)
- On solving linear complementarity problems as linear programs
- Fast image recovery using dynamic load balancing in parallel architectures, by means of incomplete projections
- Title not available (Why is that?)
- Energy-based sensor network source localization via projection onto convex sets
- Pairwise Optimal Weight Realization—Acceleration Technique for Set-Theoretic Adaptive Parallel Subgradient Projection Algorithm
- Demosaicking by Alternating Projections: Theory and Fast One-Step Implementation
- On a relaxation method of solving systems of linear inequalities
- Inherently parallel algorithms in feasibility and optimization and their applications. Research workshop, Haifa, Israel, March 13--16, 2000
- Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems
Cited In (68)
- Projection methods: an annotated bibliography of books and reviews
- Parallel and cyclic hybrid subgradient extragradient methods for variational inequalities
- Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions
- A novel low-cost method for generalized split inverse problem of finite family of demimetric mappings
- A generalized projection-based scheme for solving convex constrained optimization problems
- On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery
- Convex feasibility modeling and projection methods for sparse signal recovery
- A non-interior continuation algorithm for solving the convex feasibility problem
- The hybrid projection algorithm for finding the common fixed points of nonexpansive mappings and the zeroes of maximal monotone operators in Banach spaces
- Faster Randomized Block Kaczmarz Algorithms
- Projected subgradient minimization versus superiorization
- Inertial self-adaptive parallel extragradient-type method for common solution of variational inequality problems
- Common solutions to variational inequalities
- Shrinking extragradient method for pseudomonotone equilibrium problems and quasi-nonexpansive mappings
- Common Solutions to Variational Inequality Problem via Parallel and Cyclic Hybrid Inertial CQ-Subgradient Extragradient Algorithms in (HSs)
- An asynchronous inertial algorithm for solving convex feasibility problems with strict pseudo-contractions in Hilbert spaces
- Tomography
- An explicit algorithm for solving monotone variational inequalities
- Fundamentals of cone regression
- Bounded perturbation resilience and superiorization techniques for a modified proximal gradient method
- A new modified hybrid steepest-descent by using a viscosity approximation method with a weakly contractive mapping for a system of equilibrium problems and fixed point problems with minimization problems
- Split equality monotone variational inclusions and fixed point problem of set-valued operator
- Reconstruction of functions from prescribed proximal points
- Feasibility-based fixed point networks
- String-averaging projected subgradient methods for constrained minimization
- A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems
- Cyclic subgradient extragradient methods for equilibrium problems
- New subgradient extragradient methods for common solutions to equilibrium problems
- Title not available (Why is that?)
- A new self-adaptive accelerated method for generalized split system of common fixed-point problem of averaged mappings
- Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems
- The optimal error bound for the method of simultaneous projections
- Single-projection procedure for linear optimization
- Stochastic block projection algorithms with extrapolation for convex feasibility problems
- How good are extrapolated bi-projection methods for linear feasibility problems?
- A real-time iterative projection scheme for solving the common fixed point problem and its applications
- A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem
- Convergence and perturbation resilience of dynamic string-averaging projection methods
- A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs
- Conic optimization via operator splitting and homogeneous self-dual embedding
- A relaxed projection method for split variational inequalities
- General alternative regularization methods for split equality common fixed-point problem
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods
- On the existence of minimizers of proximity functions for split feasibility problems
- Nonasymptotic convergence of stochastic proximal point algorithms for constrained convex optimization
- Optimization of triangular networks with spatial constraints
- Finding a best approximation pair of points for two polyhedra
- Can linear superiorization be useful for linear optimization problems?
- Computerized tomography with total variation and with shearlets
- Title not available (Why is that?)
- Hybrid projection methods for equilibrium problems with non‐Lipschitz type bifunctions
- Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
- Bounded perturbation resilience and superiorization techniques for the projected scaled gradient method
- On the Finite Convergence of the Douglas--Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces
- Distance majorization and its applications
- Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates
- On the method of reflections
- Incomplete projection algorithms for solving the convex feasibility problem
- Speedup of lexicographic optimization by superiorization and its applications to cancer radiotherapy treatment
- Algorithms for the split variational inequality problem
- New nonasymptotic convergence rates of stochastic proximal point algorithm for stochastic convex optimization
- Split common fixed point problem for demimetric mappings and Bregman relatively nonexpansive mappings
- Three-operator splitting for learning to predict equilibria in convex games
- Strong convergence of over-relaxed multi-parameter proximal scaled gradient algorithm and superiorization
- Choosing the relaxation parameter in sequential block-iterativemethods for linear systems
- Equivalence relations in convex optimization
- Weak and strong convergence adaptive algorithms for generalized split common fixed point problems
- Strong convergence theorem for common zero points of inverse strongly monotone mappings and common fixed points of generalized demimetric mappings
Uses Software
This page was built for publication: On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429491)
