Coderivative necessary optimality conditions for sharp and robust efficiencies in vector optimization with variable ordering structure

Optimization ◽  
2016 ◽  
Vol 65 (7) ◽  
pp. 1417-1435 ◽  
Author(s):  
Elena-Andreea Florea
2017 ◽  
Vol 9 (4) ◽  
pp. 168
Author(s):  
Giorgio Giorgi

We take into condideration necessary optimality conditions of minimum principle-type, that is for optimization problems having, besides the usual inequality and/or equality constraints, a set constraint. The first part pf the paper is concerned with scalar optimization problems; the second part of the paper deals with vector optimization problems.


2003 ◽  
Vol 8 (2) ◽  
pp. 165-174 ◽  
Author(s):  
Davide La Torre

In this paper we introduce a notion of generalized derivative for nonsmooth vector functions in order to obtain necessary optimality conditions for vector optimization problems. This definition generalizes to the vector case the notion introduced by Michel and Penot and extended by Yang and Jeyakumar. This generalized derivative is contained in the Clarke subdifferential and then the corresponding optimality conditions are sharper than the Clarke's ones.


2018 ◽  
Vol 52 (2) ◽  
pp. 567-575 ◽  
Author(s):  
Do Sang Kim ◽  
Nguyen Van Tuyen

The aim of this note is to present some second-order Karush–Kuhn–Tucker necessary optimality conditions for vector optimization problems, which modify the incorrect result in ((10), Thm. 3.2).


Sign in / Sign up

Export Citation Format

Share Document