Titlebook: Generalized Convexity; Proceedings of the I Sándor Komlósi,Tamás Rapcsák,Siegfried Schaible Conference proceedings 1994 Springer-Verlag Ber

FLOAT

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.

西瓜

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.

碎石头

PRE

ostracize

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.

天赋

不妥协

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

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.

微生物

著名