標題: Titlebook: Generalized Convexity; Proceedings of the I Sándor Komlósi,Tamás Rapcsák,Siegfried Schaible Conference proceedings 1994 Springer-Verlag Ber [打印本頁] 作者: Precise 時間: 2025-3-21 17:19
書目名稱Generalized Convexity影響因子(影響力)
書目名稱Generalized Convexity影響因子(影響力)學科排名
書目名稱Generalized Convexity網(wǎng)絡公開度
書目名稱Generalized Convexity網(wǎng)絡公開度學科排名
書目名稱Generalized Convexity被引頻次
書目名稱Generalized Convexity被引頻次學科排名
書目名稱Generalized Convexity年度引用
書目名稱Generalized Convexity年度引用學科排名
書目名稱Generalized Convexity讀者反饋
書目名稱Generalized Convexity讀者反饋學科排名
作者: 核心 時間: 2025-3-21 23:37 作者: 熱情贊揚 時間: 2025-3-22 00:59 作者: syncope 時間: 2025-3-22 06:53 作者: exhilaration 時間: 2025-3-22 11:41 作者: indicate 時間: 2025-3-22 14:24
Generalized Convexity978-3-642-46802-5Series ISSN 0075-8442 Series E-ISSN 2196-9957 作者: indicate 時間: 2025-3-22 20:36 作者: BROOK 時間: 2025-3-22 23:54
Models for Software Reliability, cost game fully characterizes the structure of the core of the game and vice versa. The first characterization states that for the .-concavity of an n-person cost game it is both necessary and sufficient that all the [(. ? .)!]..! so-called marginal cost allocations belong to the core of the game. 作者: generic 時間: 2025-3-23 04:43 作者: Grandstand 時間: 2025-3-23 06:59 作者: Chromatic 時間: 2025-3-23 10:40 作者: Blasphemy 時間: 2025-3-23 17:19
Design Space Exploration for MAHA Frameworkon for a constrained minimization problem. In this paper we present, in section 1, an appropriate generalization of local and global convexity, which takes into account the structure of the feasible set and thus enables us to narrow the usual gap between necessary and sufficient optimality condition作者: expound 時間: 2025-3-23 19:31
Trajectory Analysis for Drivinggrangian type. In the paper we want to revisit again the problem of establishing regularity assumptions (or constraint qualifications, the difference in the terminology whether consisting in the condition involves or not the objective function) for a Lagrangian type optimality condition. We will dev作者: 偽書 時間: 2025-3-24 02:06
The Raspberry Pi Desktop Tools,heory. As such, this paper does not contain new results but serves as a hopefully easy introduction to the most important results in duality theory for convex/quasiconvex functions on locally convex real topological vector spaces. Moreover, its connection to optimization is also discussed.作者: scrutiny 時間: 2025-3-24 05:01 作者: glisten 時間: 2025-3-24 09:02
The Physics of Particular Qualities,Penot subdifferential. These results are combined with exact penalty function techniques to develop first order optimality conditions of the Karush-Kuhn-Tucker type for abstract cone-constrained programming problems. In addition these techniques are applied to quasidifferentiable programming problem作者: Airtight 時間: 2025-3-24 12:40 作者: 分開如此和諧 時間: 2025-3-24 15:18 作者: GENRE 時間: 2025-3-24 21:46
Bayesian Radial Basis Function InterpolationWe introduce a new characterization of functions defined over lattices providing a necessary condition for their quasiconcavity according to the “Ordinal Concavity” approach.作者: Deadpan 時間: 2025-3-25 01:27 作者: FLOAT 時間: 2025-3-25 03:37
C. M. Witkowski,A. H. Bond,M. BurtonIn this paper we describe a deep cut version of the ellipsoid algorithm and introduce a class of functions and their corresponding finite dimensional optimization problems to which it can be applied. Moreover, we show that an important subset of the quasiconvex functions belong to the above mentioned class.作者: 西瓜 時間: 2025-3-25 09:06
George Papadimitriou,Dimitris GizopoulosUsing the definition of ray in the euclidean space, we define a new class of functions that avoid Karamardian’s anomaly and which contain the quasimonotonic functions. These new functions have a good behaviour in relation to its optimal sets, allowing the construction of heuristic algorithms in order to find its extreme points.作者: 碎石頭 時間: 2025-3-25 13:09 作者: PRE 時間: 2025-3-25 18:46 作者: ostracize 時間: 2025-3-25 23:42
A note on ordinal concavityWe introduce a new characterization of functions defined over lattices providing a necessary condition for their quasiconcavity according to the “Ordinal Concavity” approach.作者: 天賦 時間: 2025-3-26 03:38 作者: 不妥協(xié) 時間: 2025-3-26 05:16
A deep cut ellipsoid algorithm and quasiconvex programmingIn this paper we describe a deep cut version of the ellipsoid algorithm and introduce a class of functions and their corresponding finite dimensional optimization problems to which it can be applied. Moreover, we show that an important subset of the quasiconvex functions belong to the above mentioned class.作者: Working-Memory 時間: 2025-3-26 12:15
Ray-quasiconvex and f-quasiconvex functionsUsing the definition of ray in the euclidean space, we define a new class of functions that avoid Karamardian’s anomaly and which contain the quasimonotonic functions. These new functions have a good behaviour in relation to its optimal sets, allowing the construction of heuristic algorithms in order to find its extreme points.作者: 微生物 時間: 2025-3-26 16:14 作者: 著名 時間: 2025-3-26 19:41 作者: SYN 時間: 2025-3-26 21:46
P. H. Pan M.D.,J. J. van der Aa Ph.D. convex functions via their extension from a nonconvex subset of the minor space to the whole space and introduce a weakened polyconvexity condition which implies quasiconvexity. The results are illustrated by examples.作者: hazard 時間: 2025-3-27 03:24
A. H. Benyamina,P. Boulet,K. Benhaouaelements and the interrelations between the elements of the class will be investigated, too. Some known theorems using differentiability on an open set will be proved for the case when differentiability is assumed only at a point.作者: 擴張 時間: 2025-3-27 05:32
Connections to the World Wide Web,ncide. This class includes, for instance, the convex functions, the .. perturbations of convex functions, the primal lower-nice functions (see [16]). As application we find a convergence theorem for the generalized gradients of a Γ-convergent sequence of functions which have a .-monotone subdifferential of order one (with . independent on .).作者: Ganglion-Cyst 時間: 2025-3-27 11:35
Design Space Exploration for MAHA Frameworktakes into account the structure of the feasible set and thus enables us to narrow the usual gap between necessary and sufficient optimality conditions. In section 2 we deal with quadratic problems for which we specify similar global optimality conditions.作者: 密碼 時間: 2025-3-27 16:21
The Rise of the Goose Creek Men,ems necessary and sufficient first order optimality conditions are discussed; moreover a general dual formulation and some inclusion relations among constraint qualifications of old and new type are considered.作者: Suppository 時間: 2025-3-27 19:50
The Physics of Particular Qualities,hn-Tucker type for abstract cone-constrained programming problems. In addition these techniques are applied to quasidifferentiable programming problems and similar necessary conditions and sufficient optimality conditions using generalized convexity are established.作者: 粗魯?shù)娜?nbsp; 時間: 2025-3-27 22:50 作者: 譏笑 時間: 2025-3-28 04:30 作者: 半導體 時間: 2025-3-28 06:50
Models for Software Reliability, the convex hull of the set of marginal cost allocations in the game. The notion of .-concave .-person games is illustrated by three examples: the airport game, the location game and the carpooling game.作者: abolish 時間: 2025-3-28 13:36
Generalized concavity in cooperative game theory: characterizations in terms of the core the convex hull of the set of marginal cost allocations in the game. The notion of .-concave .-person games is illustrated by three examples: the airport game, the location game and the carpooling game.作者: 警告 時間: 2025-3-28 18:36
Waqar Hussain,Jari Nurmi,Fabio Garzianctions are also discussed. Under appropiate assumptions of univexity, optimality conditions and duality results for Mond-Weir duality are established. In the end some suggestions for further research have been made.作者: ALLAY 時間: 2025-3-28 19:26
Trajectory Analysis for Drivingelop the study via a recently proposed approach [3]: the image space analysis. This approach has showed many interesting developments in many topics of optimization theory (optimality conditions, penalty methods, duality theory etc). We show that, also in this field, it represents a powerful tool for developing the analysis.作者: 制度 時間: 2025-3-28 23:31
Univex sets, functions and univex nonlinear programmingnctions are also discussed. Under appropiate assumptions of univexity, optimality conditions and duality results for Mond-Weir duality are established. In the end some suggestions for further research have been made.作者: 修飾語 時間: 2025-3-29 03:14 作者: staging 時間: 2025-3-29 07:44 作者: Afflict 時間: 2025-3-29 13:17 作者: Bravura 時間: 2025-3-29 18:43
Equivalence between generalized gradients and subdifferentials for a suitable class of lower semiconncide. This class includes, for instance, the convex functions, the .. perturbations of convex functions, the primal lower-nice functions (see [16]). As application we find a convergence theorem for the generalized gradients of a Γ-convergent sequence of functions which have a .-monotone subdifferential of order one (with . independent on .).作者: GENRE 時間: 2025-3-29 21:58
Generalizing convexity for second order optimality conditionstakes into account the structure of the feasible set and thus enables us to narrow the usual gap between necessary and sufficient optimality conditions. In section 2 we deal with quadratic problems for which we specify similar global optimality conditions.作者: 蚊子 時間: 2025-3-30 01:11 作者: 戲法 時間: 2025-3-30 06:49
Abstract nonsmooth nonconvex programminghn-Tucker type for abstract cone-constrained programming problems. In addition these techniques are applied to quasidifferentiable programming problems and similar necessary conditions and sufficient optimality conditions using generalized convexity are established.作者: 進取心 時間: 2025-3-30 10:52
A survey on optimality and duality in nonsmooth programmingis study is the Clarke subdifferential redefined for arbitrary nonlinear functions by the help of the generalized directional derivative of Clarke. In particular, the generalized Kuhn-Tucker sufficient optimality conditions and variants of Mond-Weir duality results are reviewed.作者: Vulnerary 時間: 2025-3-30 13:03
0075-8442 exity, this book presents severalimportantdevelopments in recently emerging areas. Also, a number ofinteresting applications are reported.978-3-540-57624-2978-3-642-46802-5Series ISSN 0075-8442 Series E-ISSN 2196-9957 作者: 哀求 時間: 2025-3-30 18:38
Univex sets, functions and univex nonlinear programmingnify the concepts of convexity, B-vexity, invexity and B-invexity. Some of their properties are proved and applications in nonlinear programming are discussed. Furthermore, generalized univex functions are also introduced and their relationships to univex functions and convex (generalized convex) fu作者: macabre 時間: 2025-3-30 23:46 作者: 社團 時間: 2025-3-31 04:41 作者: NICHE 時間: 2025-3-31 06:56 作者: 有偏見 時間: 2025-3-31 10:06
Equivalence between generalized gradients and subdifferentials for a suitable class of lower semiconich have a .-monotone subdifferential of order one (see def. (2.1)), the proximal subgradient, the lower semigradient and the generalized gradient coincide. This class includes, for instance, the convex functions, the .. perturbations of convex functions, the primal lower-nice functions (see [16]). 作者: Anal-Canal 時間: 2025-3-31 13:21
Generalizing convexity for second order optimality conditionson for a constrained minimization problem. In this paper we present, in section 1, an appropriate generalization of local and global convexity, which takes into account the structure of the feasible set and thus enables us to narrow the usual gap between necessary and sufficient optimality condition
