Extensions of Hildreth’s Row-Action Method for Quadratic Programming

Cited in

(39)

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
Smallest point of a polytope
An iterative row-action method for interval convex programming
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
Algorithms for quadratic constrained matrix problems
Descent methods for convex essentially smooth minimization
On minimum norm solutions
A row-action method for convex programming
Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces.
The adventures of a simple algorithm
Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines
Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures
Hildreth's algorithm with applications to soft constraints for user interface layout
A numerically stable least squares solution to the quadratic programming problem
Computational acceleration of projection algorithms for the linear best approximation problem
The distance between two convex sets
An iteration method to solve multiple constrained least squares problems
From convex feasibility to convex constrained optimization using block action projection methods and underrelaxation
Cyclic subgradient projections
Asymptotically optimal row-action methods for generalized least squares problems
The Kaczmarz algorithm, row action methods, and statistical learning algorithms
PARALLELIZATION STRATEGIES OF A ROW-ACTION METHOD FOR MULTICOMMODITY NETWORK FLOW PROBLEMS
Interval underrelaxed bregman's method with an application
Methods for variational inequality problem over the intersection of fixed point sets of quasi-nonexpansive operators
On the behaviour of the underrelaxed Hildreth's row-action method for computing projections onto Polyhedra
A greedy randomized average block projection method for linear feasibility 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
On the convergence of SOR- and JOR-type methods for convex linear complementarity problems
Some new multiplicative algorithms for image reconstruction from projections
A conjugate gradient algorithm for sparse linear inequalities
The _1 solution of linear inequalities

This page was built for publication: Extensions of Hildreth’s Row-Action Method for Quadratic Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3888051)