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

Simple item page
dc.contributor.authorKatsekpor, T.
dc.date.accessioned2023-07-20T11:58:05Z
dc.date.available2023-07-20T11:58:05Z
dc.date.issued2023
dc.descriptionResearch Articleen_US
dc.description.abstractAbstract 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.en_US
dc.identifier.citationKatsekpor, T. On the behaviour of the underrelaxed Hildreth’s row-action method for computing projections onto polyhedra. OPSEARCH (2023). https://doi.org/10.1007/s12597-023-00656-xen_US
dc.identifier.otherhttps://doi.org/10.1007/s12597-023-00656-x
dc.identifier.urihttp://ugspace.ug.edu.gh:8080/handle/123456789/39597
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.subjectHildreth’s iterative algorithmen_US
dc.subjectLeast squares solutionen_US
dc.subjectLinear inequalitiesen_US
dc.subjectInconsistent (Infeasible) caseen_US
dc.titleOn the behaviour of the underrelaxed Hildreth’s row-action method for computing projections onto polyhedraen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
On the behaviour of the underrelaxed Hildreth.pdf
Size:
115.75 KB
Format:
Adobe Portable Document Format
Description:
Download

License bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Department of Mathematics