Approximation schemes for functional optimization problems
From MaRDI portal
Publication:1024253
DOI10.1007/S10957-008-9471-6zbMath1176.90658OpenAlexW2051872019MaRDI QIDQ1024253
Marcello Sanguineti, Saverio Giulini
Publication date: 16 June 2009
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-008-9471-6
Ritz methodcurse of dimensionalityextended Ritz methodcomplexity of admissible solutionsupper bounds on accuracy
Newton-type methods (49M15) Approximation methods and heuristics in mathematical programming (90C59) Programming in abstract spaces (90C48)
Related Items (10)
On the curse of dimensionality in the Ritz method ⋮ Suboptimal solutions to dynamic optimization problems via approximations of the policy functions ⋮ A comparison between fixed-basis and variable-basis schemes for function approximation and functional optimization ⋮ Can dictionary-based computational models outperform the best linear ones? ⋮ Approximate dynamic programming for stochastic \(N\)-stage optimization with application to optimal consumption under uncertainty ⋮ New insights into Witsenhausen's counterexample ⋮ Estimates of variation with respect to a set and applications to optimization problems ⋮ Some comparisons of complexity in dictionary-based and linear computational models ⋮ Management of water resource systems in the presence of uncertainties by nonlinear approximation techniques and deterministic sampling ⋮ Suboptimal Policies for Stochastic $$N$$-Stage Optimization: Accuracy Analysis and a Case Study from Optimal Consumption
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Well-posed optimization problems
- Complexity of Gaussian-radial-basis networks approximating smooth functions
- A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
- Functional optimal estimation problems and their solution by nonlinear approximation schemes
- A recursive algorithm for nonlinear least-squares problems
- Rates of minimization of error functionals over Boolean variable-basis functions
- Universal Approximation by Ridge Computational Models and Neural Networks: A Survey
- The extended Ritz method for functional optimization: overview and applications to single-person and team optimal decision problems
- Universal approximation bounds for superpositions of a sigmoidal function
- Hinging hyperplanes for regression, classification, and function approximation
- A New Class of Incremental Gradient Methods for Least Squares Problems
- Bounds on rates of variable-basis and neural-network approximation
- Comparison of worst case errors in linear and neural network approximation
- Minimization of Error Functionals over Variable-Basis Functions
- Error Estimates for Approximate Optimization by the Extended Ritz Method
- Optimization of approximating networks for optimal fault diagnosis
- Approximating networks and extended Ritz method for the solution of functional optimization problems
This page was built for publication: Approximation schemes for functional optimization problems
