標(biāo)題: Titlebook: Generalized Convexity and Generalized Monotonicity; Proceedings of the 6 Nicolas Hadjisavvas,Juan Enrique Martínez-Legaz,Je Conference proc [打印本頁] 作者: deliberate 時間: 2025-3-21 18:06
書目名稱Generalized Convexity and Generalized Monotonicity影響因子(影響力)
書目名稱Generalized Convexity and Generalized Monotonicity影響因子(影響力)學(xué)科排名
書目名稱Generalized Convexity and Generalized Monotonicity網(wǎng)絡(luò)公開度
書目名稱Generalized Convexity and Generalized Monotonicity網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Generalized Convexity and Generalized Monotonicity被引頻次
書目名稱Generalized Convexity and Generalized Monotonicity被引頻次學(xué)科排名
書目名稱Generalized Convexity and Generalized Monotonicity年度引用
書目名稱Generalized Convexity and Generalized Monotonicity年度引用學(xué)科排名
書目名稱Generalized Convexity and Generalized Monotonicity讀者反饋
書目名稱Generalized Convexity and Generalized Monotonicity讀者反饋學(xué)科排名
作者: entitle 時間: 2025-3-21 22:57
Discrete Higher Order Convex Functions and their Applicationsrandom variables involved are discrete. We look for the minimum or maximum of a linear functional acting on an unknown probability distribution subject to a finite number of moment constraints. Using linear programming methodology, we present structural theorems, in both the univariate and multivari作者: Omnipotent 時間: 2025-3-22 01:15
Cuts and Semidefinite Relaxations for Nonconvex Quadratic Problemsedure can be applied for generating tighter positive semidefinite relaxations. Computational results indicate that the relative gap obtained by the relaxations is less than 1% when the number of variables is up to 100. We also show a branch and bound procedure for obtaining an exact solution of the 作者: 一大群 時間: 2025-3-22 06:45
The Steiner Ratio of ,y”, that means, given a finite set . of points in the plane, search for a network interconnecting these points with minimal length. This shortest network must be a tree and is called a Steiner Minimal Tree (SMT). It may contain vertices different from the points which axe to be connected. Such point作者: instulate 時間: 2025-3-22 10:58
Normal Cones to Sublevel Sets: An Axiomatic Approach the definition given in [.] (resp. [.]) is recovered. Moreover, the results obtained in [.] are extended in this more general setting. Under mild assumptions, quasiconvex continuous functions are classified, establishing an equivalence relation between functions with the same normal operator. Appli作者: 平息 時間: 2025-3-22 15:14 作者: 平息 時間: 2025-3-22 20:33 作者: motivate 時間: 2025-3-23 00:50
First and Second Order Characterizations of a Class of Pseudoconcave Vector Functionsoncavity and scalar strict pseudoconcavity, as well as the optimality properties of these functions, such as the global optimality of local optima, of critical points and of points verifying Kuhn-Tucker conditions. The considered functions come out to be particularly relevant since it is possible fo作者: 反抗者 時間: 2025-3-23 03:56 作者: peak-flow 時間: 2025-3-23 09:26 作者: 直覺沒有 時間: 2025-3-23 12:52
Representation of a Polynomial Function as a Difference of Convex Polynomials, with an Applicationt least one global minimum. To deal with this problem, it is useful to have a convex difference representation of all the functions involved, as this allows for employing so-called d.c. optimization techniques..Procedures that permit the calculation of the polynomial convex difference representation作者: follicular-unit 時間: 2025-3-23 15:02 作者: 不出名 時間: 2025-3-23 21:42
Generalized Convexity for Unbounded Sets: The Enlarged Spacee, by adjoining to the ordinary n-dimensional space “improper points” defined by directions, and developed a theory of convexity in such a space. Later the second author introduced a new model for the enlarged space, suitable for applying tools from the theory of cones, and closely related to the mo作者: 委屈 時間: 2025-3-23 22:16
A Note on Minty Variational Inequalities and Generalized Monotonicitylities. In particular, it is shown that the Minty variational inequality problem derived from a map . defined on a convex domain is solvable on any nonempty, compact, and convex subdomain if and only if . is properly quasimonotone.作者: set598 時間: 2025-3-24 05:15 作者: 結(jié)果 時間: 2025-3-24 08:56
https://doi.org/10.1007/978-3-7091-8284-0is. The objective is to deduce theoretical properties that permit to develop algorithms in order to derive efficient points for the analyzed problems. In particular, we study the application of properties to certain biobjective problems.作者: STING 時間: 2025-3-24 10:58 作者: 辮子帶來幫助 時間: 2025-3-24 16:35
Abner Louis Notkins,Michael B. A. Oldstoneallows for employing so-called d.c. optimization techniques..Procedures that permit the calculation of the polynomial convex difference representation of any polynomial are presented and analyzed here, and an application is made to a real problem whose functions are polynomials of degrees up to four.作者: 信條 時間: 2025-3-24 21:05
Minimization of the Sum of Several Linear Fractional Functionst approximate algorithm for rank-3 problems, generalized convex multiplicative programming approach and branch and bound algorithm using piecewise convex underestimating function. We will show that we are now able to obtain a globally optimal solution for up to rank-10 problems in a practical amount of time.作者: critic 時間: 2025-3-24 23:44 作者: 輕快走過 時間: 2025-3-25 03:26 作者: 龍卷風(fēng) 時間: 2025-3-25 11:11
Representation of a Polynomial Function as a Difference of Convex Polynomials, with an Applicationallows for employing so-called d.c. optimization techniques..Procedures that permit the calculation of the polynomial convex difference representation of any polynomial are presented and analyzed here, and an application is made to a real problem whose functions are polynomials of degrees up to four.作者: CAJ 時間: 2025-3-25 12:43 作者: 雄偉 時間: 2025-3-25 17:21 作者: Frisky 時間: 2025-3-26 00:00
The Basics of Object-Oriented Programming,del that Rockafellar & Wets called “ray model” of the “cosmic closure” of the Euclidean space in their recent book on Variational Analysis. In this paper we introduce that model and use it to get some new theorems and proofs.作者: 細(xì)查 時間: 2025-3-26 00:17
Cuts and Semidefinite Relaxations for Nonconvex Quadratic Problemsindefinite problems. Our branching scheme exploits the special structure of box constraints as well as the bounding procedure in which a pair of primal and dual solutions of the associated positive semidefinite relaxation is incorporated.作者: 助記 時間: 2025-3-26 05:03 作者: Benign 時間: 2025-3-26 09:20 作者: 好色 時間: 2025-3-26 15:24
https://doi.org/10.1007/978-1-4615-0857-1he determination of an MST is simple. Consequently, we are interested in the greatest lower bound for the ratio between the lengths of these both trees: .,which is called the Steiner ratio (of .,)..We look for estimates for .(3,.), depending on the parameter ., and determine general upper bounds for the Steiner ratio of .,.作者: expdient 時間: 2025-3-26 18:35 作者: 古文字學(xué) 時間: 2025-3-27 00:26 作者: Nerve-Block 時間: 2025-3-27 03:41
Minas Arsenakis,Bernard Roizmanns of suitable generalized convexity assumptions, we obtain some equivalences of the different notions of proper efficiency considered, with respect to the notion of efficiency. The results of this paper may be viewed as a generalization of the situation established for the smooth case.作者: Vulnerary 時間: 2025-3-27 08:48
Discrete Higher Order Convex Functions and their Applicationshe objective function is a kind of higher order convexity, expressed in terms of divided differences. A variant of the above, the discrete binomial moment problem, as well as generalization for discrete variable Chebyshev systems are also discussed. Finally, we present novel applications to valuations of financial instruments.作者: perjury 時間: 2025-3-27 10:02
Proper Efficiency and Generalized Convexity in Nonsmooth Vector Optimization Problemsns of suitable generalized convexity assumptions, we obtain some equivalences of the different notions of proper efficiency considered, with respect to the notion of efficiency. The results of this paper may be viewed as a generalization of the situation established for the smooth case.作者: 昏睡中 時間: 2025-3-27 15:33 作者: 易達(dá)到 時間: 2025-3-27 21:51 作者: aspect 時間: 2025-3-28 02:01
Lecture Notes in Economics and Mathematical Systems382189.jpg作者: nugatory 時間: 2025-3-28 02:58 作者: 兇殘 時間: 2025-3-28 07:22 作者: murmur 時間: 2025-3-28 11:32
0075-8442 Overview: 978-3-540-41806-1978-3-642-56645-5Series ISSN 0075-8442 Series E-ISSN 2196-9957 作者: Neuropeptides 時間: 2025-3-28 17:59 作者: 熱烈的歡迎 時間: 2025-3-28 20:57 作者: Maximizer 時間: 2025-3-29 02:04 作者: 招人嫉妒 時間: 2025-3-29 05:32
,Resource Management — Protection,lities. In particular, it is shown that the Minty variational inequality problem derived from a map . defined on a convex domain is solvable on any nonempty, compact, and convex subdomain if and only if . is properly quasimonotone.作者: Preamble 時間: 2025-3-29 07:18
Normal Cones to Sublevel Sets: An Axiomatic Approach the definition given in [.] (resp. [.]) is recovered. Moreover, the results obtained in [.] are extended in this more general setting. Under mild assumptions, quasiconvex continuous functions are classified, establishing an equivalence relation between functions with the same normal operator. Applications in pseudoconvexity are also discussed.作者: Incisor 時間: 2025-3-29 12:11
Stochastic ,-(increasing) Convexity of compound sums. This question is investigated here with respect to the class of stochastic .(increasing) convex orderings introduced recently. The analysis is based on a central property, called stochastic .(increasing) convexity, for families of parametric distributions.作者: drusen 時間: 2025-3-29 16:21
Fixed Point Theorems, Coincidence Theorems and Variational Inequalitiesult. A noncompact coincidence point theorem is also established. Applications of these results to establish the existence of solutions to variational inequalities in not necessarily reflexive Banach spaces are also considered.作者: 好色 時間: 2025-3-29 21:34
A Note on Minty Variational Inequalities and Generalized Monotonicitylities. In particular, it is shown that the Minty variational inequality problem derived from a map . defined on a convex domain is solvable on any nonempty, compact, and convex subdomain if and only if . is properly quasimonotone.作者: 除草劑 時間: 2025-3-30 03:21 作者: legislate 時間: 2025-3-30 06:31
https://doi.org/10.1007/978-1-4020-5608-6In the present paper we define weaker invexity-type properties and examine the relationships between the new concepts and other similar conditions. One obtains in this way necessary and sufficient conditions for Kuhn-Tucker sufficiency. Moreover one proves that the same conditions are sufficient for Wolfe duality.作者: left-ventricle 時間: 2025-3-30 08:28 作者: 損壞 時間: 2025-3-30 15:57
Vector Invex N-set Functions and Minmax ProgrammingVector invexity and generalized vector invexity for n-set functions is introduced which is then utilized to establish sufficient optimality and duality results for a class of minmax programming problems involving n-set functions. Applications of these results to fractional programming problems are also presented.作者: OGLE 時間: 2025-3-30 16:42 作者: 秘方藥 時間: 2025-3-30 22:05 作者: 太空 時間: 2025-3-31 03:28
Rohaida Mohd Saat,Hidayah Mohd Fadzilsum of .(≥ 2) linear fractional functions over a polytope. Algorithms to be discussed are: parametric simplex algorithm for rank-2 problems, convergent approximate algorithm for rank-3 problems, generalized convex multiplicative programming approach and branch and bound algorithm using piecewise con作者: 偽造者 時間: 2025-3-31 07:22 作者: Confirm 時間: 2025-3-31 11:18 作者: 吸氣 時間: 2025-3-31 13:54
https://doi.org/10.1007/978-1-4615-0857-1y”, that means, given a finite set . of points in the plane, search for a network interconnecting these points with minimal length. This shortest network must be a tree and is called a Steiner Minimal Tree (SMT). It may contain vertices different from the points which axe to be connected. Such point作者: 得體 時間: 2025-3-31 17:30 作者: Ischemic-Stroke 時間: 2025-3-31 22:56 作者: 過份艷麗 時間: 2025-4-1 04:20
