arXiv (All)
open access
Multivariable Newton-Based Extremum Seeking with Bounded Update Rates
We propose a multivariable Newton-based extremum seeking scheme, incorporating known bounds on update rates. The design extends the recent bounded extremum seeking scheme to the Newton-based approach, which makes the convergence rate independent of the unknown Hessian by estimating and inverting the
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Two-Dimensional Extremizer for Relatively Inexact Gradient Descent#1154779
- Multivariable Extremum Seeking for Locally Lipschitz Objectives#927693
- Lie bracket approximations of RMSprop for Extremum Seeking Control#974076
- On Minimax Optimality and Uniqueness of Fixed-Step First-Order Methods for Smooth Convex Optimization#984578
- An accelerated proximal PRS-SQP algorithm with dual ascent-descent procedures for smooth composite optimization#1131393
Record · ID 1076384
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive