scientific article; zbMATH DE number 3606256
From MaRDI portal
Publication:4171875
Cited in
(21)- A hybrid algorithm for solving linear inequalities in a least squares sense
- A relaxed version of Bregman's method for convex programming
- On some optimization techniques in image reconstruction from projections
- Parallel application of block-iterative methods in medical imaging and radiation therapy
- An iterative row-action method for interval convex programming
- On the continuous quadratic knapsack problem
- Algorithms for quadratic constrained matrix problems
- Descent methods for convex essentially smooth minimization
- On the convergence of the coordinate descent method for convex differentiable minimization
- On minimum norm solutions
- A proximal point algorithm for minimax problems
- The adventures of a simple algorithm
- A parallel relaxation method for quadratic programming problems with interval constraints
- On finitely convergent iterative methods for the convex feasibility problem
- On the behaviour of the underrelaxed Hildreth's row-action method for computing projections onto Polyhedra
- A row relaxation method for large minimax problems
- SOR- and Jacobi-type iterative methods for solving _1 - _2 problems by way of Fenchel duality
- On the convergence properties of Hildreth's quadratic programming algorithm
- Optimization of Burg's entropy over linear constraints
- A conjugate gradient algorithm for sparse linear inequalities
- The _1 solution of linear inequalities
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4171875)
