scholarly journals Variational-like inequalities for n-dimensional fuzzy-vector-valued functions and fuzzy optimization

2019 ◽  
Vol 17 (1) ◽  
pp. 627-645
Author(s):  
Ting Xie ◽  
Zengtai Gong
Keyword(s):  
Variational Inequality ◽  
Fuzzy Number ◽  
Optimization Problems ◽  
Fuzzy Optimization ◽  
Decomposition Theorem ◽  
Variational Inequality Problems ◽  
Multiobjective Optimization Problems ◽  
Vector Valued Functions ◽  
The Relationship ◽  
Vector Valued

Abstract The existing results on the variational inequality problems for fuzzy mappings and their applications were based on Zadeh’s decomposition theorem and were formally characterized by the precise sets which are the fuzzy mappings’ cut sets directly. That is, the existence of the fuzzy variational inequality problems in essence has not been solved. In this paper, the fuzzy variational-like inequality problems is incorporated into the framework of n-dimensional fuzzy number space by means of the new ordering of two n-dimensional fuzzy-number-valued functions we proposed [Fuzzy Sets and Systems 295 (2016) 19-36]. As a theoretical basis, the existence and the basic properties of the fuzzy variational inequality problems are discussed. Furthermore, the relationship between the variational-like inequality problems and the fuzzy optimization problems is discussed. Finally, we investigate the optimality conditions for the fuzzy multiobjective optimization problems.

scholarly journals On V-r-invexity and vector variational-like inequalities

Filomat ◽  
2012 ◽  
Vol 26 (5) ◽  
pp. 1065-1073 ◽  
Author(s):  
S.K. Mishra ◽  
Vivek Laha
Keyword(s):  
Multiobjective Optimization ◽  
Vector Optimization ◽  
Critical Points ◽  
Optimization Problems ◽  
Efficient Solutions ◽  
Vector Optimization Problems ◽  
Multiobjective Optimization Problems ◽  
Vector Valued Functions ◽  
Vector Valued ◽  
Weak Vector

In this paper, we consider the multiobjective optimization problems involving the differentiable V-r-invex vector valued functions. Under the assumption of V-r-invexity, we use the Stampacchia type vector variational-like inequalities as tool to solve the vector optimization problems. We establish equivalence among the vector critical points, the weak efficient solutions and the solutions of the Stampacchia type weak vector variational-like inequality problems using Gordan?s separation theorem under the V-r-invexity assumptions. These conditions are more general than those appearing in the literature.

scholarly journals Continuous-Time Multiobjective Optimization Problems via Invexity

2007 ◽  
Vol 2007 ◽  
pp. 1-11 ◽  
Author(s):  
Valeriano A. De Oliveira ◽  
Marko A. Rojas-Medar
Keyword(s):  
Continuous Time ◽  
Efficient Solution ◽  
Multiobjective Programming ◽  
Optimization Problems ◽  
Weakly Efficient Solution ◽  
Multiobjective Problems ◽  
Multiobjective Optimization Problems ◽  
Relationship Of ◽  
The Relationship ◽  
Multiobjective Programming Problems

We introduce some concepts of generalized invexity for the continuous-time multiobjective programming problems, namely, the concepts of Karush-Kuhn-Tucker invexity and Karush-Kuhn-Tucker pseudoinvexity. Using the concept of Karush-Kuhn-Tucker invexity, we study the relationship of the multiobjective problems with some related scalar problems. Further, we show that Karush-Kuhn-Tucker pseudoinvexity is a necessary and suffcient condition for a vector Karush-Kuhn-Tucker solution to be a weakly efficient solution.

scholarly journals Vector and Ordered Variational Inequalities and Applications to Order-Optimization Problems on Banach Lattices

2013 ◽  
Vol 2013 ◽  
pp. 1-7
Author(s):  
Linsen Xie ◽  
Jinlu Li ◽  
Wenshan Yang
Keyword(s):  
Fixed Point ◽  
Variational Inequality ◽  
Variational Inequalities ◽  
Fixed Point Theorems ◽  
Optimization Problems ◽  
Banach Lattices ◽  
Variational Inequality Problems ◽  
Vector Spaces ◽  
Real Vector ◽  
Finite Dimensional

We investigate the connections between vector variational inequalities and ordered variational inequalities in finite dimensional real vector spaces. We also use some fixed point theorems to prove the solvability of ordered variational inequality problems and their application to some order-optimization problems on the Banach lattices.

Higher-order conditions for strict local Pareto minima for problems with partial order introduced by a polyhedral cone

2018 ◽  
Vol 24 (1) ◽  
pp. 45-54
Author(s):  
Aleksandra Stasiak
Keyword(s):  
Partial Order ◽  
Optimization Problems ◽  
Sufficient Conditions ◽  
Polyhedral Cone ◽  
Directional Derivatives ◽  
Pareto Minima ◽  
Necessary And Sufficient ◽  
Vector Valued Functions ◽  
Vector Valued ◽  
Derivatives Of

Abstract Using the definitions of μ-th order lower and upper directional derivatives of vector-valued functions, introduced in Rahmo and Studniarski (J. Math. Anal. Appl. 393 (2012), 212–221), we provide some necessary and sufficient conditions for strict local Pareto minimizers of order μ for optimization problems where the partial order is introduced by a pointed polyhedral cone with non-empty interior.

scholarly journals Generalized derivatives and optimization problems for n-dimensional fuzzy-number-valued functions

2020 ◽  
Vol 18 (1) ◽  
pp. 1451-1477
Author(s):  
Ting Xie ◽  
Zengtai Gong ◽  
Dapeng Li
Keyword(s):  
Fuzzy Number ◽  
Fuzzy Numbers ◽  
Optimization Problems ◽  
Directional Derivative ◽  
Fuzzy Optimization ◽  
Optimality Criteria ◽  
Generalized Derivatives ◽  
Duality Theorems ◽  
Generalized Derivative ◽  
Partial Orderings

Abstract In this paper, we present the concepts of generalized derivative, directional generalized derivative, subdifferential and conjugate for n-dimensional fuzzy-number-valued functions and discuss the characterizations of generalized derivative and directional generalized derivative by, respectively, using the derivative and directional derivative of crisp functions that are determined by the fuzzy mapping. Furthermore, the relations among generalized derivative, directional generalized derivative, subdifferential and convexity for n-dimensional fuzzy-number-valued functions are investigated. Finally, under two kinds of partial orderings defined on the set of all n-dimensional fuzzy numbers, the duality theorems and saddle point optimality criteria in fuzzy optimization problems with constraints are discussed.

scholarly journals Research on the Fundamental Principles and Characteristics of Correspondence Function

2015 ◽  
Vol 2015 ◽  
pp. 1-15
Author(s):  
Xiangru Li ◽  
Guanghui Wang ◽  
Q. M. Jonathan Wu
Keyword(s):  
Dimensional Space ◽  
Search Space ◽  
Parametric Model ◽  
One Dimensional ◽  
Correct Point ◽  
Matrix Similarity ◽  
Vector Valued Functions ◽  
Relationship Of ◽  
The Relationship ◽  
Vector Valued

The correspondence function (CF) is a concept recently introduced to reject the mismatches from given putative correspondences. The fundamental idea of the CF is that the relationship of some corresponding points between two images to be registered can be described by a pair of vector-valued functions, estimated by a nonparametric regression method with more flexibility than the normal parametric model, for example, homography matrix, similarity transformation, and projective transformations. Mismatches are rejected by checking their consistency with the CF. This paper proposes a visual scheme to investigate the fundamental principles of the CF and studies its characteristics by experimentally comparing it with the widely used parametric model epipolar geometry (EG). It is shown that the CF describes the mapping from the points in one image to their corresponding points in another image, which enables a direct estimation of the positions of the corresponding points. In contrast, the EG acts by reducing the search space for corresponding points from a two-dimensional space to a line, which is a problem in one-dimensional space. As a result, the undetected mismatches of the CF are usually near the correct corresponding points, but many of the undetected mismatches of the EG are far from the correct point.

scholarly journals Vector variational-like inequalities and vector optimization problems

2014 ◽  
Vol 30 (1) ◽  
pp. 101-108
Author(s):  
MIHAELA MIHOLCA ◽  
Keyword(s):  
Vector Optimization ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Vector Optimization Problem ◽  
Vector Optimization Problems ◽  
Limiting Subdifferential ◽  
Generalized Invexity ◽  
Vector Valued Functions ◽  
Vector Valued ◽  
Mordukhovich Limiting Subdifferential

In this paper, we present the concept of generalized invexity for vector-valued functions. Also, we consider different kinds of generalized vector variational-like inequality and a vector optimization problem. Some relations between vector variational-like inequalities and a vector optimization problem are established by using the properties of Mordukhovich limiting subdifferential.

Sign in / Sign up

Export Citation Format

Share Document