In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a (weakly) LU-efficient solution in the considered nonsmooth multiobjective programming problem with the mult...In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a (weakly) LU-efficient solution in the considered nonsmooth multiobjective programming problem with the multiple interval-objective function. Further, the sufficient optimality conditions for a (weakly) LU-efficient solution and several duality results in Mond-Weir sense are proved under assumptions that the functions constituting the considered nondifferentiable multiobjective programming problem with the multiple interval- objective function are convex.展开更多
In locally convex Hausdorff topological vector spaces,ε-strongly efficient solutions for vector optimization with set-valued maps are discussed.Firstly,ε-strongly efficient point of set is introduced.Secondly,under ...In locally convex Hausdorff topological vector spaces,ε-strongly efficient solutions for vector optimization with set-valued maps are discussed.Firstly,ε-strongly efficient point of set is introduced.Secondly,under the nearly cone-subconvexlike set-valued maps,the theorem of scalarization for vector optimization is obtained.Finally,optimality conditions of ε-strongly efficient solutions for vector optimization with generalized inequality constraints and equality constraints are obtained.展开更多
New classes of functions namely (V, ρ)_(h,φ)-type I, quasi (V, ρ)_(h,φ)-type I and pseudo (V, ρ)_(h,φ)-type I functions are defined for multiobjective programming problem by using BenTal's generalized algebr...New classes of functions namely (V, ρ)_(h,φ)-type I, quasi (V, ρ)_(h,φ)-type I and pseudo (V, ρ)_(h,φ)-type I functions are defined for multiobjective programming problem by using BenTal's generalized algebraic operation. The examples of (V, ρ)_(h,φ)-type I functions are given. The sufficient optimality conditions are obtained for multi-objective programming problem involving above new generalized convexity.展开更多
The definition of generalized unified (C, α, ρ, d)-convex function is given. The concepts of generalized unified (C, α, ρ, d)-quasiconvexity, generalized unified (C, α, ρ, d)-pseudoconvexity and generalized unif...The definition of generalized unified (C, α, ρ, d)-convex function is given. The concepts of generalized unified (C, α, ρ, d)-quasiconvexity, generalized unified (C, α, ρ, d)-pseudoconvexity and generalized unified (C, α, ρ, d)-strictly pseudoconvex functions are presented. The sufficient optimality conditions for multiobjective nonsmooth semi-infinite programming are obtained involving these generalized convexity lastly.展开更多
In this paper, we focus on energy-efficient transceiver and relay beamforming design for multi-pair two-way relay system. The multi-antenna users and the multi-antenna relay are considered in this work. Different from...In this paper, we focus on energy-efficient transceiver and relay beamforming design for multi-pair two-way relay system. The multi-antenna users and the multi-antenna relay are considered in this work. Different from the existing works, the proposed algorithm is energy-efficient which is more applicable to the future green network. It considers both the sum-MSE problem and the power consumption problem for the users under the relay power constraint. Based on the optimal condition decomposition(OCD) method, the energy-efficient precoders at the users can be designed separately with limited information exchanged. The proposed relay beamforming algorithm is based on the alternative direction method of multipliers(ADMM) which has simpler iterative solution and enjoys good convergence. Simulation results demonstrate the performance of the proposed algorithms in terms of power consumption and MSE performance.展开更多
文摘In this paper, both Fritz John and Karush-Kuhn-Tucker necessary optimality conditions are established for a (weakly) LU-efficient solution in the considered nonsmooth multiobjective programming problem with the multiple interval-objective function. Further, the sufficient optimality conditions for a (weakly) LU-efficient solution and several duality results in Mond-Weir sense are proved under assumptions that the functions constituting the considered nondifferentiable multiobjective programming problem with the multiple interval- objective function are convex.
基金Foundation item: Supported by the Natural Science Foundation of China(10871216) Supported by the Natural Science Foundation Project of CQ CSTC(2008BB0346, 2007BB0441) Supported by the Excellent Young Teachers Program of Chongqing Jiaotong University(EYT08-016) Acknowledgement The author would like to thank the anonymous referee for the valuable remarks that helped considerably to correct and to improve the presentation.
文摘In locally convex Hausdorff topological vector spaces,ε-strongly efficient solutions for vector optimization with set-valued maps are discussed.Firstly,ε-strongly efficient point of set is introduced.Secondly,under the nearly cone-subconvexlike set-valued maps,the theorem of scalarization for vector optimization is obtained.Finally,optimality conditions of ε-strongly efficient solutions for vector optimization with generalized inequality constraints and equality constraints are obtained.
基金Supported by the NSF of Shaanxi Provincial Educational Department(06JK152)
文摘New classes of functions namely (V, ρ)_(h,φ)-type I, quasi (V, ρ)_(h,φ)-type I and pseudo (V, ρ)_(h,φ)-type I functions are defined for multiobjective programming problem by using BenTal's generalized algebraic operation. The examples of (V, ρ)_(h,φ)-type I functions are given. The sufficient optimality conditions are obtained for multi-objective programming problem involving above new generalized convexity.
基金Supported by the Science Foundation of Shaanxi Provincial Educational Department Natural Science Foundation of China(06JK152) Supported by the Graduate Innovation Project of Yanan uni- versity(YCX201003)
文摘The definition of generalized unified (C, α, ρ, d)-convex function is given. The concepts of generalized unified (C, α, ρ, d)-quasiconvexity, generalized unified (C, α, ρ, d)-pseudoconvexity and generalized unified (C, α, ρ, d)-strictly pseudoconvex functions are presented. The sufficient optimality conditions for multiobjective nonsmooth semi-infinite programming are obtained involving these generalized convexity lastly.
基金supported by China National S&T Major Project 2013ZX03003002-003National Natural Science Foundation of China under Grant No. 61176027, No.61421001111 Project of China under Grant B14010
文摘In this paper, we focus on energy-efficient transceiver and relay beamforming design for multi-pair two-way relay system. The multi-antenna users and the multi-antenna relay are considered in this work. Different from the existing works, the proposed algorithm is energy-efficient which is more applicable to the future green network. It considers both the sum-MSE problem and the power consumption problem for the users under the relay power constraint. Based on the optimal condition decomposition(OCD) method, the energy-efficient precoders at the users can be designed separately with limited information exchanged. The proposed relay beamforming algorithm is based on the alternative direction method of multipliers(ADMM) which has simpler iterative solution and enjoys good convergence. Simulation results demonstrate the performance of the proposed algorithms in terms of power consumption and MSE performance.