TY  - JOUR
AV  - none
ID  - eprints1768
TI  - Information Complexity of Functional Optimization Problems and Their Approximation Schemes
UR  - http://nonlinearstudies.com/index.php/mesa/article/view/403
IS  - 3
N2  - Functional optimization is investigated using tools from information-based complexity. In such optimization problems, a functional has to be minimized with respect to admissible solutions belonging to an infinite-dimensional space of functions. This context models tasks arising in optimal control, systems identification, machine learning, time-series analysis, etc. The solution via variable-basis approximation schemes, which provide a sequence of nonlinear programming problems approximating the original functional one, is considered. Also for such problems, the information complexity is estimated.
JF  - Mathematics in Engineering, Science and Aerospace (MESA)
SN  - 2041-3165
VL  - 1
EP  - 317
Y1  - 2010///
SP  - 303
A1  - Gnecco, Giorgio
A1  - Sanguineti, Marcello
ER  -