The large-scale multi-objective optimization algorithm(LSMOA),based on the grouping of decision variables,is an advanced method for handling high-dimensional decision variables.However,in practical problems,the intera...The large-scale multi-objective optimization algorithm(LSMOA),based on the grouping of decision variables,is an advanced method for handling high-dimensional decision variables.However,in practical problems,the interaction among decision variables is intricate,leading to large group sizes and suboptimal optimization effects;hence a large-scale multi-objective optimization algorithm based on weighted overlapping grouping of decision variables(MOEAWOD)is proposed in this paper.Initially,the decision variables are perturbed and categorized into convergence and diversity variables;subsequently,the convergence variables are subdivided into groups based on the interactions among different decision variables.If the size of a group surpasses the set threshold,that group undergoes a process of weighting and overlapping grouping.Specifically,the interaction strength is evaluated based on the interaction frequency and number of objectives among various decision variables.The decision variable with the highest interaction in the group is identified and disregarded,and the remaining variables are then reclassified into subgroups.Finally,the decision variable with the strongest interaction is added to each subgroup.MOEAWOD minimizes the interactivity between different groups and maximizes the interactivity of decision variables within groups,which contributed to the optimized direction of convergence and diversity exploration with different groups.MOEAWOD was subjected to testing on 18 benchmark large-scale optimization problems,and the experimental results demonstrate the effectiveness of our methods.Compared with the other algorithms,our method is still at an advantage.展开更多
In this paper,we investigate the complete convergence and complete moment conver-gence for weighted sums of arrays of rowwise asymptotically negatively associated(ANA)random variables,without assuming identical distri...In this paper,we investigate the complete convergence and complete moment conver-gence for weighted sums of arrays of rowwise asymptotically negatively associated(ANA)random variables,without assuming identical distribution.The obtained results not only extend those of An and Yuan[1]and Shen et al.[2]to the case of ANA random variables,but also partially improve them.展开更多
The evolutionary strategy with a dynamic weighting schedule is proposed to find all the compromised solutions of the multi-objective integrated structure and control optimization problem, where the optimal system perf...The evolutionary strategy with a dynamic weighting schedule is proposed to find all the compromised solutions of the multi-objective integrated structure and control optimization problem, where the optimal system performance and control cost are defined by H2 or H∞ norms. During this optimization process, the weights are varying with the increasing generation instead of fixed values. The proposed strategy together with the linear matrix inequality (LMI) or the Riccati controller design method can find a series of uniformly distributed nondominated solutions in a single run. Therefore, this method can greatly reduce the computation intensity of the integrated optimization problem compared with the weight-based single objective genetic algorithm. Active automotive suspension is adopted as an example to illustrate the effectiveness of the proposed method.展开更多
Based on conventional particle swarm optimization(PSO),this paper presents an efficient and reliable heuristic approach using PSO with an adaptive random inertia weight(ARIW)strategy,referred to as the ARIW-PSO algori...Based on conventional particle swarm optimization(PSO),this paper presents an efficient and reliable heuristic approach using PSO with an adaptive random inertia weight(ARIW)strategy,referred to as the ARIW-PSO algorithm,to build a multi-objective optimization model for reservoir operation.Using the triangular probability density function,the inertia weight is randomly generated,and the probability density function is automatically adjusted to make the inertia weight generally greater in the initial stage of evolution,which is suitable for global searches.In the evolution process,the inertia weight gradually decreases,which is beneficial to local searches.The performance of the ARIWPSO algorithm was investigated with some classical test functions,and the results were compared with those of the genetic algorithm(GA),the conventional PSO,and other improved PSO methods.Then,the ARIW-PSO algorithm was applied to multi-objective optimal dispatch of the Panjiakou Reservoir and multi-objective flood control operation of a reservoir group on the Luanhe River in China,including the Panjiakou Reservoir,Daheiting Reservoir,and Taolinkou Reservoir.The validity of the multi-objective optimization model for multi-reservoir systems based on the ARIW-PSO algorithm was verified.展开更多
In this article, the author establishes the strong laws for linear statistics that are weighted sums of a m-negatively associated(m-NA) random sample. The obtained results extend and improve the result of Qiu and Yang...In this article, the author establishes the strong laws for linear statistics that are weighted sums of a m-negatively associated(m-NA) random sample. The obtained results extend and improve the result of Qiu and Yang in [1] to m-NA random variables.展开更多
In this paper the authors study the complete, weak and almost sure convergence for weighted sums of NOD random variables and obtain some new limit theorems for weighted sums of NOD random variables, which extend the c...In this paper the authors study the complete, weak and almost sure convergence for weighted sums of NOD random variables and obtain some new limit theorems for weighted sums of NOD random variables, which extend the corresponding theorems of Stout [1], Thrum [2] and Hu et al. [3].展开更多
In this paper, strong laws of large numbers for weighted sums of ■-mixing sequence are investigated. Our results extend the corresponding results for negatively associated sequence to the case of ■-mixing sequence.
In this paper, the complete convergence for the weighted sums of independent and identically distributed random variables in Stout [9] is improved and extended under NOD setup.The more optimal moment condition is give...In this paper, the complete convergence for the weighted sums of independent and identically distributed random variables in Stout [9] is improved and extended under NOD setup.The more optimal moment condition is given. The main results also hold for END sequence.展开更多
Let {(D n, FFFn),n/->1} be a sequence of martingale differences and {a ni, 1≤i≤n,n≥1} be an array of real constants. Almost sure convergence for the row sums ?i = 1n ani D1\sum\limits_{i = 1}^n {a_{ni} D_1 } are...Let {(D n, FFFn),n/->1} be a sequence of martingale differences and {a ni, 1≤i≤n,n≥1} be an array of real constants. Almost sure convergence for the row sums ?i = 1n ani D1\sum\limits_{i = 1}^n {a_{ni} D_1 } are discussed. We also discuss complete convergence for the moving average processes underB-valued martingale differences assumption.展开更多
By using Rosenthal type moment inequality for extended negatively de- pendent random variables, we establish the equivalent conditions of complete convergence for weighted sums of sequences of extended negatively depe...By using Rosenthal type moment inequality for extended negatively de- pendent random variables, we establish the equivalent conditions of complete convergence for weighted sums of sequences of extended negatively dependent random variables under more general conditions. These results complement and improve the corresponding results obtained by Li et al. (Li D L, RAO M B, Jiang T F, Wang X C. Complete convergence and almost sure convergence of weighted sums of random variables. J. Theoret. Probab., 1995, 8: 49-76) and Liang (Liang H Y. Complete convergence for weighted sums of negatively associated random variables. Statist. Probab. Lett., 2000, 48: 317-325).展开更多
For double arrays of constants {a ni, 1≤i≤k n, n≥1} and NA r.v. 's {X n, n≥1}, conditions for almost sure convergence of are given. Both casesk n ↑ ∞ andk n=∞ are treated. A Marcinkiewicz-type theorem for ...For double arrays of constants {a ni, 1≤i≤k n, n≥1} and NA r.v. 's {X n, n≥1}, conditions for almost sure convergence of are given. Both casesk n ↑ ∞ andk n=∞ are treated. A Marcinkiewicz-type theorem for i. d. NA sequences is obtained as a special case.展开更多
For weighted sums of asymptotically almost negatively associated (AANA) random variables sequences, we use the Rosenthal type moment inequalities and prove the Marcinkiewicz-Zygmund type complete convergence and obtai...For weighted sums of asymptotically almost negatively associated (AANA) random variables sequences, we use the Rosenthal type moment inequalities and prove the Marcinkiewicz-Zygmund type complete convergence and obtain the complete convergence rates. Our results extend some known ones.展开更多
Let {Xn, n≥1} be a martingale difference sequence and {a nk , 1?k?n,n?1} an array of constant real numbers. The limiting behavior of weighted partial sums ∑ k=1 n a nk X k is investigated and some new results are ob...Let {Xn, n≥1} be a martingale difference sequence and {a nk , 1?k?n,n?1} an array of constant real numbers. The limiting behavior of weighted partial sums ∑ k=1 n a nk X k is investigated and some new results are obtained.展开更多
We mainly study the almost sure limiting behavior of weighted sums of the form ∑ni=1 aiXi/bn , where {Xn, n ≥ 1} is an arbitrary Banach space valued random element sequence or Banach space valued martingale differen...We mainly study the almost sure limiting behavior of weighted sums of the form ∑ni=1 aiXi/bn , where {Xn, n ≥ 1} is an arbitrary Banach space valued random element sequence or Banach space valued martingale difference sequence and {an, n ≥ 1} and {bn,n ≥ 1} are two sequences of positive constants. Some new strong laws of large numbers for such weighted sums are proved under mild conditions.展开更多
In this paper, we discuss the complete convergence of weighted sums for arrays of rowwise m-negatively associated random variables. By applying moment inequality and truncation methods, the sufficient conditions of co...In this paper, we discuss the complete convergence of weighted sums for arrays of rowwise m-negatively associated random variables. By applying moment inequality and truncation methods, the sufficient conditions of complete convergence of weighted sums for arrays of rowwise m-negatively associated random variables are established. These results generalize and complement some known conclusions.展开更多
Let {Xn, n ≥ 1} be a sequence of independent and identically distributed positive valued random variables with a common distribution function F. When F belongs to the domain of partial attraction of a semi stable law...Let {Xn, n ≥ 1} be a sequence of independent and identically distributed positive valued random variables with a common distribution function F. When F belongs to the domain of partial attraction of a semi stable law with index α, 0 < α < 1, an asymptotic behavior of the large deviation probabilities with respect to properly normalized weighted sums have been studied and in support of this we obtained Chover’s form of law of iterated logarithm.展开更多
In this paper, we prove an almost sure central limit theorem for weighted sums of mixing sequences of random variables without stationary assumptions. We no longer restrict to logarithmic averages, but allow rather ar...In this paper, we prove an almost sure central limit theorem for weighted sums of mixing sequences of random variables without stationary assumptions. We no longer restrict to logarithmic averages, but allow rather arbitrary weight sequences. This extends the earlier work on mixing random variables展开更多
In this article, we study the complete convergence for weighted sums of widely orthant dependent random variables. By using the exponential probability inequality, we establish a complete convergence result for weight...In this article, we study the complete convergence for weighted sums of widely orthant dependent random variables. By using the exponential probability inequality, we establish a complete convergence result for weighted sums of widely orthant dependent random variables under mild conditions of weights and moments. The result obtained in the paper generalizes the corresponding ones for independent random variables and negatively dependent random variables.展开更多
In this paper, the complete convergence and strong law of large numbers for weighted sums of φ-mixing sequence with different distribution are investigated under some weaker moment conditions. Our results extend ones...In this paper, the complete convergence and strong law of large numbers for weighted sums of φ-mixing sequence with different distribution are investigated under some weaker moment conditions. Our results extend ones of independent sequence with identical distribution to the case of φ-mixing sequence with different distribution.展开更多
This paper deals with the Alienor method to tackle multiobjective nonlinear optimization problems. In this approach, the multiple criteria of the optimization problem are aggregated into a single one using weighted su...This paper deals with the Alienor method to tackle multiobjective nonlinear optimization problems. In this approach, the multiple criteria of the optimization problem are aggregated into a single one using weighted sums. Then, the resulting single objective nonlinear optimization problem is solved using the Alienor method associated with the Optimization Preserving Operators technique which has proved to be suitable for (nonlinear) optimization problems with a large number of variables (see [1]). The proposed approach is evaluated through test problems. The results show that the approach provides good approximations of the Pareto front while requiring small computational time, even for large instances.展开更多
基金supported in part by the Central Government Guides Local Science and TechnologyDevelopment Funds(Grant No.YDZJSX2021A038)in part by theNational Natural Science Foundation of China under(Grant No.61806138)in part by the China University Industry-University-Research Collaborative Innovation Fund(Future Network Innovation Research and Application Project)(Grant 2021FNA04014).
文摘The large-scale multi-objective optimization algorithm(LSMOA),based on the grouping of decision variables,is an advanced method for handling high-dimensional decision variables.However,in practical problems,the interaction among decision variables is intricate,leading to large group sizes and suboptimal optimization effects;hence a large-scale multi-objective optimization algorithm based on weighted overlapping grouping of decision variables(MOEAWOD)is proposed in this paper.Initially,the decision variables are perturbed and categorized into convergence and diversity variables;subsequently,the convergence variables are subdivided into groups based on the interactions among different decision variables.If the size of a group surpasses the set threshold,that group undergoes a process of weighting and overlapping grouping.Specifically,the interaction strength is evaluated based on the interaction frequency and number of objectives among various decision variables.The decision variable with the highest interaction in the group is identified and disregarded,and the remaining variables are then reclassified into subgroups.Finally,the decision variable with the strongest interaction is added to each subgroup.MOEAWOD minimizes the interactivity between different groups and maximizes the interactivity of decision variables within groups,which contributed to the optimized direction of convergence and diversity exploration with different groups.MOEAWOD was subjected to testing on 18 benchmark large-scale optimization problems,and the experimental results demonstrate the effectiveness of our methods.Compared with the other algorithms,our method is still at an advantage.
基金National Natural Science Foundation of China (Grant Nos.12061028, 71871046)Support Program of the Guangxi China Science Foundation (Grant No.2018GXNSFAA281011)。
文摘In this paper,we investigate the complete convergence and complete moment conver-gence for weighted sums of arrays of rowwise asymptotically negatively associated(ANA)random variables,without assuming identical distribution.The obtained results not only extend those of An and Yuan[1]and Shen et al.[2]to the case of ANA random variables,but also partially improve them.
文摘The evolutionary strategy with a dynamic weighting schedule is proposed to find all the compromised solutions of the multi-objective integrated structure and control optimization problem, where the optimal system performance and control cost are defined by H2 or H∞ norms. During this optimization process, the weights are varying with the increasing generation instead of fixed values. The proposed strategy together with the linear matrix inequality (LMI) or the Riccati controller design method can find a series of uniformly distributed nondominated solutions in a single run. Therefore, this method can greatly reduce the computation intensity of the integrated optimization problem compared with the weight-based single objective genetic algorithm. Active automotive suspension is adopted as an example to illustrate the effectiveness of the proposed method.
基金supported by the Foundation of the Scientific and Technological Innovation Team of Colleges and Universities in Henan Province(Grant No.181RTSTHN009)the Foundation of the Key Laboratory of Water Environment Simulation and Treatment in Henan Province(Grant No.2017016).
文摘Based on conventional particle swarm optimization(PSO),this paper presents an efficient and reliable heuristic approach using PSO with an adaptive random inertia weight(ARIW)strategy,referred to as the ARIW-PSO algorithm,to build a multi-objective optimization model for reservoir operation.Using the triangular probability density function,the inertia weight is randomly generated,and the probability density function is automatically adjusted to make the inertia weight generally greater in the initial stage of evolution,which is suitable for global searches.In the evolution process,the inertia weight gradually decreases,which is beneficial to local searches.The performance of the ARIWPSO algorithm was investigated with some classical test functions,and the results were compared with those of the genetic algorithm(GA),the conventional PSO,and other improved PSO methods.Then,the ARIW-PSO algorithm was applied to multi-objective optimal dispatch of the Panjiakou Reservoir and multi-objective flood control operation of a reservoir group on the Luanhe River in China,including the Panjiakou Reservoir,Daheiting Reservoir,and Taolinkou Reservoir.The validity of the multi-objective optimization model for multi-reservoir systems based on the ARIW-PSO algorithm was verified.
基金Foundation item: Supported by the Humanities and Social Sciences Foundation for the Youth Scholars of Ministry of Education of China(12YJCZH217) Supported by the Natural Science Foundation of Anhui Province(1308085MA03) Supported by the Key Natural Science Foundation of Educational Committe of Anhui Province(KJ2014A255)
文摘In this article, the author establishes the strong laws for linear statistics that are weighted sums of a m-negatively associated(m-NA) random sample. The obtained results extend and improve the result of Qiu and Yang in [1] to m-NA random variables.
文摘In this paper the authors study the complete, weak and almost sure convergence for weighted sums of NOD random variables and obtain some new limit theorems for weighted sums of NOD random variables, which extend the corresponding theorems of Stout [1], Thrum [2] and Hu et al. [3].
基金Foundation item: Supported by the National Natural Science Foundation of China(11171001, 11201001) Supported by the Natural Science Foundation of Anhui Province(t208085QA03, 1308085QA03)
文摘In this paper, strong laws of large numbers for weighted sums of ■-mixing sequence are investigated. Our results extend the corresponding results for negatively associated sequence to the case of ■-mixing sequence.
基金Supported by the National Natural Science Foundation of China(11271161)
文摘In this paper, the complete convergence for the weighted sums of independent and identically distributed random variables in Stout [9] is improved and extended under NOD setup.The more optimal moment condition is given. The main results also hold for END sequence.
文摘Let {(D n, FFFn),n/->1} be a sequence of martingale differences and {a ni, 1≤i≤n,n≥1} be an array of real constants. Almost sure convergence for the row sums ?i = 1n ani D1\sum\limits_{i = 1}^n {a_{ni} D_1 } are discussed. We also discuss complete convergence for the moving average processes underB-valued martingale differences assumption.
基金The NSF(11271020 and 11201004)of Chinathe NSF(10040606Q30 and 1208085MA11)of Anhui Provincethe NSF(KJ2012ZD01)of Education Department of Anhui Province
文摘By using Rosenthal type moment inequality for extended negatively de- pendent random variables, we establish the equivalent conditions of complete convergence for weighted sums of sequences of extended negatively dependent random variables under more general conditions. These results complement and improve the corresponding results obtained by Li et al. (Li D L, RAO M B, Jiang T F, Wang X C. Complete convergence and almost sure convergence of weighted sums of random variables. J. Theoret. Probab., 1995, 8: 49-76) and Liang (Liang H Y. Complete convergence for weighted sums of negatively associated random variables. Statist. Probab. Lett., 2000, 48: 317-325).
文摘For double arrays of constants {a ni, 1≤i≤k n, n≥1} and NA r.v. 's {X n, n≥1}, conditions for almost sure convergence of are given. Both casesk n ↑ ∞ andk n=∞ are treated. A Marcinkiewicz-type theorem for i. d. NA sequences is obtained as a special case.
文摘For weighted sums of asymptotically almost negatively associated (AANA) random variables sequences, we use the Rosenthal type moment inequalities and prove the Marcinkiewicz-Zygmund type complete convergence and obtain the complete convergence rates. Our results extend some known ones.
基金SupportedbytheNationalNaturalScienceFoundationofChina (No .10 0 710 5 8)and (No .10 0 710 19)
文摘Let {Xn, n≥1} be a martingale difference sequence and {a nk , 1?k?n,n?1} an array of constant real numbers. The limiting behavior of weighted partial sums ∑ k=1 n a nk X k is investigated and some new results are obtained.
基金Supported by the National Natural Science Foundationof China (10671149)
文摘We mainly study the almost sure limiting behavior of weighted sums of the form ∑ni=1 aiXi/bn , where {Xn, n ≥ 1} is an arbitrary Banach space valued random element sequence or Banach space valued martingale difference sequence and {an, n ≥ 1} and {bn,n ≥ 1} are two sequences of positive constants. Some new strong laws of large numbers for such weighted sums are proved under mild conditions.
基金The NSF(10901003) of Chinathe NSF(1208085MA11) of Anhui Provincethe NSF(KJ2012ZD01) of Education Department of Anhui Province
文摘In this paper, we discuss the complete convergence of weighted sums for arrays of rowwise m-negatively associated random variables. By applying moment inequality and truncation methods, the sufficient conditions of complete convergence of weighted sums for arrays of rowwise m-negatively associated random variables are established. These results generalize and complement some known conclusions.
文摘Let {Xn, n ≥ 1} be a sequence of independent and identically distributed positive valued random variables with a common distribution function F. When F belongs to the domain of partial attraction of a semi stable law with index α, 0 < α < 1, an asymptotic behavior of the large deviation probabilities with respect to properly normalized weighted sums have been studied and in support of this we obtained Chover’s form of law of iterated logarithm.
文摘In this paper, we prove an almost sure central limit theorem for weighted sums of mixing sequences of random variables without stationary assumptions. We no longer restrict to logarithmic averages, but allow rather arbitrary weight sequences. This extends the earlier work on mixing random variables
基金Supported by the Natural Science Foundation of Anhui Province(1308085QA03)Supported by the Quality Improvement Projects for Undergraduate Education of Anhui University(ZLTS2015035)+1 种基金Supported by the Research Teaching Model Curriculum of Anhui University(xjyjkc1407)Supported by the Students Innovative Training Project of Anhui University(201410357118)
文摘In this article, we study the complete convergence for weighted sums of widely orthant dependent random variables. By using the exponential probability inequality, we establish a complete convergence result for weighted sums of widely orthant dependent random variables under mild conditions of weights and moments. The result obtained in the paper generalizes the corresponding ones for independent random variables and negatively dependent random variables.
基金Supported by the National Natural Science Foundation of China(11671012, 11526033, 11501004, 11501005) Supported by the Natural Science Foundation of Anhui Province(1608085QA02) Supported by the Science Fund for Distinguished Young Scholars of Anhui Province(1508085J06)
文摘In this paper, the complete convergence and strong law of large numbers for weighted sums of φ-mixing sequence with different distribution are investigated under some weaker moment conditions. Our results extend ones of independent sequence with identical distribution to the case of φ-mixing sequence with different distribution.
文摘This paper deals with the Alienor method to tackle multiobjective nonlinear optimization problems. In this approach, the multiple criteria of the optimization problem are aggregated into a single one using weighted sums. Then, the resulting single objective nonlinear optimization problem is solved using the Alienor method associated with the Optimization Preserving Operators technique which has proved to be suitable for (nonlinear) optimization problems with a large number of variables (see [1]). The proposed approach is evaluated through test problems. The results show that the approach provides good approximations of the Pareto front while requiring small computational time, even for large instances.