Extensions of Hildreth’s Row-Action Method for Quadratic Programming
From MaRDI portal
Publication:3888051
DOI10.1137/0318033zbMath0444.49025OpenAlexW1967340927MaRDI QIDQ3888051
Publication date: 1980
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0318033
Related Items
A row-action method for convex programming, Asymptotically optimal row-action methods for generalized least squares problems, An iteration method to solve multiple constrained least squares problems, Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines, PARALLELIZATION STRATEGIES OF A ROW-ACTION METHOD FOR MULTICOMMODITY NETWORK FLOW PROBLEMS, On some optimization techniques in image reconstruction from projections, Parallel application of block-iterative methods in medical imaging and radiation therapy, Smallest point of a polytope, An iterative row-action method for interval convex programming, A numerically stable least squares solution to the quadratic programming problem, Interval underrelaxed bregman's method with an application, On the behaviour of the underrelaxed Hildreth's row-action method for computing projections onto Polyhedra, Some new multiplicative algorithms for image reconstruction from projections, A conjugate gradient algorithm for sparse linear inequalities, Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces., An interior points algorithm for the convex feasibility problem, Solution of underdetermined nonlinear equations by stationary iteration methods, A row relaxation method for large \(l_ 1\) problems, On the convergence of Han's method for convex programming with quadratic objective, Solution of projection problems over polytopes, From convex feasibility to convex constrained optimization using block action projection methods and underrelaxation, Methods for Variational Inequality Problem Over the Intersection of Fixed Point Sets of Quasi-Nonexpansive Operators, Algorithms for quadratic constrained matrix problems, The \(\ell_1\) solution of linear inequalities, SOR- and Jacobi-type iterative methods for solving \(\ell_1 - \ell_2\) problems by way of Fenchel duality, Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures, Computational acceleration of projection algorithms for the linear best approximation problem, The distance between two convex sets, The Kaczmarz algorithm, row action methods, and statistical learning algorithms, A hybrid algorithm for solving linear inequalities in a least squares sense, On the convergence properties of Hildreth's quadratic programming algorithm, The adventures of a simple algorithm, A relaxed version of Bregman's method for convex programming, On the convergence of SOR- and JOR-type methods for convex linear complementarity problems, Hildreth's algorithm with applications to soft constraints for user interface layout, Cyclic subgradient projections, Descent methods for convex essentially smooth minimization, On minimum norm solutions
