Approximate optimality conditions and sensitivity analysis in nearly convex optimization
Optimization and Control
2024-10-08 v1
Abstract
In this paper, approximate optimality conditions and sensitivity analysis in nearly convex optimization are discussed. More precisely, as in the spirit of convex analysis, we introduce the concept of -subdifferential for nearly convex functions. Then, we examine some significant properties and rules for the -subdifferential. These rules are applied to study optimality conditions as well as sensitivity analysis for parametric nearly convex optimization problems, which are two important topics in optimization theory.
Cite
@article{arxiv.2410.04710,
title = {Approximate optimality conditions and sensitivity analysis in nearly convex optimization},
author = {Nguyen Van Tuyen and Liguo Jiao and Vu Hong Quan and Duong Thi Viet An},
journal= {arXiv preprint arXiv:2410.04710},
year = {2024}
}
Comments
20 pages