Generalized -univex -set functions and global parametric sufficient optimality conditions in minmax fractional subset programming.
Generalized -univex -set functions and semiparametric duality models in multiobjective fractional subset programming.
Generalized -univex -set functions and global semiparametric sufficient efficiency conditions in multiobjective fractional subset programming.
Generalized minimizers of convex integral functionals, Bregman distance, Pythagorean identities
Integral functionals based on convex normal integrands are minimized subject to finitely many moment constraints. The integrands are finite on the positive and infinite on the negative numbers, strictly convex but not necessarily differentiable. The minimization is viewed as a primal problem and studied together with a dual one in the framework of convex duality. The effective domain of the value function is described by a conic core, a modification of the earlier concept of convex core. Minimizers...
Generalized second-order mixed symmetric duality in nondifferentiable mathematical programming.
Global and local optimality conditions in set-valued optimization problems.