找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Generalized Convexity and Related Topics; Igor V. Konnov,Dinh The Luc,Alexander M. Rubinov Conference proceedings 2006 Springer-Verlag Ber

[复制链接]
楼主: opioid
发表于 2025-3-25 07:10:11 | 显示全部楼层
Points of Efficiency in Vector Optimization with Increasing-along-rays Property and Minty Variationaquasiconvexity plays a crucial role to extend scalar evidences. This class of functions, indeed, guarantees a Minty-type variational inequality is a necessary and sufficient optimality condition for several kind of efficient solution.
发表于 2025-3-25 10:01:42 | 显示全部楼层
Higher Order Properly Efficient Points in Vector Optimizationerivatives. Together with the optimality conditions obtained in [.] and [.] in the case of .-minimizers, they play a crucial role in the investigation. Further, to get a satisfactory answer to the posed reversal problem, we deal with sense I and sense II solution concepts, as defined in [.] and [.].
发表于 2025-3-25 14:30:43 | 显示全部楼层
发表于 2025-3-25 18:38:32 | 显示全部楼层
发表于 2025-3-25 21:58:40 | 显示全部楼层
Mathematical Programming with (,)-invexityWe introduce new invexity-type properties for differentiable functions, generalizing (.)-convexity. Optimality conditions for nonlinear programming problems are established under such assumptions, extending previously known results. Wolfe and Mond-Weir duals are also considered, and we obtain direct and converse duality theorems.
发表于 2025-3-26 00:26:28 | 显示全部楼层
发表于 2025-3-26 05:45:56 | 显示全部楼层
发表于 2025-3-26 11:27:05 | 显示全部楼层
David B. Mertz,David E. McCauleydifferentiable multiobjective programming problem are presented. We also introduce a general Mond-Weir type dual problem of the problem and establish weak duality theorem under generalized convexity assumptions. Strong duality result is derived using a constraint qualification for nondifferentiable multiobjective programming problems.
发表于 2025-3-26 16:27:21 | 显示全部楼层
https://doi.org/10.1007/3-540-30326-Xn a function and the precomposition of another one with a linear operator hold even when the convexity assumptions are replaced by almost convexity or nearly convexity. We also show that the duality statements due to Fenchel hold when the functions involved are taken only almost convex, respectively nearly convex.
发表于 2025-3-26 16:49:20 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-23 06:28
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表