A comparison between fixed-basis and variable-basis schemes for function approximation and functional optimization
From MaRDI portal
(Redirected from Publication:411092)
Recommendations
- Approximation schemes for functional optimization problems
- Minimization of Error Functionals over Variable-Basis Functions
- Functional optimization by variable-basis approximation schemes
- Information complexity of functional optimization problems and their approximation schemes
- Bounds on rates of variable-basis and neural-network approximation
Cites work
- scientific article; zbMATH DE number 1805579 (Why is no real title available?)
- scientific article; zbMATH DE number 3877692 (Why is no real title available?)
- scientific article; zbMATH DE number 124702 (Why is no real title available?)
- scientific article; zbMATH DE number 1405266 (Why is no real title available?)
- scientific article; zbMATH DE number 3206496 (Why is no real title available?)
- scientific article; zbMATH DE number 3257595 (Why is no real title available?)
- scientific article; zbMATH DE number 3314644 (Why is no real title available?)
- scientific article; zbMATH DE number 3354513 (Why is no real title available?)
- 10.1162/153244303322753616
- Accuracy of suboptimal solutions to kernel principal component analysis
- Approximating networks and extended Ritz method for the solution of functional optimization problems
- Approximation by superpositions of a sigmoidal function
- Approximation schemes for functional optimization problems
- Can dictionary-based computational models outperform the best linear ones?
- Comparison of worst case errors in linear and neural network approximation
- Condition numbers and Ritz type methods in unconstrained optimization
- Error Estimates for Approximate Optimization by the Extended Ritz Method
- Large-eddy simulation of high-Reynolds-number supersonic boundary layers using the approximate deconvolution model and a rescaling and recycling technique
- On uniformly convex functionals
- Perturbations, approximations and sensitivity analysis of optimal control systems
- Sequential greedy approximation for certain convex optimization problems
- Some comparisons of complexity in dictionary-based and linear computational models
- Suboptimal solutions to dynamic optimization problems via approximations of the policy functions
- Sup-norm approximation bounds for networks through probabilistic methods
- The extended Ritz method for functional optimization: overview and applications to single-person and team optimal decision problems
- Uniform approximation by neural networks
- Universal approximation bounds for superpositions of a sigmoidal function
Cited in
(11)- Minimization of Error Functionals over Variable-Basis Functions
- Functional optimization by variable-basis approximation schemes
- On the curse of dimensionality in the Ritz method
- Information complexity of functional optimization problems and their approximation schemes
- Value and Policy Function Approximations in Infinite-Horizon Optimization Problems
- Approximation results for neural network operators activated by sigmoidal functions
- Estimates of variation with respect to a set and applications to optimization problems
- Approximation schemes for functional optimization problems
- Multivariate neural network operators with sigmoidal activation functions
- Universal approximation by radial basis function networks of Delsarte translates
- Probabilistic lower bounds for approximation by shallow perceptron networks
This page was built for publication: A comparison between fixed-basis and variable-basis schemes for function approximation and functional optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q411092)
