scalar and vector optimization
Recently Published Documents


TOTAL DOCUMENTS

10
(FIVE YEARS 1)

H-INDEX

3
(FIVE YEARS 0)

Author(s):  
D. T. V. An ◽  
C. Gutiérrez

AbstractThis paper focuses on formulas for the ε-subdifferential of the optimal value function of scalar and vector convex optimization problems. These formulas can be applied when the set of solutions of the problem is empty. In the scalar case, both unconstrained problems and problems with an inclusion constraint are considered. For the last ones, limiting results are derived, in such a way that no qualification conditions are required. The main mathematical tool is a limiting calculus rule for the ε-subdifferential of the sum of convex and lower semicontinuous functions defined on a (non necessarily reflexive) Banach space. In the vector case, unconstrained problems are studied and exact formulas are derived by linear scalarizations. These results are based on a concept of infimal set, the notion of cone proper set and an ε-subdifferential for convex vector functions due to Taa.


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.


Sign in / Sign up

Export Citation Format

Share Document