.png){kind=icon}
.png){kind=icon}
Return
Stochastic Adaptive Optimization With Dithers
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2021.3050438.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Optimization methods are essential and have been used extensively in a broad spectrum of applications. Most existing literature on optimization algorithms does not consider systems that involve unknown system parameters. This article studies a class of stochastic adaptive optimization problems in which identification of unknown parameters and search for the optimal solutions must be performed simultaneously. Due to a fundamental conflict between parameter identifiability and optimality in such problems, we introduce a method of adding stochastic dither signals into the system, which provide sufficient excitation for estimating the unknown parameters, leading to convergent adaptive optimization algorithms. Joint identification and optimization algorithms are developed and their simultaneous convergence properties of parameter estimation and optimization variable updates are proved. Under both noise-free and noisy observations, the corresponding convergence rates are established. The main results of this article reveal certain fundamental relationships and tradeoff among updating step sizes, dither magnitudes, parameter estimation errors, optimization accuracy, and convergence rates. Simulation case studies are used to illustrate the adaptive optimization algorithms and their main properties.
Keywords:
Optimization
Convergence
Signal processing algorithms
Stochastic processes
Parameter estimation
Noise measurement
Estimation
Adaptive optimization algorithm
convexity
identification
optimization
stochastic dither
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7
Papers:
1.3W
Citations:
6.7W
View more organizations