In this paper we show that metric regularity and strong metric regularity of a set-valued mapping imply convergence of inexact iterative methods for solving a generalized equation associated with this mapping. To accomplish this, we first focus on the question how these properties are preserved under changes of the mapping and the reference point. As an application, we consider discrete approximations in optimal control.
2
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
Robinson's implicit function theorem has played a mayor role in the analysis of stability of optimization problems in the last two decades. In this paper we take a new look at this theorem, and with an updated terminology go back to the roots and present some extensions.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.