A simultaneous projections method for linear inequalities
From MaRDI portal
In this very readable paper, the authors study an iterative method for solving systems of finitely many linear inequalities in finitely many variables. Recently suggested by Censor and Elfving, the algorithm is a variant of Cimmino's method for solving linear systems. Each iterate is a convex combination of the orthogonal projections of its predecessor on the half-spaces defined by the linear inequalities. The authors show that for any starting point the method converges for both consistent and inconsistent systems (to a feasible point in the first case and to a weighted least squares type solution in the second). The method is well suited for implementation on computers capable of performing parallel computation.
Recommendations
- New iterative methods for linear inequalities
- A projection method for least-squares solutions to overdetermined systems of linear inequalities
- scientific article; zbMATH DE number 1112745
- A primal-dual projection method for solving systems of linear inequalities
- scientific article; zbMATH DE number 776085
Cites work
- Convex Analysis
- scientific article; zbMATH DE number 3856876 (Why is no real title available?)
- scientific article; zbMATH DE number 3866537 (Why is no real title available?)
- scientific article; zbMATH DE number 3242808 (Why is no real title available?)
- Linear complementarity problems solvable by A single linear program
- New methods for linear inequalities
- On solving linear complementarity problems as linear programs
- Row-Action Methods for Huge and Sparse Systems and Their Applications
Cited in
(66)- A hybrid algorithm for solving linear inequalities in a least squares sense
- A primal-dual projection method for solving systems of linear inequalities
- An automatic relaxation method for solving interval linear inequalities
- Convergence results for an accelerated nonlinear Cimmino algorithm
- An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems
- On some optimization techniques in image reconstruction from projections
- Parallel application of block-iterative methods in medical imaging and radiation therapy
- On the convergence of Han's method for convex programming with quadratic objective
- A parallel projection method for overdetermined nonlinear systems of equations
- On spherical convergence, convexity, and block iterative projection algorithms in Hilbert space
- New iterative methods for linear inequalities
- Parallel projection methods and the resolution of ill-posed problems
- New contraction methods for linear inequalities
- Block-iterative surrogate projection methods for convex feasibility problems
- Projection with a minimal system of inequalities
- Obtaining simultaneous solutions of linear subsystems of inequalities and duals
- Iterative algorithm for solving a class of convex feasibility problem
- Distributed Fejer processes for systems of linear inequalities and problems of linear programming
- Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems
- A class of methods for solving large convex systems
- Preconditioning projection methods for solving algebraic linear systems
- Fast finite methods for a system of linear inequalities
- A projection method for least-squares solutions to overdetermined systems of linear inequalities
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- A convex programming solution for gate-sizing with pipelining constraints
- Locally polynomial method for solving systems of linear inequalities
- Scalable parallel algorithm for solving non-stationary systems of linear inequalities
- How good are projection methods for convex feasibility problems?
- On the asymptotic behavior of some alternate smoothing series expansion iterative methods
- An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem
- Modified Han algorithm for inconsistent linear inequalities
- Under and over projection methods for solving linear inequality systems
- On perturbed steepest descent methods with inexact line search for bilevel convex optimization
- Conflict Resolution
- scientific article; zbMATH DE number 3844949 (Why is no real title available?)
- scientific article; zbMATH DE number 4149888 (Why is no real title available?)
- On the behavior of a block-iterative projection method for solving convex feasibility problems
- Projection methods for the linear split feasibility problems
- A finite-termination gradient projection method for solving systems of linear inequalities
- scientific article; zbMATH DE number 3945874 (Why is no real title available?)
- scientific article; zbMATH DE number 3970553 (Why is no real title available?)
- scientific article; zbMATH DE number 3991280 (Why is no real title available?)
- scientific article; zbMATH DE number 4104261 (Why is no real title available?)
- scientific article; zbMATH DE number 16987 (Why is no real title available?)
- scientific article; zbMATH DE number 77993 (Why is no real title available?)
- scientific article; zbMATH DE number 4128316 (Why is no real title available?)
- Asymptotically optimal row-action methods for generalized least squares problems
- scientific article; zbMATH DE number 569958 (Why is no real title available?)
- Iterations of parallel convex projections in hilbert spaces
- scientific article; zbMATH DE number 776085 (Why is no real title available?)
- Numerical methods for solving some matrix feasibility problems
- scientific article; zbMATH DE number 4189102 (Why is no real title available?)
- An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms
- Convergence of the multiplicative algebraic reconstruction technique for the inconsistent system of equations
- A successive centralized circumcentered-reflection method for the convex feasibility problem
- On the behaviour of the underrelaxed Hildreth's row-action method for computing projections onto Polyhedra
- Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems
- Centralized circumcentered-reflection method for solving the convex feasibility problem in sparse signal recovery
- Simultaneous incremental gradient method for inconsistent convex optimization problem
- On linear convergence of Landweber-type methods
- A strongly convergent simultaneous cutter method for finding the minimal norm solution to common fixed point problem
- Relaxed outer projections, weighted averages and convex feasibility
- A conjugate gradient algorithm for sparse linear inequalities
- Iterative method for solving the linear feasibility problem
- The _1 solution of linear inequalities
- An alternating projections algorithm for solving linear programs
This page was built for publication: A simultaneous projections method for linear inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q801637)
