On the behaviour of the underrelaxed Hildreth’s row-action method for computing projections onto polyhedra

Thomas Katsekpor

Research output: Contribution to journalArticlepeer-review

Abstract

A strongly underrelaxed sequential version of the Hildreth’s iterative algorithm for norm minimization over linear inequalities is presented. Proofs are given showing that the algorithm converges from any starting point to its projection onto the linear constraint set in the feasible case and to the nearest least squares solution in the general case.

Original languageEnglish
Pages (from-to)1757-1776
Number of pages20
JournalOPSEARCH
Volume60
Issue number4
DOIs
Publication statusPublished - Dec 2023

Keywords

  • Hildreth’s iterative algorithm
  • Inconsistent (Infeasible) case
  • Least squares solution
  • Linear inequalities

Fingerprint

Dive into the research topics of 'On the behaviour of the underrelaxed Hildreth’s row-action method for computing projections onto polyhedra'. Together they form a unique fingerprint.

Cite this