نتایج جستجو برای: conic scalarization

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

2017
H. W Corley

Efficient points are obtained for cone-ordered maximizations in n R using the method of scalarization. Various scalarizations are presented for ordering cones in general and then for the important special case of polyhedral cones. For polyhedral cones, it is shown how to find vectors in the positive dual cone that are needed for a scalarized objective function. Instructive examples are presented.

Journal: :Optimization Letters 2013
X. J. Long X. B. Li J. Zeng

The purpose of this paper is to consider the set-valued optimization problem in Asplund spaces without convexity assumption. By a scalarization function introduced by Tammer and Weidner (J Optim Theory Appl 67:297–320, 1990), we obtain the Lagrangian condition for approximate solutions on set-valued optimization problems in terms of the Mordukhovich coderivative.

2001
Y. YOSHIDA M. YASUDA J. NAKAGAMI M. KURANO

In a stochastic and fuzzy environment, a multi-objective fuzzy stopping problem is discussed. The randomness and fuzziness are evaluated by probabilistic expectations and scalarization functions respectively. Pareto optimal fuzzy stopping times are given under the assumption of regularity for stopping rules, by using λ-optimal stopping times.

Journal: :J. Optimization Theory and Applications 2014
M. Oveisiha Jafar Zafarani

In this paper by using the scalarization method, we consider Stamppachia variational-like inequalities in terms of normal subdifferential for set-valued maps and study their relations with set-valued optimization problems. Furthermore, some characterizations of the solution sets of K-pseudoinvex extremum problems are given.

2004
E. Molho M. Rocca

In this paper we study several existing notions of well-posedness for vector optimization problems. We distinguish them into two classes and we establish the hierarchical structure of their relationships. Moreover, we relate vector well-posedness and well-posedness of an appropriate scalarization. This approach allows us to show that, under some compactness assumption, quasiconvex problems are ...

Journal: :Computers & Geosciences 2016
Bojan Savric Bernhard Jenny

Conic map projections are appropriate for mapping regions at medium and large scales with east–west extents at intermediate latitudes. Conic projections are appropriate for these cases because they show the mapped area with less distortion than other projections. In order to minimize the distortion of the mapped area, the two standard parallels of conic projections need to be selected carefully...

Journal: :international journal of nonlinear analysis and applications 0
sushanta kumar mohanta west bengal state university

the main purpose of this paper is to obtain sufficient conditions for existence of points of coincidence and common fixed points for three self mappings in $b$-metric spaces. next, we obtain cone $b$-metric version of these results by using a scalarization function. our results extend and generalize several well known comparable results in the existing literature.

2003
Franco Giannessi Giandomenico Mastroeni Letizia Pellegrini

By exploiting recent results, it is shown that the theories of Vector Optimization and of Vector Variational Inequalities can be based on the image space analysis and theorems of the alternative or separation theorems. It is shown that, starting from such a general scheme, several theoretical aspects can be developed – like optimality conditions, duality, penalization – as well as methods of so...

2014
CRISTINA STAMATE ANCA CROITORU

We present some integrals for vector measurable multifunctions with respect to a fuzzy measure obtained by scalarization. Calculus rules, relationships between these integrals and the vector integrals defined until now and some convergence results are presented. Key–words: fuzzy measure, fuzzy integral, measurable multifunction.

2005
Jörg Fliege Christoph Heermann Bernd Weyers

We present a new adaptive algorithm for convex quadratic multicriteria optimization. The algorithm is able to adaptively refine the approximation to the set of efficient points by way of a warm-start interior-point scalarization approach. Numerical results show that this technique is faster than a standard method used for this problem.

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

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