In this paper, we obtain sufficient conditions for the lower semicontinuity of an approximate solution mapping for a parametric generalized vector equilibrium problem involving set-valued mappings. By using a scalariz...
详细信息
In this paper, we obtain sufficient conditions for the lower semicontinuity of an approximate solution mapping for a parametric generalized vector equilibrium problem involving set-valued mappings. By using a scalarization method, we obtain the lower semicontinuity of an approximate solution mapping for such a problem without the assumptions of monotonicity and compactness.
scalarization techniques are a popular method for articulating preferences in solving multi-objective optimization problems. These techniques, however, have so far proven to be ill-suited in finding a preference-drive...
详细信息
ISBN:
(纸本)9781450334723
scalarization techniques are a popular method for articulating preferences in solving multi-objective optimization problems. These techniques, however, have so far proven to be ill-suited in finding a preference-driven approximation that still captures the Pareto front in its entirety. Therefore, we propose a new concept that defines an optimal distribution of points on the front given a specific scalarization function. It is proven that such an approximation exists for every real-valued problem irrespective of the shape of the corresponding front under some very mild conditions. We also show that our approach works well in obtaining an equidistant approximation of the Pareto front if no specific preference is articulated. Our analysis is complemented by the presentation of a new algorithm that implements the aforementioned concept. We provide in-depth simulation results to demonstrate the performance of our algorithm. The analysis also reveals that our algorithm is able to outperform current state-of-the-art algorithms on many popular benchmark problems.
We consider a single-macrocell heterogeneous multiple-input multiple-output network, where the macrocell shares the same frequency band with the femto network. The interference power to the macro users from the femto ...
详细信息
ISBN:
(纸本)9781479923908
We consider a single-macrocell heterogeneous multiple-input multiple-output network, where the macrocell shares the same frequency band with the femto network. The interference power to the macro users from the femto base stations is kept below a threshold to guarantee that the performance of the macro users does not degrade due to femto network. For this setting, we consider the problem of finding the set of all achievable power-rate tuples. Using the scalarization method, we cast the problem of finding the set of achievable power-rate tuples as a mathematical optimization problem. Using simulations we obtained the different sets of all achievable power-rate values, when the users are served by both macrocell and femtocells, and only by macrocell.
The multi-starting descent method is a promising approach to unimodal multiobjective function optimization problems because of its precision of obtained solutions. Descent methods can be classified into two categories...
详细信息
ISBN:
(纸本)9781424481262
The multi-starting descent method is a promising approach to unimodal multiobjective function optimization problems because of its precision of obtained solutions. Descent methods can be classified into two categories;the multiobjective descent method directly using the Jacobian matrix of objective functions and the scalarized descent method using the gradient of a scalarized objective function. In the multiobjective descent method and the scalarized descent method, a convergent point depends on an initial solution and a weight vector, respectively. However, it is difficult to choose appropriate initial solutions or weight vectors for obtaining widely and evenly distributed solutions. In order to remedy the problems of the conventional methods, we propose a multi-starting scalarized descent method named AWA that employs the Chebyshev norm method as a scalarization method and an adaptive scheme of weight vectors for the scalarization method. We show the effectiveness of the proposed method through some experiments.
In this paper, we obtain some fixed point theorems for new set-valued contractions in complete metric spaces. Then by using these results and the scalarization method, we present some fixed point theorems for set-valu...
详细信息
In this paper, we obtain some fixed point theorems for new set-valued contractions in complete metric spaces. Then by using these results and the scalarization method, we present some fixed point theorems for set-valued contractions in complete cone metric spaces without the normality assumption. We also present some examples to support our results.
In this note, using the well-known method of scalarization, we give an explicit characterization of the Pareto optimal stopping time for a vector-valued optimal stopping problem with only two reward functions. The pre...
详细信息
In this note, using the well-known method of scalarization, we give an explicit characterization of the Pareto optimal stopping time for a vector-valued optimal stopping problem with only two reward functions. The present problem is a natural generalization of the classical McDonald-Siegel optimal stopping problem.
In the context of multi-objective optimization, a properly efficient solution is one that is efficient while at least one of the tradeoffs between different objectives is limited. However, in some situations, it is po...
详细信息
In the context of multi-objective optimization, a properly efficient solution is one that is efficient while at least one of the tradeoffs between different objectives is limited. However, in some situations, it is possible that all efficient solutions have unlimited tradeoffs, which is not always appropriate. To provide new solutions that have at least one bounded tradeoff for such problems, we first introduce a new concept of efficiency by applying a family of scalarization functions for the decomposed multi-objective optimization problem. Then, we extend the concept of proper efficiency by examining the boundedness of the tradeoffs between scalar optimization subproblems and other subproblems. Another purpose of this paper is to investigate the effect of using the scalarizing functions for some subproblems in the decomposed multi-objective optimization problem. Our findings suggest that as the number of subproblems that use scalarizing functions increases, the solution set associated with the generalized proper efficiency concept becomes smaller.
In the paper, we propose Ricceri type theorem on Fan-Takahashi minimax inequality for set-valued maps by using the scalarization method proposed by Kuwano, Tanaka and Yamada based on a certain type of the set-relations.
In the paper, we propose Ricceri type theorem on Fan-Takahashi minimax inequality for set-valued maps by using the scalarization method proposed by Kuwano, Tanaka and Yamada based on a certain type of the set-relations.
This paper introduces the Lagrangian relaxation method to solve multiobjective optimization problems. It is often required to use the appropriate technique to determine the Lagrangian multipliers in the relaxation met...
详细信息
This paper introduces the Lagrangian relaxation method to solve multiobjective optimization problems. It is often required to use the appropriate technique to determine the Lagrangian multipliers in the relaxation method that leads to finding the optimal solution to the problem. Our analysis aims to find a suitable technique to generate Lagrangian multipliers, and later these multipliers are used in the relaxation method to solve Multiobjective optimization problems. We propose a search-based technique to generate Lagrange multipliers. In our paper, we choose a suitable and well-known scalarization method that transforms the original multiobjective into a scalar objective optimization problem. Later, we solve this scalar objective problem using Lagrangian relaxation techniques. We use Brute force techniques to sort optimum solutions. Finally, we analyze the results, and efficient methods are recommended.
The purpose of this paper is to generalize and improve some topological properties of solutions set to the set-valued vector equilibrium problems by using the scalar characterization method. Moreover, the Lipschitz co...
详细信息
The purpose of this paper is to generalize and improve some topological properties of solutions set to the set-valued vector equilibrium problems by using the scalar characterization method. Moreover, the Lipschitz continuity of an approximate solution mapping for the parametric set-valued vector equilibrium problems is studied.
暂无评论