Abstract
A simultaneous version of 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 on the linear constraints set in the feasible case and to the nearest least squares solution in the general case.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
