On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
From MaRDI portal
Publication:429491
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).
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
Cites work
- scientific article; zbMATH DE number 3539991 (Why is no real title available?)
- scientific article; zbMATH DE number 1145160 (Why is no real title available?)
- scientific article; zbMATH DE number 2064237 (Why is no real title available?)
- scientific article; zbMATH DE number 1489799 (Why is no real title available?)
- scientific article; zbMATH DE number 2182576 (Why is no real title available?)
- scientific article; zbMATH DE number 1382772 (Why is no real title available?)
- scientific article; zbMATH DE number 1894728 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3229228 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- scientific article; zbMATH DE number 3027894 (Why is no real title available?)
- A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces
- A discrete spherical x-ray transform of orientation distribution functions using bounding cubes
- A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy
- Accelerating the convergence of the method of alternating projections
- Averaging strings of sequential iterations for convex feasibility problems.
- Best approximation in inner product spaces
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
- Decomposition through formalization in a product space
- Demosaicking by Alternating Projections: Theory and Fast One-Step Implementation
- Efficient controls for finitely convergent sequential algorithms
- Energy-based sensor network source localization via projection onto convex sets
- Extrapolation algorithm for affine-convex feasibility problems
- Fast image recovery using dynamic load balancing in parallel architectures, by means of incomplete projections
- Fundamentals of Computerized Tomography
- General Projective Splitting Methods for Sums of Maximal Monotone Operators
- Hilbertian convex feasibility problem: Convergence of projection methods
- How good are projection methods for convex feasibility problems?
- Improving the speed of convergence in the method of projections onto convex sets
- Inherently parallel algorithms in feasibility and optimization and their applications. Research workshop, Haifa, Israel, March 13--16, 2000
- Iterative algorithms for large partitioned linear systems, with applications to image reconstruction
- Mathematical methods in image reconstruction
- Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems
- On Projection Algorithms for Solving Convex Feasibility Problems
- On a relaxation method of solving systems of linear inequalities
- On solving linear complementarity problems as linear programs
- On the behavior of a block-iterative projection method for solving convex feasibility problems
- On the string averaging method for sparse common fixed-point problems
- On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning
- Pairwise Optimal Weight Realization—Acceleration Technique for Set-Theoretic Adaptive Parallel Subgradient Projection Algorithm
- Perturbation resilience and superiorization of iterative algorithms
- Perturbation-resilient block-iterative projection methods with application to image reconstruction from projections
- Projection and proximal point methods: Convergence results and counterexamples.
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Strong convergence of projection-like methods in Hilbert spaces
- Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- The Split Bregman Method for L1-Regularized Problems
- The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space
- The method of projections for finding the common point of convex sets
Cited in
(68)- Strong convergence of over-relaxed multi-parameter proximal scaled gradient algorithm and superiorization
- Split common fixed point problem for demimetric mappings and Bregman relatively nonexpansive mappings
- Equivalence relations in convex optimization
- Three-operator splitting for learning to predict equilibria in convex games
- Strong convergence theorem for common zero points of inverse strongly monotone mappings and common fixed points of generalized demimetric mappings
- New nonasymptotic convergence rates of stochastic proximal point algorithm for stochastic convex optimization
- Weak and strong convergence adaptive algorithms for generalized split common fixed point problems
- Choosing the relaxation parameter in sequential block-iterative methods for linear systems
- Optimization of triangular networks with spatial constraints
- Parallel and cyclic hybrid subgradient extragradient methods for variational inequalities
- Projection methods: an annotated bibliography of books and reviews
- A stochastic approximation method for approximating the efficient frontier of chance-constrained nonlinear programs
- Feasibility-based fixed point networks
- A relaxed projection method for split variational inequalities
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods
- On the existence of minimizers of proximity functions for split feasibility problems
- 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
- General alternative regularization methods for split equality common fixed-point problem
- A modified parallel hybrid subgradient extragradient method for finding common solutions of variational inequality problems
- Faster randomized block Kaczmarz algorithms
- Bounded perturbation resilience and superiorization techniques for the projected scaled gradient method
- Distance majorization and its applications
- New subgradient extragradient methods for common solutions to equilibrium problems
- Tomography
- Projected subgradient minimization versus superiorization
- Randomized projection methods for convex feasibility: conditioning and convergence rates
- Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
- Speedup of lexicographic optimization by superiorization and its applications to cancer radiotherapy treatment
- 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
- Nonasymptotic convergence of stochastic proximal point methods for constrained convex optimization
- String-averaging projected subgradient methods for constrained minimization
- A generalized projection-based scheme for solving convex constrained optimization problems
- A new self-adaptive accelerated method for generalized split system of common fixed-point problem of averaged mappings
- On the method of reflections
- Common solutions to variational inequalities
- On the finite convergence of the Douglas-Rachford algorithm for solving (not necessarily convex) feasibility problems in Euclidean spaces
- Inertial self-adaptive parallel extragradient-type method for common solution of variational inequality problems
- The optimal error bound for the method of simultaneous projections
- Common solutions to variational inequality problem via parallel and cyclic hybrid inertial CQ-subgradient extragradient algorithms in (HSs)
- Hybrid projection methods for equilibrium problems with non-Lipschitz type bifunctions
- How good are extrapolated bi-projection methods for linear feasibility problems?
- An asynchronous inertial algorithm for solving convex feasibility problems with strict pseudo-contractions in Hilbert spaces
- Split equality monotone variational inclusions and fixed point problem of set-valued operator
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Bounded perturbation resilience and superiorization techniques for a modified proximal gradient method
- Approximation of solutions of split inverse problem for multi-valued demi-contractive mappings in Hilbert spaces
- The hybrid projection algorithm for finding the common fixed points of nonexpansive mappings and the zeroes of maximal monotone operators in Banach spaces
- Shrinking extragradient method for pseudomonotone equilibrium problems and quasi-nonexpansive mappings
- Finding a best approximation pair of points for two polyhedra
- A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems
- An explicit algorithm for solving monotone variational inequalities
- On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery
- Cyclic subgradient extragradient methods for equilibrium problems
- Convex feasibility modeling and projection methods for sparse signal recovery
- Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems
- Can linear superiorization be useful for linear optimization problems?
- Computerized tomography with total variation and with shearlets
- Single-projection procedure for linear optimization
- A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem
- Reconstruction of functions from prescribed proximal points
- Convergence and perturbation resilience of dynamic string-averaging projection methods
- Fundamentals of cone regression
- Stochastic block projection algorithms with extrapolation for convex feasibility problems
- Incomplete projection algorithms for solving the convex feasibility problem
- A real-time iterative projection scheme for solving the common fixed point problem and its applications
- A non-interior continuation algorithm for solving the convex feasibility problem
- Algorithms for the split variational inequality problem
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)
