2020
DOI: 10.3934/jimo.2019074
|View full text |Cite
|
Sign up to set email alerts
|

Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty

Abstract: We introduce robust weak sharp and robust sharp solution to a convex programming with the objective and constraint functions involved uncertainty. The characterizations of the sets of all the robust weak sharp solutions are obtained by means of subdiferentials of convex functions, DC fuctions, Fermat rule and the robust-type subdifferential constraint qualification, which was introduced in X.K. Sun, Z.Y. Peng and X. Le Guo, Some characterizations of robust optimal solutions for uncertain convex optimization pr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
4

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 23 publications
0
3
0
Order By: Relevance
“…It is obvious that the functions f i (•, u i ), i = 1, 2 and g(•, v) are not convex. Therefore, [35,Theorem 4.2] is not applicable for this example.…”
Section: Definition 32 ([11]mentioning
confidence: 99%
See 2 more Smart Citations
“…It is obvious that the functions f i (•, u i ), i = 1, 2 and g(•, v) are not convex. Therefore, [35,Theorem 4.2] is not applicable for this example.…”
Section: Definition 32 ([11]mentioning
confidence: 99%
“…Very recently, with the intention to answer the question "How about optimality condition for weak sharp solutions, particularly, in a robust optimization? ", Kerdkaew and Wangkeeree [35] introduced robust weak sharp and robust sharp solution to a convex cone-constrained optimization problem with data uncertainty and some optimality conditions for the robust weak sharp solutions problem were established. Moreover, as an application, the authors presented the characterization of the robust weak sharp weakly efficient solution sets for convex uncertain multiobjective optimization problems.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation