Functional optimization by variable-basis approximation schemes

DOI10.1007/S10288-010-0134-8zbMath1219.90180OpenAlexW1968997159MaRDI QIDQ538282

Giorgio Gnecco

Publication date: 25 May 2011

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-010-0134-8

zbMATH Keywords

dynamic optimizationcurse of dimensionalityinfinite-dimensional optimizationlearning from datamodel complexityaccuracy of suboptimal solutionsteam optimization

Mathematics Subject Classification ID

Dynamic programming in optimal control and differential games (49L20) Dynamic programming (90C39) Rate of convergence, degree of approximation (41A25) Mathematical programming (90C99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Suboptimal solutions to dynamic optimization problems via approximations of the policy functions
• Minimizing sequences for a family of functional optimal estimation problems
• Accuracy of suboptimal solutions to kernel principal component analysis
• Error bounds for suboptimal solutions to kernel principal component analysis
• Estimates of variation with respect to a set and applications to optimization problems
• Estimates of the approximation error using Rademacher complexity: Learning vector-valued functions
• The weight-decay technique in learning from data: an optimization point of view
• Approximate Minimization of the Regularized Expected Error over Kernel Models
• Smooth Optimal Decision Strategies for Static Team Optimization Problems and Their Approximations
• Regularization Techniques and Suboptimal Solutions to Optimization Problems in Learning from Data
• Error Estimates for Approximate Optimization by the Extended Ritz Method

This page was built for publication: Functional optimization by variable-basis approximation schemes