Abstract

In this work, discrete-time extremum seeking algorithms for unconstrained optimization problems are developed. A general class of non-commutative maps and one- and two point function evaluation polices are presented to approximate a gradient-descent algorithm, suitable for extremum seeking problems. Moreover, adaptive step size rules are discussed to achieve faster convergence and vanishing steady state oscillations.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.