Pages that link to "Item:Q3758566"
From MaRDI portal
The following pages link to A Simultaneous Iterative Method for Computing Projections on Polyhedra (Q3758566):
Displaying 24 items.
- A row relaxation method for large minimax problems (Q688632) (← links)
- On the convergence properties of Hildreth's quadratic programming algorithm (Q749443) (← links)
- Relaxed outer projections, weighted averages and convex feasibility (Q751771) (← links)
- On the convergence of SOR- and JOR-type methods for convex linear complementarity problems (Q808627) (← links)
- A conjugate gradient algorithm for sparse linear inequalities (Q915387) (← links)
- Generalization: One technique of computational and applied mathematical methodology (Q932560) (← links)
- The \(\ell_1\) solution of linear inequalities (Q959132) (← links)
- A hybrid algorithm for solving linear inequalities in a least squares sense (Q1014358) (← links)
- Parallel application of block-iterative methods in medical imaging and radiation therapy (Q1111951) (← links)
- A parallel projection method for solving generalized linear least-squares problems (Q1112561) (← links)
- A row relaxation method for large \(l_ 1\) problems (Q1176532) (← links)
- On the convergence of Han's method for convex programming with quadratic objective (Q1181736) (← links)
- Solution of projection problems over polytopes (Q1185491) (← links)
- A row-action method for convex programming (Q1330898) (← links)
- Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. (Q1421503) (← links)
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems (Q1822907) (← links)
- A parallel relaxation method for quadratic programming problems with interval constraints (Q1900763) (← links)
- How good are projection methods for convex feasibility problems? (Q2427393) (← links)
- Computational acceleration of projection algorithms for the linear best approximation problem (Q2497243) (← links)
- The direct-projection methods (Q2720131) (← links)
- On perturbed steepest descent methods with inexact line search for bilevel convex optimization (Q3112499) (← links)
- Asymptotically optimal row-action methods for generalized least squares problems (Q4256045) (← links)
- Interval underrelaxed bregman's method with an application (Q4859833) (← links)
- On the behaviour of the underrelaxed Hildreth's row-action method for computing projections onto Polyhedra (Q6191673) (← links)