Optimality conditions and saddle-point theory for nonsmooth generalized convexity multiobjective programming

Guilin(2009)

引用 0|浏览23
暂无评分
摘要
In this paper, we introduce generalized essentially pseudoconvex function and generalized essentially quasiconvex function, and give sufficient optimality conditions of the nonsmooth generalized convex multi-objective programming and its saddle point theorem about cone efficient solution.
更多
查看译文
关键词
optimality condition,optimisation,saddle-point theory,sufficient optimality condition,nonsmooth generalized convexity multiobjective programming,saddle point theorem,nonsmooth generalized convexity multiobjective,optimality conditions,quasiconvex function,nonsmooth generalized convex multi-objective,set theory,multiobjective programming,pseudoconvex function,cone efficient solution,saddle point,functional programming,mathematical programming,probability density function,optimization,programming,statistics,data mining,mathematics
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要