New methods for linear inequalities

DOI10.1016/0024-3795(82)90149-5MaRDI QIDQ1162118zbMATH OpenOpenAlexFDO

Authors Yair Censor, T. Elfving

Publication date 1982

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0024-3795(82)90149-5

zbMATH Keywords

convergenceCimmino schemeRichardson-type iterative method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Cites work

• scientific article; zbMATH DE number 3856876 (Why is no real title available?)
• scientific article; zbMATH DE number 3499148 (Why is no real title available?)
• scientific article; zbMATH DE number 3554931 (Why is no real title available?)
• scientific article; zbMATH DE number 3257775 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• scientific article; zbMATH DE number 3388525 (Why is no real title available?)
• scientific article; zbMATH DE number 3027894 (Why is no real title available?)
• Characterization of linear stationary iterative processes for solving a singular system of linear equations
• Iterative methods for best approximate solutions of linear integral equations of the first and second kinds
• Linear complementarity problems solvable by A single linear program
• On solving linear complementarity problems as linear programs
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities
• The method of projections for finding the common point of convex sets

Cited in

(24)

• The _1 solution of linear inequalities
• New iterative methods for linear inequalities
• An automatic relaxation method for solving interval linear inequalities
• A parallel projection method for solving generalized linear least-squares problems
• Entropic perturbation method for solving a system of linear inequalities
• A hybrid algorithm for solving linear inequalities in a least squares sense
• A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints
• The linear model revisited
• The Reflection Method for the Numerical Solution of Linear Systems
• Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
• Convergence results for an accelerated nonlinear Cimmino algorithm
• A parallel subgradient projections method for the convex feasibility problem
• New contraction methods for linear inequalities
• A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem
• The distance between two convex sets
• On a probabilistic approach to synthesize control policies from example datasets
• Efficient randomized block Kaczmarz method for linear feasibility
• On the behavior of a block-iterative projection method for solving convex feasibility problems
• A simultaneous projections method for linear inequalities
• An improved first-order primal-dual algorithm with a new correction step
• Scalable parallel algorithm for solving non-stationary systems of linear inequalities
• Block-iterative surrogate projection methods for convex feasibility problems
• On some optimization techniques in image reconstruction from projections
• Parallel application of block-iterative methods in medical imaging and radiation therapy

This page was built for publication: New methods for linear inequalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1162118)