Computation of Graphical Derivative for a Class of Normal Cone Mappings under a Very Weak Condition
https://epubs.siam.org/doi/abs/10.1137/16M1066816Publisher, magazine: ,
Publication year: 2017
Lưu Trích dẫn Chia sẻAbstract
Let $\Gamma:=\{x\in \mathbb{R}^n\, |\, q(x)\in\Theta\},$ where $q: \mathbb{R}^n\rightarrow\mathbb{R}^m$ is a twice continuously differentiable mapping, and $\Theta$ is a nonempty polyhedral convex set in $\mathbb{R}^m.$ In this paper, we first establish a formula for exactly computing the graphical derivative of the normal cone mapping $N_\Gamma:\mathbb{R}^n\rightrightarrows\mathbb{R}^n,$ $x\mapsto N_\Gamma(x),$ under the condition that $M_q(x):=q(x)-\Theta$ is metrically subregular at the reference point. Then, based on this formula, we exhibit formulas for computing the graphical derivative of solution mappings and present characterizations of the isolated calmness for a broad class of generalized equations. Finally, applying this to optimization, we get a new result on the isolated calmness of stationary point mappings.
Tags: computation, graphical derivative, normal cone mapping, generalized equation, isolated calmness
Các bài viết liên quan đến tác giả Nguyễn Huy Chiêu
Characterizing Convexity of a Function by Its Frechet and Limiting Second-Order Subdifferentials
Convexity of sets and functions via second-order subdifferentials
Further Results on Subgradients of the Value Function to a Parametric Optimal Control Problem
Tilt Stability for Quadratic Programs with One or Two Quadratic Inequality Constraints
Coderivative Characterizations of Maximal Monotonicity for Set-Valued Mappings
Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality