Related papers: Generalized Multi-Constraint Extremum Seeking
The EM (Expectation-Maximization) algorithm is regarded as an MM (Majorization-Minimization) algorithm for maximum likelihood estimation of statistical models. Expanding this view, this paper demonstrates that by choosing an appropriate…
In this work we introduce the concept of an Underestimate Sequence (UES), which is motivated by Nesterov's estimate sequence. Our definition of a UES utilizes three sequences, one of which is a lower bound (or under-estimator) of the…
This paper investigates multivariable extremum seeking using unit-vector control. By employing the gradient algorithm and a polytopic embedding of the unknown Hessian matrix, we establish sufficient conditions, expressed as linear matrix…
This paper proposes a new algorithm for solving constrained global optimization problems where both the objective function and constraints are one-dimensional non-differentiable multiextremal Lipschitz functions. Multiextremal constraints…
Control-affine Extremum Seeking Control (ESC) systems have been increasingly studied and applied in the last decade. In a recent effort, many control-affine ESC structures have been generalized in a unifying class and their stability was…
We study the problem of global extremum seeking in the presence of local extrema. We investigate two different perturbation-based methods: 1) a well-known classical extremum seeking scheme for steady-state output optimization, and 2) a…
We present multivariable extremum seeking (ES) designs that achieve unbiased convergence to the optimum. Two designs are introduced: one with exponential unbiased convergence (unbiased extremum seeker, uES) and the other with…
The Expectation--Maximization (EM) algorithm is a simple meta-algorithm that has been used for many years as a methodology for statistical inference when there are missing measurements in the observed data or when the data is composed of…
A recently introduced general-purpose heuristic for finding high-quality solutions for many hard optimization problems is reviewed. The method is inspired by recent progress in understanding far-from-equilibrium phenomena in terms of {\em…
The paper deals with the extremum seeking problem for a class of cost functions depending only on a part of state variables of a control system. This problem is related to the concept of partial asymptotic stability and analyzed by…
In this paper, we describe a broad class of control functions for extremum seeking problems. We show that it unifies and generalizes existing extremum seeking strategies which are based on Lie bracket approximations, and allows to design…
Optimization of expensive computer models with the help of Gaussian process emulators in now commonplace. However, when several (competing) objectives are considered, choosing an appropriate sampling strategy remains an open question. We…
This paper discusses the design of an extremum seeking controller that relies on a monitoring function for a class of SISO uncertain nonlinear systems characterized by arbitrary and uncertain relative degree. Our demonstration illustrates…
The EM algorithm is a generic tool that offers maximum likelihood solutions when datasets are incomplete with data values missing at random or completely at random. At least for its simplest form, the algorithm can be rewritten in terms of…
We propose a new design strategy for extremum seeking control for a multi-dimensional single-integrator system in the presence of local extrema. The proposed method employs suitably designed sinusoidal dither signals, which force the…
This paper proposes a novel distributed optimization framework that addresses time-varying optimization problems without requiring explicit derivative information of the objective functions. Traditional distributed methods often rely on…
We propose a new family of fairness definitions for classification problems that combine some of the best properties of both statistical and individual notions of fairness. We posit not only a distribution over individuals, but also a…
Extremum seeking feedback is a powerful method to steer a dynamical system to an extremum of a partially or completely unknown map. It often requires advanced system-theoretic tools to understand the qualitative behavior of extremum seeking…
Reinforcement learning for control over continuous spaces typically uses high-entropy stochastic policies, such as Gaussian distributions, for local exploration and estimating policy gradient to optimize performance. Many robotic control…
The paper deals with a well-known extremum seeking scheme by proving uniformity properties with respect to the amplitudes of the dither signal and of the cost function. Those properties are then used to show that the scheme guarantees the…