HIGHLIGHTS
- who: IJM and colleagues from the (UNIVERSITY) have published the paper: STABILITY IN E -CONVEX PROGRAMMING, in the Journal: (JOURNAL)
SUMMARY
An E-stability of S is denoted by D(x̄), x̄ ∈ S and is defined as D(x̄)=E: Rn → Rn: E(x̄) ∈ S. Assume that x̄, x̃ ∈ S and E ∈ D(λx̄ + (1 - λ)x̃), 0 ≤ λ ≤ 1, then λE x̄ + (1 - λ)E x̃ ∈ S. Let E ∈ λD(x̄) + (1 - λ)D(x̃) for any 0 ≤ λ ≤ 1, then E ∈ D(x̄) D(x̃) and hence E x̄, E x̃ ∈ S. Since E ∈ D(x . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.