arXiv:1312.6464 [math.OC]AbstractReferencesReviewsResources
On the equivalence between the modifier-adaptation and trust-region frameworks
Published 2013-12-23, updated 2014-07-28Version 2
In this short note, the recently popular modifier-adaptation framework for real-time optimization is discussed in tandem with the well-developed trust-region framework of numerical optimization, and it is shown that the basic version of the former is a simplification of the latter when the problem is unconstrained. This relation is then exploited to propose a globally convergent modifier-adaptation algorithm using already developed trust-region theory. Cases when the two may not be equivalent and extensions to constrained problems are also discussed.
Comments: short note submitted to Computers and Chemical Engineering
Categories: math.OC
Related articles: Most relevant | Search more
arXiv:2106.09663 [math.OC] (Published 2021-06-17)
A Short Note of PAGE: Optimal Convergence Rates for Nonconvex Optimization
arXiv:2306.08523 [math.OC] (Published 2023-06-14)
A Short Note on Output Controllability
arXiv:1507.00228 [math.OC] (Published 2015-07-01)
Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming