Abstract
We introduce a class of polyhedral norms and study discrete linear approximation problems under these norms. It is possible to give a uniform treatment, in particular, ofL 1 and maximum norm problems, at least as regards notation; and we develop a general exchange algorithm in which we permit also linear inequality constraints.
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.
