نتایج جستجو برای: quasi convex

تعداد نتایج: 137203  

Journal: :Siam Journal on Optimization 2021

We consider a generalization of the Bauer maximum principle. work with tensorial products convex measures set that are not necessarily compact but generated by their extreme points. show quasi-convex lower semicontinuous function on this product space is reached finite mixtures Our an extension principle in three different aspects. First, we only assume objective functional quasi-convex. Second...

2004
Ramani S. Pilla

This paper develops inferential theory for hypothesis testing under general convex cone alternatives for correlated data. Often, interest lies in detecting order among treatment effects, while simultaneously modeling relationships with regression parameters. Incorporating shape or order restrictions in the modeling framework improves the efficiency of statistical methods. While there exists ext...

Journal: :Journal of Mathematical Analysis and Applications 2012

2014
M. A. LATIF S. S. DRAGOMIR

In this paper, a new weighted identity for differentiable functions of two variables defined on a rectangle from the plane is established. By using the obtained identity and analysis, some new weighted integral inequalities for the classes of co-ordinated convex, co-ordinated wright-convex and co-ordinated quasi-convex functions on the rectangle from the plane are established which provide weig...

Journal: :Math. Meth. of OR 2003
Yoshio Okamoto

A game on a convex geometry was introduced by Bilbao as a model of partial cooperation. We investigate some properties of the core of a game on a convex geometry. First, we show that if a game is quasi-convex, then the core is stable. This result can be seen as an extension of a result by Shapley for traditional cooperative games. Secondly, we show the core on the class of balanced games on a c...

2016
Fanhua Shang Yuanyuan Liu James Cheng

The Schatten-p quasi-norm (0<p<1) is usually used to replace the standard nuclear norm in order to approximate the rank function more accurately. However, existing Schattenp quasi-norm minimization algorithms involve singular value decomposition (SVD) or eigenvalue decomposition (EVD) in each iteration, and thus may become very slow and impractical for large-scale problems. In this paper, we fi...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید