“…There were many papers dealing with perturbed convex programs, for instance, [1], [4], [5], [6], [8], [11], [21], [22], [23], [24], [26], and [27]. A common feature of them is that the perturbed functionf is assumed to remain convex.…”
We investigate the problem of minimizing the perturbed convex functionf (x) = f (x)+p(x) over some convex subset D of a normed linear space X, where the function f is convex and the perturbation p is bounded. The key tool for our investigation is a convexity modulus of f named h 1 , whose generalized inverse function h −1
“…There were many papers dealing with perturbed convex programs, for instance, [1], [4], [5], [6], [8], [11], [21], [22], [23], [24], [26], and [27]. A common feature of them is that the perturbed functionf is assumed to remain convex.…”
We investigate the problem of minimizing the perturbed convex functionf (x) = f (x)+p(x) over some convex subset D of a normed linear space X, where the function f is convex and the perturbation p is bounded. The key tool for our investigation is a convexity modulus of f named h 1 , whose generalized inverse function h −1
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.