2016
DOI: 10.1007/s11117-016-0418-0
|View full text |Cite
|
Sign up to set email alerts
|

Sensitivity analysis in constrained set-valued optimization via Studniarski derivatives

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 16 publications
(2 citation statements)
references
References 25 publications
0
2
0
Order By: Relevance
“…In [13], properties of higher-order contingent-type derivatives of the perturbation and weak perturbation maps of a parameterized optimization problem have been obtained by using the higherorder contingent-type derivatives. In [1], Anh has obtained sensitivity results of set-valued optimization problem in terms of Studniarski derivatives. In [2], the higher-order contingent derivative of a parametrized set-valued optimization problem has been studied.…”
Section: Introductionmentioning
confidence: 99%
“…In [13], properties of higher-order contingent-type derivatives of the perturbation and weak perturbation maps of a parameterized optimization problem have been obtained by using the higherorder contingent-type derivatives. In [1], Anh has obtained sensitivity results of set-valued optimization problem in terms of Studniarski derivatives. In [2], the higher-order contingent derivative of a parametrized set-valued optimization problem has been studied.…”
Section: Introductionmentioning
confidence: 99%
“…In [6,9], the Clarke derivatives were employed for analyzing sensitivity. Properties of the contingent derivatives of some types of proper perturbation maps of a parameterized optimization problem were discussed in [1,7,16,23,25]. Some results in the proto-differentiability and semidifferentiability of the perturbation maps were obtained in [11,13,17,26].…”
Section: Introductionmentioning
confidence: 99%