eprintid: 1723
rev_number: 9
eprint_status: archive
userid: 46
dir: disk0/00/00/17/23
datestamp: 2013-09-13 12:03:55
lastmod: 2013-09-16 12:02:59
status_changed: 2013-09-13 12:03:55
type: article
metadata_visibility: show
creators_name: Gnecco, Giorgio
creators_id: giorgio.gnecco@imtlucca.it
title: A Comparison between Fixed-Basis and Variable-Basis Schemes for Function Approximation and Functional Optimization
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: public
abstract: Fixed-basis and variable-basis approximation schemes are compared for the problems of function approximation and functional optimization (also known as infinite programming). Classes of problems are investigated for which variable-basis schemes with sigmoidal computational
units perform better than fixed-basis ones, in terms of the minimum number of computational units needed to achieve a desired error in function approximation or approximate optimization. Previously known bounds on the accuracy are extended, with better rates, to families of 
date: 2012
publication: Journal of Applied Mathematics
volume: 2012
publisher: Hindawi Publishing Corporation
pagerange: 1-17
id_number: 10.1155/2012/806945
refereed: TRUE
issn: 1110-757X
official_url: http://dx.doi.org/10.1155/2012/806945
citation:   Gnecco, Giorgio  A Comparison between Fixed-Basis and Variable-Basis Schemes for Function Approximation and Functional Optimization.  Journal of Applied Mathematics, 2012.  pp. 1-17.  ISSN 1110-757X      (2012)  
document_url: http://eprints.imtlucca.it/1723/1/Journal%20of%20Applied%20Mathematics_Gnecco_2012.pdf