Search arXivSearch

arXiv · 2508.08485

Gradient- and Newton-Based Unit Vector Extremum Seeking Control

Abstract

This paper presents novel methods for achieving stable and efficient convergence in multivariable extremum seeking control (ESC) using sliding mode techniques. Drawing inspiration from both classical sliding mode control and more recent developments in finite-time and fixed-time control, we propose a new framework that integrates these concepts into Gradient- and Newton-based ESC schemes based on sinusoidal perturbation signals. The key innovation lies in the use of discontinuous "relay-type" control components, replacing traditional proportional feedback to estimate the gradient of unknown quadratic nonlinear performance maps with Unit Vector Control (UVC). This represents the first attempt to address real-time, model-free optimization using sliding modes within the classical extremum seeking paradigm. In the Gradient-based approach, the convergence rate is influenced by the unknown Hessian of the objective function. In contrast, the Newton-based method overcomes this limitation by employing a dynamic estimator for the inverse of the Hessian, implemented via a Riccati equation filter. We establish finite-time convergence of the closed-loop average system to the extremum point for both methods by leveraging Lyapunov-based analysis and averaging theory tailored to systems with discontinuous right-hand sides. Numerical simulations validate the proposed method, illustrating significantly faster convergence and improved robustness compared to conventional ESC strategies, which typically guarantee only exponential stability. The results also demonstrate that the Gradient-based method exhibits slower convergence and higher transients since the gradient trajectory follows the curved and steepest-descent path, whereas the Newton-based method achieves faster convergence and improved overall performance going straightly to the extremum.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Roberto Luo, Victor Hugo Pereira Rodrigues, Tiago Roux Oliveira, Miroslav Krstic. 2025-08-11. Gradient- and Newton-Based Unit Vector Extremum Seeking Control. https://arxiv.org/abs/2508.08485

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Dynamic Programming-Compatible Uncertainty Sets in Robust Markov Decision Processes

In this paper, we investigate the compatibility of robust Markov Decision Processes (RMDPs) with dynamic programming under various assumptions on the uncertainty set, i.e., we investigate when one can solve an RMDP by solving a fixed point equation. We show that in all generality, s-rectangular and sa-rectangular uncertainty sets are the only models of uncertainty that are compatible with dynamic programming. Our analysis shows that existing non-rectangular models, including r-rectangularity, are only weakly compatible with dynamic programming, as they require the assumption that rewards do not depend on the next state. In this case, our results imply that one can always construct a rectangular uncertainty set that is equivalent, for both policy evaluation and optimization, to the dynamic programming-compatible non-rectangular model. This highlights a key limitation: dynamic-programming-compatible non-rectangular uncertainty sets, although practically relevant for uncertainty quantification, do not provide a genuinely distinct assessment of policy performance. Interestingly, our proof techniques rely on identifying a novel simultaneous solvability property, which we show is central to several important properties of RMDPs, including the existence of stationary optimal policies and dynamic programming-based formulations. The simultaneous solvability property enables a unified approach to studying all existing models of uncertainty, rectangular and non-rectangular alike.

math.OC

A simple and practical adaptive trust-region method

We present an adaptive trust-region method for unconstrained optimization that allows inexact solutions to the trust-region subproblems. Our method is a simple variant of the classical trust-region method of Ssorensen. The method achieves the best possible convergence bound up to an additive logarithmic term for finding an $ε$-approximate stationary point, i.e., $O( Δ_f L^{1/2} ε^{-3/2}) + \tilde{O}(1)$ iterations, where $L$ is the Lipschitz constant of the Hessian, $Δ_f$ is the optimality gap, and $ε$ is the termination tolerance for the gradient norm. This improves over existing trust-region methods whose worst-case bound is at least a factor of $L$ worse. We compare our performance with state-of-the-art trust-region (TRU) and cubic regularization (ARC) methods from the GALAHAD library on the CUTEst benchmark problems with at least 100 variables. We also compare with the recently developed Universal trust-region (UTR) method, using the same subproblem solver. In terms of shifted geometric mean of wall-clock times our method's is between $1.2\times$ and $2\times$ faster. We report similar improvements for number of function evaluations, factorizations, gradient evaluations and Hessian evaluations. Compared to the conference version of this paper, our revised method includes several practical enhancements. These modifications dramatically improved performance, including almost an order of magnitude reduction in the shifted geometric mean of wall-clock times. We also show that it suffices for the function to be continuously twice-differentiable to guarantee that either the minimum gradient norm converges to zero or the objective value tends towards negative infinity, even when the iterates diverge.

math.OC

Rough Stochastic Pontryagin Maximum Principle and an Indirect Shooting Method

We derive first-order Pontryagin optimality conditions for stochastic optimal control with deterministic controls for systems modeled by rough differential equations (RDE) driven by Gaussian rough paths. This Pontryagin Maximum Principle (PMP) applies to systems following stochastic differential equations (SDE) driven by Brownian motion, yet it does not rely on forward-backward SDEs and involves the same Hamiltonian as the deterministic PMP. The proof consists of first deriving various integrable error bounds for solutions to nonlinear and linear RDEs by leveraging recent results on Gaussian rough paths. The PMP then follows using standard techniques based on needle-like variations. As an application, we propose the first indirect shooting method for nonlinear stochastic optimal control and show that it converges 10x faster than a direct method on a stabilization task.

math.OC