凸性
数学
数学优化
次导数
班级(哲学)
约束(计算机辅助设计)
集合(抽象数据类型)
约束优化问题
最优化问题
约束优化
正多边形
凸优化
计算机科学
人工智能
经济
程序设计语言
金融经济学
几何学
作者
F. Mashkoorzadeh,N. Movahedian,S. Nobakhtian
标识
DOI:10.1080/01630563.2019.1640249
摘要
We present optimality conditions for a class of nonsmooth and nonconvex constrained optimization problems. To achieve this aim, various well-known constraint qualifications are extended based on the concept of tangential subdifferential and the relations between them are investigated. Moreover, local and global necessary and sufficient optimality conditions are derived in the absence of convexity of the feasible set. In addition to the theoretical results, several examples are provided to illustrate the advantage of our outcomes.
科研通智能强力驱动
Strongly Powered by AbleSci AI