, Volume 51, Issue 1, pp 5-36

From Scalar to Vector Optimization

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Initially, second-order necessary optimality conditions and sufficient optimality conditions in terms of Hadamard type derivatives for the unconstrained scalar optimization problem ϕ(x) → min, x ∈ ℝ m , are given. These conditions work with arbitrary functions ϕ: ℝ m → ℝ, but they show inconsistency with the classical derivatives. This is a base to pose the question whether the formulated optimality conditions remain true when the “inconsistent” Hadamard derivatives are replaced with the “consistent” Dini derivatives. It is shown that the answer is affirmative if ϕ is of class \(\mathcal{C}^{1,1}\) (i.e., differentiable with locally Lipschitz derivative).

Further, considering \(\mathcal{C}^{1,1}\) functions, the discussion is raised to unconstrained vector optimization problems. Using the so called “oriented distance” from a point to a set, we generalize to an arbitrary ordering cone some second-order necessary conditions and sufficient conditions given by Liu, Neittaanmaki, Krizek for a polyhedral cone. Furthermore, we show that the conditions obtained are sufficient not only for efficiency but also for strict efficiency.