標(biāo)題: Titlebook: Generalized Convexity, Generalized Monotonicity and Applications; Proceedings of the 7 Andrew Eberhard,Nicolas Hadjisavvas,Dinh The Luc Con [打印本頁] 作者: damped 時間: 2025-3-21 20:06
書目名稱Generalized Convexity, Generalized Monotonicity and Applications影響因子(影響力)
書目名稱Generalized Convexity, Generalized Monotonicity and Applications影響因子(影響力)學(xué)科排名
書目名稱Generalized Convexity, Generalized Monotonicity and Applications網(wǎng)絡(luò)公開度
書目名稱Generalized Convexity, Generalized Monotonicity and Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Generalized Convexity, Generalized Monotonicity and Applications被引頻次
書目名稱Generalized Convexity, Generalized Monotonicity and Applications被引頻次學(xué)科排名
書目名稱Generalized Convexity, Generalized Monotonicity and Applications年度引用
書目名稱Generalized Convexity, Generalized Monotonicity and Applications年度引用學(xué)科排名
書目名稱Generalized Convexity, Generalized Monotonicity and Applications讀者反饋
書目名稱Generalized Convexity, Generalized Monotonicity and Applications讀者反饋學(xué)科排名
作者: catagen 時間: 2025-3-21 20:58
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.作者: 前兆 時間: 2025-3-22 04:10 作者: Immunization 時間: 2025-3-22 05:49 作者: 刺耳的聲音 時間: 2025-3-22 10:34
Fundamentals of Electrode Processes,ing with strongly monotone and co-coercive operators in a real Hilbert space. We show that one can choose regularization operators such that the solution of a strongly monotone variational inequality can be obtained as the fixed point of a certain contractive mapping. Moreover a solution of a co-coe作者: SLUMP 時間: 2025-3-22 14:17
Energy Cascade and Pinch Analysis,set only in a part of iterations (one third of the subcases). For the other iterations, only one projection is used. A global convergence is proved under the weak assumption that the multifunction of the problem is pseudomonotone at a solution, closed, lower hemicontinuous, and bounded on each bound作者: SLUMP 時間: 2025-3-22 19:59
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.作者: 并入 時間: 2025-3-23 00:51
https://doi.org/10.1007/978-3-030-84417-2x set is not necessarily open or closed. Under suitable generalized convexity assumptions we derive a weak, strong and strict converse duality theorem. By means of a suitable transformation of variables these results are then applied to a class of fractional programs involving a ratio of a convex an作者: 宣誓書 時間: 2025-3-23 03:40 作者: gerontocracy 時間: 2025-3-23 08:42 作者: DAFT 時間: 2025-3-23 09:44 作者: 銼屑 時間: 2025-3-23 15:13
Logic and Proof Beyond Equalitysentation of a polynomial function as a difference of convex polynomials. An adapted algorithm, which uses a combined method of outer approximation and prismatical subdivisions, has been implemented to solve this problem. The solution obtained with a local optimization package is also included and t作者: 圣歌 時間: 2025-3-23 21:38 作者: Allergic 時間: 2025-3-24 00:59
Andrew Eberhard,Nicolas Hadjisavvas,Dinh The LucBased on talks presented at the 7th International Symposium on generalized convexity and generalized monotonicity.Includes supplementary material: 作者: 咆哮 時間: 2025-3-24 03:59 作者: GRE 時間: 2025-3-24 09:50 作者: folliculitis 時間: 2025-3-24 13:20
https://doi.org/10.1007/b102138Convexity; Hilbert space; algorithms; game theory; global optimization; multi-objective optimization; oper作者: 追逐 時間: 2025-3-24 15:05 作者: 復(fù)習(xí) 時間: 2025-3-24 22:52
https://doi.org/10.1007/978-1-4757-4843-7A 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.作者: DOLT 時間: 2025-3-25 00:57 作者: critic 時間: 2025-3-25 05:28 作者: Jacket 時間: 2025-3-25 10:07 作者: Hemiparesis 時間: 2025-3-25 15:22
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.作者: depreciate 時間: 2025-3-25 18:46
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.作者: infantile 時間: 2025-3-25 21:50 作者: 撕裂皮肉 時間: 2025-3-26 00:27
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.作者: nugatory 時間: 2025-3-26 04:55
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.作者: Conclave 時間: 2025-3-26 12:17
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.作者: WAX 時間: 2025-3-26 15:17 作者: 暴發(fā)戶 時間: 2025-3-26 17:42
(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.作者: 動機(jī) 時間: 2025-3-26 22:37 作者: Neuralgia 時間: 2025-3-27 03:45
On the Pseudoconvexity of the Sum of Two Linear Fractional Functionsis 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.作者: PAN 時間: 2025-3-27 05:23
Applying Global Optimization to a Problem in Short-Term Hydrothermal Schedulingsentation of a polynomial function as a difference of convex polynomials. An adapted algorithm, which uses a combined method of outer approximation and prismatical subdivisions, has been implemented to solve this problem. The solution obtained with a local optimization package is also included and their results are compared.作者: NEX 時間: 2025-3-27 10:44
Conference proceedings 2005tics and other sciences. This is due to the fact that mathematical models with these functions are more suitable to describe problems of the real world than models using conventional convex and monotone functions. Generalized convexity and monotonicity are now considered as an independent branch of 作者: 蠟燭 時間: 2025-3-27 17:15
1571-568X erial: In recent years there is a growing interest in generalized convex fu- tions and generalized monotone mappings among the researchers of - plied mathematics and other sciences. This is due to the fact that mathematical models with these functions are more suitable to describe problems of the re作者: 外貌 時間: 2025-3-27 21:37 作者: 拱墻 時間: 2025-3-28 00:29
Concise Guide to Computation Theoryte to convex sets. By giving a central role to a separation property of downward sets similar to that of convex sets, a theory of monotonic optimization can be developed which parallels d.c. optimization in several respects.作者: tattle 時間: 2025-3-28 05:45
Energy Cascade and Pinch Analysis,der the weak assumption that the multifunction of the problem is pseudomonotone at a solution, closed, lower hemicontinuous, and bounded on each bounded subset (it is not necessarily continuous). Some numerical test problems are implemented by using MATLAB with encouraging effectiveness.作者: FATAL 時間: 2025-3-28 06:35
Shailendra Kumar,Sudhirkumar V. Baraiated second order directional derivative is demanded this forces the first order subdifferential to possess a local Lipschitz property. To enable the study of a broader classes of nonsmooth functions we show that a combination of the infimal and integral convolutions needs to be used when constructing approximating smooth functions.作者: Indict 時間: 2025-3-28 12:28 作者: amygdala 時間: 2025-3-28 18:03
https://doi.org/10.1007/978-3-030-84417-2d an affine function with a set constraint in addition to inequality and equality constraints. The results extend classical fractional programming duality by allowing for a set constraint involving a convex set that is not necessarily open or closed.作者: Ascribe 時間: 2025-3-28 21:48 作者: 執(zhí) 時間: 2025-3-29 00:03 作者: 記成螞蟻 時間: 2025-3-29 03:12 作者: ARCH 時間: 2025-3-29 08:09 作者: Aboveboard 時間: 2025-3-29 13:53 作者: gait-cycle 時間: 2025-3-29 18:44 作者: Arthr- 時間: 2025-3-29 22:29
Second Order Subdifferentials Constructed Using Integral Convolutions Smoothingated second order directional derivative is demanded this forces the first order subdifferential to possess a local Lipschitz property. To enable the study of a broader classes of nonsmooth functions we show that a combination of the infimal and integral convolutions needs to be used when constructing approximating smooth functions.作者: 獸群 時間: 2025-3-30 00:52 作者: Deadpan 時間: 2025-3-30 05:32 作者: GRIPE 時間: 2025-3-30 09:55
Fundamentals of Electrode Processes,methods based on the auxiliary problem principle. They also lead to new algorithms for solving generalized variational inequalities involving co-coercive operators. By the Banach contraction mapping principle the convergence rate can be easily established.作者: Proclaim 時間: 2025-3-30 12:48
Lipschitzian Stability of Parametric Constraint Systems in Infinite Dimensionsof parametric constraint systems with evaluating the exact Lipschitzian bounds. Most results are obtained for the class of Asplund spaces, which particularly includes all reflexive spaces, although some important characteristics are given in the general Banach space setting.作者: Ligneous 時間: 2025-3-30 17:16
On the Contraction and Nonexpansiveness Properties of the Marginal Mappings in Generalized Variationmethods based on the auxiliary problem principle. They also lead to new algorithms for solving generalized variational inequalities involving co-coercive operators. By the Banach contraction mapping principle the convergence rate can be easily established.作者: 粗糙 時間: 2025-3-30 23:35 作者: 卡死偷電 時間: 2025-3-31 03:41
(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.作者: concubine 時間: 2025-3-31 07:56 作者: 貧困 時間: 2025-3-31 12:30 作者: septicemia 時間: 2025-3-31 15:46 作者: KIN 時間: 2025-3-31 20:55
A Projection-Type Algorithm for Pseudomonotone Nonlipschitzian Multivalued Variational Inequalitiesset only in a part of iterations (one third of the subcases). For the other iterations, only one projection is used. A global convergence is proved under the weak assumption that the multifunction of the problem is pseudomonotone at a solution, closed, lower hemicontinuous, and bounded on each bound作者: 雇傭兵 時間: 2025-3-31 21:45 作者: fabricate 時間: 2025-4-1 05:00
Duality in Fractional Programming Problems with Set Constraintsx set is not necessarily open or closed. Under suitable generalized convexity assumptions we derive a weak, strong and strict converse duality theorem. By means of a suitable transformation of variables these results are then applied to a class of fractional programs involving a ratio of a convex an
