Pages that link to "Item:Q801637"

The following pages link to A simultaneous projections method for linear inequalities (Q801637):

Displaying 48 items.

• Numerical methods for solving some matrix feasibility problems (Q509640) (← links)
• An acceleration scheme for solving convex feasibility problems using incomplete projection algorithms (Q596679) (← links)
• Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems (Q676010) (← links)
• Relaxed outer projections, weighted averages and convex feasibility (Q751771) (← links)
• A conjugate gradient algorithm for sparse linear inequalities (Q915387) (← links)
• Iterative method for solving the linear feasibility problem (Q946322) (← links)
• The \(\ell_1\) solution of linear inequalities (Q959132) (← links)
• An alternating projections algorithm for solving linear programs (Q991560) (← links)
• A hybrid algorithm for solving linear inequalities in a least squares sense (Q1014358) (← links)
• A primal-dual projection method for solving systems of linear inequalities (Q1058270) (← links)
• An automatic relaxation method for solving interval linear inequalities (Q1060533) (← links)
• Convergence results for an accelerated nonlinear Cimmino algorithm (Q1061456) (← links)
• An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems (Q1107277) (← links)
• On some optimization techniques in image reconstruction from projections (Q1109546) (← links)
• Parallel application of block-iterative methods in medical imaging and radiation therapy (Q1111951) (← links)
• On the convergence of Han's method for convex programming with quadratic objective (Q1181736) (← links)
• A parallel projection method for overdetermined nonlinear systems of equations (Q1208707) (← links)
• On spherical convergence, convexity, and block iterative projection algorithms in Hilbert space (Q1272854) (← links)
• New iterative methods for linear inequalities (Q1321142) (← links)
• Parallel projection methods and the resolution of ill-posed problems (Q1324388) (← links)
• New contraction methods for linear inequalities (Q1334912) (← links)
• Block-iterative surrogate projection methods for convex feasibility problems (Q1347226) (← links)
• Projection with a minimal system of inequalities (Q1384096) (← links)
• Obtaining simultaneous solutions of linear subsystems of inequalities and duals (Q1602997) (← links)
• Iterative algorithm for solving a class of convex feasibility problem (Q1736385) (← links)
• Distributed Fejer processes for systems of linear inequalities and problems of linear programming (Q1778970) (← links)
• Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems (Q1803652) (← links)
• A class of methods for solving large convex systems (Q1813379) (← links)
• Preconditioning projection methods for solving algebraic linear systems (Q1817786) (← links)
• Fast finite methods for a system of linear inequalities (Q1819897) (← links)
• A projection method for least-squares solutions to overdetermined systems of linear inequalities (Q1821512) (← links)
• Block-iterative projection methods for parallel computation of solutions to convex feasibility problems (Q1822907) (← links)
• A convex programming solution for gate-sizing with pipelining constraints (Q2147929) (← links)
• Scalable parallel algorithm for solving non-stationary systems of linear inequalities (Q2206971) (← links)
• How good are projection methods for convex feasibility problems? (Q2427393) (← links)
• On the asymptotic behavior of some alternate smoothing series expansion iterative methods (Q2639624) (← links)
• An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem (Q2766137) (← links)
• Modified Han algorithm for inconsistent linear inequalities (Q2794313) (← links)
• Under and over projection methods for solving linear inequality systems (Q2844654) (← links)
• On perturbed steepest descent methods with inexact line search for bilevel convex optimization (Q3112499) (← links)
• On the behavior of a block-iterative projection method for solving convex feasibility problems (Q3491319) (← links)
• Projection methods for the linear split feasibility problems (Q3514829) (← links)
• Projected aggregation method for solving a linear system of equalities and inequalities (Q3973671) (← links)
• Asymptotically optimal row-action methods for generalized least squares problems (Q4256045) (← links)
• Iterations of parallel convex projections in hilbert spaces (Q4296720) (← links)
• Convergence of the multiplicative algebraic reconstruction technique for the inconsistent system of equations (Q6063814) (← links)
• A successive centralized circumcentered-reflection method for the convex feasibility problem (Q6179873) (← links)
• On the behaviour of the underrelaxed Hildreth's row-action method for computing projections onto Polyhedra (Q6191673) (← links)