scientific article; zbMATH DE number 3606256
From MaRDI portal
Publication:4171875
zbMath0389.90078MaRDI QIDQ4171875
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Quadratic programming (90C20)
Related Items
A parallel relaxation method for quadratic programming problems with interval constraints ⋮ On finitely convergent iterative methods for the convex feasibility problem ⋮ On some optimization techniques in image reconstruction from projections ⋮ Parallel application of block-iterative methods in medical imaging and radiation therapy ⋮ A proximal point algorithm for minimax problems ⋮ An iterative row-action method for interval convex programming ⋮ On the behaviour of the underrelaxed Hildreth's row-action method for computing projections onto Polyhedra ⋮ A conjugate gradient algorithm for sparse linear inequalities ⋮ On the continuous quadratic knapsack problem ⋮ Algorithms for quadratic constrained matrix problems ⋮ The \(\ell_1\) solution of linear inequalities ⋮ A row relaxation method for large minimax problems ⋮ SOR- and Jacobi-type iterative methods for solving \(\ell_1 - \ell_2\) problems by way of Fenchel duality ⋮ A hybrid algorithm for solving linear inequalities in a least squares sense ⋮ On the convergence properties of Hildreth's quadratic programming algorithm ⋮ Optimization of Burg's entropy over linear constraints ⋮ The adventures of a simple algorithm ⋮ A relaxed version of Bregman's method for convex programming ⋮ Descent methods for convex essentially smooth minimization ⋮ On the convergence of the coordinate descent method for convex differentiable minimization ⋮ On minimum norm solutions
This page was built for publication:
