Vu Hong Quan, Duong Thi Viet An, Christiane Tammer, Nonsmooth nearly convex optimization problems and applications in robustness
Full Text: PDF
DOI: 10.23952/jnva.11.2027.2.01
Volume 11, Issue 2, 1 April 2027, Pages 239-256
Abstract. This paper deals with nearly convex optimization problems in the face of data uncertainty within the framework of robust optimization. Specifically, we investigate optimality conditions for nonsmooth robust optimization problems with nearly convex data. To do so, we first examine the rule for computing the subdifferential of the maximum of nearly convex functions. As an application, we study an optimization problem under uncertainty where the involved functions are nearly convex and derive necessary and sufficient conditions for solutions of the corresponding strictly robust counterpart problem. These are the main results of this paper. The paper presents several numerical examples to illustrate the results as well.
How to Cite this Article:
V.H. Quan, D.T.V. An, C. Tammer, Nonsmooth nearly convex optimization problems and applications in robustness, J. Nonlinear Var. Anal. 11 (2027), 239-256.
