Quantitative Sensitivity Bounds for Nonlinear Programming and Time-Varying Optimization

Inspired by classical sensitivity results for nonlinear optimization, we derive and discuss new quantitative bounds to characterize the solution map and dual variables of a parametrized nonlinear program. In particular, we derive explicit expressions for the local and global Lipschitz constants of t...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on automatic control Ročník 67; číslo 6; s. 2829 - 2842
Hlavní autoři: Subotic, Irina, Hauswirth, Adrian, Dorfler, Florian
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.06.2022
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Asymptotic methods
Computational geometry
Convexity
Jacobian matrices
Nonlinear programming
online optimization
Optimization
Prediction algorithms
Programming
Robot sensing systems
Robotics
Sensitivity
Signal processing
Signal processing algorithms
Tracking
ISSN:0018-9286, 1558-2523
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Inspired by classical sensitivity results for nonlinear optimization, we derive and discuss new quantitative bounds to characterize the solution map and dual variables of a parametrized nonlinear program. In particular, we derive explicit expressions for the local and global Lipschitz constants of the solution map of nonconvex or convex optimization problems, respectively. Our results are geared towards the study of time-varying optimization problems, which are commonplace in various applications of online optimization, including power systems, robotics, signal processing, and more. In this context, our results can be used to bound the rate of change of the optimizer. To illustrate the use of our sensitivity bounds we generalize existing arguments to quantify the tracking performance of continuous-time, monotone running algorithms. Furthermore, we introduce a new continuous-time running algorithm for time-varying constrained optimization, which we model as a so-called perturbed sweeping process. For this discontinuous scheme we establish an explicit bound on the asymptotic solution tracking for a class of convex problems.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9286
1558-2523
DOI:10.1109/TAC.2021.3093857