找回密碼
 To register

QQ登錄

只需一步,快速開(kāi)始

掃一掃,訪問(wèn)微社區(qū)

打印 上一主題 下一主題

Titlebook: Generalized Convexity, Generalized Monotonicity and Applications; Proceedings of the 7 Andrew Eberhard,Nicolas Hadjisavvas,Dinh The Luc Con

[復(fù)制鏈接]
樓主: damped
21#
發(fā)表于 2025-3-25 05:28:56 | 只看該作者
22#
發(fā)表于 2025-3-25 10:07:49 | 只看該作者
23#
發(fā)表于 2025-3-25 15:22:23 | 只看該作者
Characterizing Invex and Related PropertiesA characterization of ., given by Glover and Craven, is extended to functions in abstract spaces. . for a vector function coincides with . in a restricted set of directions. The . property of Jeyakumar and Mond is also characterized. Some differentiability properties of the invex . are also obtained.
24#
發(fā)表于 2025-3-25 18:46:16 | 只看該作者
Second Order Optimality Conditions for Nonsmooth Multiobjective Optimization ProblemsIn this paper second-order necessary optimality conditions for nonsmooth vector optimization problems are given by smooth approximations. We extend to the vector case the approach introduced by Ermoliev, Norkin and Wets to define generalized derivatives for discontinuous functions as limit of the classical derivatives of regular functions.
25#
發(fā)表于 2025-3-25 21:50:13 | 只看該作者
26#
發(fā)表于 2025-3-26 00:27:55 | 只看該作者
A Plastics Overview: Figures and Tablesussed, the idea of polyhedral combinatorics is outlined and the use of convexity concepts in algorithmic design is shown. Moreover, combinatorial optimization problems arising from convex configurations in the plane are discussed.
27#
發(fā)表于 2025-3-26 04:55:45 | 只看該作者
Hillard M. Lazarus,Alvin H. Schmaierproblems we state weak and strong duality theorems based on different generalized concavity assumptions. The proposed dual problems provide a unified framework generalizing Wolfe and Mond-Weir results.
28#
發(fā)表于 2025-3-26 12:17:03 | 只看該作者
Standard Operating Procedures (SOP),is transformation preserves pseudoconvexity of a function. The result is then used to characterize sums of two linear fractional functions which are still pseudoconvex. This in turn leads to a characterization of pseudolinear sums of two linear fractional functions.
29#
發(fā)表于 2025-3-26 15:17:11 | 只看該作者
30#
發(fā)表于 2025-3-26 17:42:51 | 只看該作者
(Generalized) Convexity and Discrete Optimizationussed, the idea of polyhedral combinatorics is outlined and the use of convexity concepts in algorithmic design is shown. Moreover, combinatorial optimization problems arising from convex configurations in the plane are discussed.
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-12 06:51
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
喀喇| 余干县| 积石山| 博野县| 故城县| 盐边县| 五原县| 兖州市| 钦州市| 来安县| 安远县| 海门市| 宿松县| 泰顺县| 和林格尔县| 彩票| 青铜峡市| 特克斯县| 涞水县| 屯门区| 图木舒克市| 化州市| 白朗县| 东平县| 鹤庆县| 克什克腾旗| 称多县| 永城市| 焉耆| 南康市| 金昌市| 兴化市| 株洲县| 拉萨市| 营口市| 石城县| 来凤县| 浪卡子县| 荃湾区| 永昌县| 沐川县|