Stability property of a system of inequalities
暂无分享,去创建一个
Some general criteria are given for the stability of a system of convex inequalities and then extended to an arbitrary system by the procedure of convex approximation. The stability is understood in the following sense: given a system x∊D G(x)∊M, where D is a subset of a locally convex space X, M a closed convex cone in a locally convex space Y, G a mapping from D to Y, a solution [xbar] is said to be stable if for every neighbourhood W of xbar; there exists a neighbourhood V of 0 ∊ Y such that for any conditinuous mapping A: D → Y satisfying A(D ∩ W) ⊂V+M the perturbed system x∊D G(x) A(x)∊M has at lease one solution in W; the system is said to be stable if every its solution is stable.
[1] R. Rockafellar. Convex Functions and Duality in Optimization Problems and Dynamics , 1969 .
[2] J. Joly,et al. Stability and Duality in Convex Minimization Problems. , 1971 .
[3] On the convex approximation of nonlinear inequalities , 1974 .