TY  - JOUR
JF  - Journal of Applied Mathematics
N2  - 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 
ID  - eprints1723
SP  - 1
SN  - 1110-757X
AV  - public
EP  - 17
UR  - http://dx.doi.org/10.1155/2012/806945
A1  - Gnecco, Giorgio
PB  - Hindawi Publishing Corporation
TI  - A Comparison between Fixed-Basis and Variable-Basis Schemes for Function Approximation and Functional Optimization
VL  - 2012
Y1  - 2012///
ER  -