Pages that link to "Item:Q3888051"

The following pages link to Extensions of Hildreth’s Row-Action Method for Quadratic Programming (Q3888051):

Displaying 32 items.

• 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)
• On the convergence of SOR- and JOR-type methods for convex linear complementarity problems (Q808627) (← links)
• Some new multiplicative algorithms for image reconstruction from projections (Q915376) (← 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)
• Smallest point of a polytope (Q1117135) (← links)
• An iterative row-action method for interval convex programming (Q1138236) (← links)
• An interior points algorithm for the convex feasibility problem (Q1166775) (← links)
• Solution of underdetermined nonlinear equations by stationary iteration methods (Q1170863) (← links)
• A row relaxation method for large \(l_ 1\) problems (Q1176532) (← links)
• On the convergence of Han's method for convex programming with quadratic objective (Q1181736) (← links)
• Solution of projection problems over polytopes (Q1185491) (← links)
• Algorithms for quadratic constrained matrix problems (Q1200862) (← links)
• Descent methods for convex essentially smooth minimization (Q1321119) (← links)
• On minimum norm solutions (Q1321294) (← links)
• A row-action method for convex programming (Q1330898) (← links)
• Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. (Q1421503) (← links)
• The adventures of a simple algorithm (Q1863543) (← links)
• Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines (Q1904957) (← links)
• Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures (Q2260660) (← links)
• Hildreth's algorithm with applications to soft constraints for user interface layout (Q2351069) (← links)
• A numerically stable least squares solution to the quadratic programming problem (Q2425561) (← links)
• Computational acceleration of projection algorithms for the linear best approximation problem (Q2497243) (← links)
• The distance between two convex sets (Q2497250) (← links)
• An iteration method to solve multiple constrained least squares problems (Q2628358) (← links)
• The Kaczmarz algorithm, row action methods, and statistical learning algorithms (Q4686248) (← links)
• On the behaviour of the underrelaxed Hildreth's row-action method for computing projections onto Polyhedra (Q6191673) (← links)