An Efficient Blend of the First Algorithm of Remes

Bacopoulos, A; Botsaris, CA

dc.contributor.author	Bacopoulos, A	en
dc.contributor.author	Botsaris, CA	en
dc.date.accessioned	2014-03-01T01:09:17Z
dc.date.available	2014-03-01T01:09:17Z
dc.date.issued	1993	en
dc.identifier.issn	0022-247X	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/10878
dc.subject.classification	Mathematics, Applied	en
dc.subject.classification	Mathematics	en
dc.title	An Efficient Blend of the First Algorithm of Remes	en
heal.type	journalArticle	en
heal.identifier.primary	10.1006/jmaa.1993.1121	en
heal.identifier.secondary	http://dx.doi.org/10.1006/jmaa.1993.1121	en
heal.language	English	en
heal.publicationDate	1993	en
heal.abstract	In this article we find the best simultaneous sum-approximation to a given function with respect to the sup and the L2 norms. The algorithm we develop is a blend of the First Algorithm of Remes and an efficient update of quadratic programming. This algorithm is very fast indeed and it exceeds several orders of magnitude the speed of the standard convex programming. © 1993 Academic Press. All rights reserved.	en
heal.publisher	ACADEMIC PRESS INC JNL-COMP SUBSCRIPTIONS	en
heal.journalName	Journal of Mathematical Analysis and Applications	en
dc.identifier.doi	10.1006/jmaa.1993.1121	en
dc.identifier.isi	ISI:A1993LA70600003	en
dc.identifier.volume	174	en
dc.identifier.issue	2	en
dc.identifier.spage	342	en
dc.identifier.epage	358	en