@article{95c1959a50624d4a96a601effae96831,
title = "Lipschitz-Like Property Relative to a Set and the Generalized Mordukhovich Criterion",
abstract = "In this paper we will establish some necessary condition and sufficient condition respectively for a set-valued mapping to have the Lipschitz-like property relative to a closed set by employing regular normal cone and limiting normal cone of a restricted graph of the set-valued mapping. We will obtain a complete characterization for a set-valued mapping to have the Lipschitz-property relative to a closed and convex set by virtue of the projection of the coderivative onto a tangent cone. Furthermore, by introducing a projectional coderivative of set-valued mappings, we establish a verifiable generalized Mordukhovich criterion for the Lipschitz-like property relative to a closed and convex set. We will study the representation of the graphical modulus of a set-valued mapping relative to a closed and convex set by using the outer norm of the corresponding projectional coderivative value. For an extended real-valued function, we will apply the obtained results to investigate its Lipschitz continuity relative to a closed and convex set and the Lipschitz-like property of a level-set mapping relative to a half line.",
keywords = "Graphical modulus, Level-set mapping, Lipschitz-like property relative to a set, Mordukhovich criterion, Projectional coderivative",
author = "Meng, {K. W.} and Li, {M. H.} and Yao, {W. F.} and Yang, {X. Q.}",
note = "Funding Information: The authors are grateful to the guest editor and the anonymous reviewers for their valuable comments and suggestions toward the improvement of this paper. The authors would like to thank Professor Rockafellar for posing to us a few research questions on the Lipschitz-like property relative to a set during a conference held in Beijing in 2008, most of which have been addressed in this paper. Kaiwen Meng{\textquoteright}s work was supported in part by the National Natural Science Foundation of China (11671329) and by the Fundamental Research Funds for the Central Universities (JBK1805001). Minghua Li{\textquoteright}s work was supported in part by the National Natural Science Foundation of China (11301418), the Natural Science Foundation of Chongqing Municipal Science and Technology Commission (Grant Number: cstc2018jcyjAX0226), the Basic Science and Frontier Technology Research of Yongchuan (Grant Number: Ycstc, 2018nb1401), the Foundation for High-level Talents of Chongqing University of Art and Sciences (Grant Numbers: R2016SC13, P2017SC01), the Key Laboratory of Complex Data Analysis and Artificial Intelligence of Chongqing Municipal Science and Technology Commission. Xiaoqi Yang{\textquoteright}s work was supported in part by the Research Grants Council of Hong Kong (PolyU 15218219). Publisher Copyright: {\textcopyright} 2020, Springer-Verlag GmbH Germany, part of Springer Nature and Mathematical Optimization Society.",
year = "2021",
month = sep,
doi = "10.1007/s10107-020-01568-0",
language = "English",
volume = "189",
pages = "455 -- 489",
journal = "Mathematical Programming",
issn = "0025-5610",
publisher = "Springer-Verlag GmbH and Co. KG",
number = "1-2",
}