SEQUENTIAL OPTIMALITY CONDITIONS IN CONVEX PROGRAMMING VIA PERTURBATION APPROACH

摘要: where f : X → R is a proper convex and lower semicontinuous function, separated locally space C subset of the Pshenichnyi Rockafellar Lemma gives necessary sufficient optimality condition whenever regularity fulfilled an element ∈ dom(f) ∩ optimal solution (P0) if only 0 ∂f(a) +NC(a). This very important result in optimization with many applications. Nevertheless, it has some disadvantages. First all, can be minimizer on even 6∈ ∂f(a)+NC(a) (because for instance set could empty). Moreover, does not always hold finite dimensional case. Consider now problem