Finite-time Newton seeking control
Martin Guay, Mouhacine Benosman

TL;DR
This paper introduces a finite-time Newton seeking control method for systems with unknown static maps, ensuring rapid convergence to the optimum through an averaged system analysis and practical stability guarantees.
Contribution
It presents a novel finite-time Newton seeking control approach with stability analysis and simulation validation for systems with unknown static maps.
Findings
Achieves finite-time stability of the unknown optimum.
Demonstrates finite-time practical stability through averaging analysis.
Validates effectiveness via simulation study.
Abstract
This paper proposes a finite-time Newton seeking control design for systems described by unknown multivariable static maps. The Newton seeking system has an averaged system that implements a Newton continuous-time algorithm. The averaged Newton seeking system is shown to achieve finite-time stability of the unknown optimum of the static map. An averaging analysis demonstrates that the proposed Newton-seeking achieves finite-time practical stability of the optimum. A simulation study is used to demonstrate the effectiveness of the design method.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsExtremum Seeking Control Systems · Mechanical and Optical Resonators · Receptor Mechanisms and Signaling
