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

Thomas Katsekpor ()
Additional contact information
Thomas Katsekpor: University of Ghana

OPSEARCH, 2023, vol. 60, issue 4, No 7, 1757-1776

Abstract: 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.

Keywords: Hildreth’s iterative algorithm; Least squares solution; Linear inequalities; Inconsistent (Infeasible) case (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s12597-023-00656-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:opsear:v:60:y:2023:i:4:d:10.1007_s12597-023-00656-x

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/12597

DOI: 10.1007/s12597-023-00656-x

Access Statistics for this article

OPSEARCH is currently edited by Birendra Mandal

More articles in OPSEARCH from Springer, Operational Research Society of India
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().