The following pages link to (Q4171875):
Displaying 21 items.
- A row relaxation method for large minimax problems (Q688632) (← links)
- SOR- and Jacobi-type iterative methods for solving \(\ell_1 - \ell_2\) problems by way of Fenchel duality (Q691483) (← links)
- On the convergence properties of Hildreth's quadratic programming algorithm (Q749443) (← links)
- Optimization of Burg's entropy over linear constraints (Q756379) (← links)
- A conjugate gradient algorithm for sparse linear inequalities (Q915387) (← links)
- The \(\ell_1\) solution of linear inequalities (Q959132) (← links)
- A hybrid algorithm for solving linear inequalities in a least squares sense (Q1014358) (← links)
- A relaxed version of Bregman's method for convex programming (Q1067977) (← 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)
- An iterative row-action method for interval convex programming (Q1138236) (← links)
- On the continuous quadratic knapsack problem (Q1194858) (← links)
- Algorithms for quadratic constrained matrix problems (Q1200862) (← links)
- Descent methods for convex essentially smooth minimization (Q1321119) (← links)
- On the convergence of the coordinate descent method for convex differentiable minimization (Q1321135) (← links)
- On minimum norm solutions (Q1321294) (← links)
- A proximal point algorithm for minimax problems (Q1371666) (← links)
- The adventures of a simple algorithm (Q1863543) (← links)
- A parallel relaxation method for quadratic programming problems with interval constraints (Q1900763) (← links)
- On finitely convergent iterative methods for the convex feasibility problem (Q3991358) (← links)
- On the behaviour of the underrelaxed Hildreth's row-action method for computing projections onto Polyhedra (Q6191673) (← links)
