Displaying similar documents to “Optimization analysis involving set functions.”

Strict minimizers of order m in nonsmooth optimization problems

Tadeusz Antczak, Krzysztof Kisiel (2006)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

In the paper, some sufficient optimality conditions for strict minima of order m in constrained nonlinear mathematical programming problems involving (locally Lipschitz) ( F , ρ ) -convex functions of order m are presented. Furthermore, the concept of strict local minimizer of order m is also used to state various duality results in the sense of Mond-Weir and in the sense of Wolfe for such nondifferentiable optimization problems.

New Farkas-type constraint qualifications in convex infinite programming

Nguyen Dinh, Miguel A. Goberna, Marco A. López, Ta Quang Son (2007)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

This paper provides KKT and saddle point optimality conditions, duality theorems and stability theorems for consistent convex optimization problems posed in locally convex topological vector spaces. The feasible sets of these optimization problems are formed by those elements of a given closed convex set which satisfy a (possibly infinite) convex system. Moreover, all the involved functions are assumed to be convex, lower semicontinuous and proper (but not necessarily real-valued)....