A simultaneous projections method for linear inequalities
From MaRDI portal
Publication:801637
DOI10.1016/0024-3795(85)90280-0zbMath0552.65051OpenAlexW2057910715MaRDI QIDQ801637
Alfredo Noel Iusem, Alvaro Rodolfo de Pierro
Publication date: 1985
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(85)90280-0
iterative methodinconsistent systemsCimmino's methodsimultaneous projections methodweighted least squares type solution
Related Items
Asymptotically optimal row-action methods for generalized least squares problems, Block-iterative surrogate projection methods for convex feasibility problems, A convex programming solution for gate-sizing with pipelining constraints, On the asymptotic behavior of some alternate smoothing series expansion iterative methods, 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, Iterations of parallel convex projections in hilbert spaces, On the behavior of a block-iterative projection method for solving convex feasibility problems, Convergence of the multiplicative algebraic reconstruction technique for the inconsistent system of equations, How good are projection methods for convex feasibility problems?, 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, Projection methods for the linear split feasibility problems, A conjugate gradient algorithm for sparse linear inequalities, On the convergence of Han's method for convex programming with quadratic objective, Iterative algorithm for solving a class of convex feasibility problem, Iterative method for solving the linear feasibility problem, Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems, Numerical methods for solving some matrix feasibility problems, The \(\ell_1\) solution of linear inequalities, A parallel projection method for overdetermined nonlinear systems of equations, An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem, Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems, A hybrid algorithm for solving linear inequalities in a least squares sense, Relaxed outer projections, weighted averages and convex feasibility, On spherical convergence, convexity, and block iterative projection algorithms in Hilbert space, Block-iterative projection methods for parallel computation of solutions to convex feasibility problems, On perturbed steepest descent methods with inexact line search for bilevel convex optimization, Convergence results for an accelerated nonlinear Cimmino algorithm, New iterative methods for linear inequalities, Parallel projection methods and the resolution of ill-posed problems
Cites Work
