On the behaviour of the underrelaxed Hildreth's row-action method for computing projections onto Polyhedra

DOI10.1007/s12597-023-00656-xOpenAlexW4381613371MaRDI QIDQ6191673

Thomas Katsekpor

Publication date: 11 March 2024

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-023-00656-x

zbMATH Keywords

linear inequalitiesleast squares solutionHildreth's iterative algorithminconsistent (Infeasible) case

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the convergence properties of Hildreth's quadratic programming algorithm
• A simultaneous projections method for linear inequalities
• Model predictive control system design and implementation using \texttt{MATLAB}
• Successive projections on hyperplanes
• A relaxed version of Bregman's method for convex programming
• Strong underrelaxation in Kaczmarz's method for inconsistent systems
• Steered sequential projections for the inconsistent convex feasibility problem
• Hildreth's algorithm with applications to soft constraints for user interface layout
• Convergence results for scaled gradient algorithms in positron emission tomography
• A Simultaneous Iterative Method for Computing Projections on Polyhedra
• Extensions of Hildreth’s Row-Action Method for Quadratic Programming
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• The method of projections for finding the common point of convex sets
• On Perturbations in Systems of Linear Inequalities

This page was built for publication: On the behaviour of the underrelaxed Hildreth's row-action method for computing projections onto Polyhedra