The problem of minimizing $${\tilde f=f+p}$$ over some convex subset of a Euclidean space is investigated, where f(x) = x T Ax + b T x is strictly convex and |p| is only assumed to be bounded by some positive number s. It is shown that the function $${\tilde f}$$ is strictly outer γ-convex...

A real-valued function f defined on a convex subset D of some normed linear space is said to be inner γ-convex w.r.t. some fixed roughness degree γ    0 if there is a $$\nu \in]0, 1]$$ such that $${\rm sup}_{\lambda\in[2,1+1/\nu]} \left(f((1 - \lambda)x_0 + \lambda x_1) - (1 - \lambda) f...

A nonsmooth multiobjective optimization problem involving generalized (F, α, ρ, d)-type I function is considered. Karush–Kuhn–Tucker type necessary and sufficient optimality conditions are obtained for a feasible point to be an efficient or properly efficient solution. Duality results are...

The problem of optimizing a biconvex function over a given (bi)convex or compact set frequently occurs in theory as well as in industrial applications, for example, in the field of multifacility location or medical image registration. Thereby, a function $$f:X\times Y\to{\mathbb{R}}$$ is called...