Data-efficient extremum-seeking control using kernel-based function approximation
From MaRDI portal
Cites work
- 100 years of extremum seeking: a survey
- A converse Lyapunov theorem for discrete-time systems with disturbances
- A Robust Event-Triggered Approach for Fast Sampled-Data Extremization and Learning
- A time-varying extremum-seeking control approach
- Bounded extremum seeking with discontinuous dithers
- Data-enabled extremum seeking: a cooperative concurrent learning-based approach
- Extremum Seeking for Static Maps With Delays
- scientific article; zbMATH DE number 1804115 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Multivariable Newton-based extremum seeking
- Nonlinear systems.
- Nonsmooth Extremum Seeking Control With User-Prescribed Fixed-Time Convergence
- On the accuracy of gradient estimation in extremum-seeking control using small perturbations
- Robust Uncertainty Bounds in Reproducing Kernel Hilbert Spaces: A Convex Optimization Approach
- Sampled-data extremum-seeking framework for constrained optimization of nonlinear dynamical systems
- Theory of Reproducing Kernels
- Unified frameworks for sampled-data extremum seeking control: global optimisation and multi-unit systems
Cited in
(1)
This page was built for publication: Data-efficient extremum-seeking control using kernel-based function approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6933778)