Information complexity of functional optimization problems and their approximation schemes

MaRDI QIDQ3161549zbMATH OpenFDO

Authors Giorgio Gnecco, Marcello Sanguineti

Publication date 15 October 2010

Full work available at URL http://nonlinearstudies.com/index.php/mesa/article/view/403

zbMATH Keywords

approximation schemesfunctional (or infinite-dimensional) optimizationinformation complexitynonlinear programming

Mathematics Subject Classification ID

Numerical methods based on nonlinear programming (49M37)

Recommendations

• Approximation schemes for functional optimization problems
• scientific article; zbMATH DE number 3508265
• Functional optimization by variable-basis approximation schemes
• A comparison between fixed-basis and variable-basis schemes for function approximation and functional optimization
• scientific article; zbMATH DE number 822135

Cited in

(9)

• Information-based complexity of linear operator equations
• Some issues in the theory of optimal algorithms and informational complexity
• scientific article; zbMATH DE number 3968248 (Why is no real title available?)
• The information approach to multiextremal optimization problems
• A comparison between fixed-basis and variable-basis schemes for function approximation and functional optimization
• scientific article; zbMATH DE number 822135 (Why is no real title available?)
• The exact information-based complexity of smooth convex minimization
• Functional optimization by variable-basis approximation schemes
• Estimates of variation with respect to a set and applications to optimization problems

This page was built for publication: Information complexity of functional optimization problems and their approximation schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3161549)