Interference alignment(IA) is one of the promising measures for the multi-user network to manage interference. The rank constraints rank minimization means that interference spans the lowest dimensional subspace and t...Interference alignment(IA) is one of the promising measures for the multi-user network to manage interference. The rank constraints rank minimization means that interference spans the lowest dimensional subspace and the useful signal spans all available spatial dimensions. In order to improve the performance of two-way relay network, we can use rank constrained rank minimization(RCRM) to solve the IA problem. This paper proposes left reweighted nuclear norm minimization-γalgorithm and selective coupling reweighted nuclear norm minimization algorithm to implement interference alignment in two-way relay networks. The left reweighted nuclear norm minimization-γ algorithm is based on reweighted nuclear norm minimization algorithm and has a novel γ choosing rule. The selective coupling reweighted nuclear norm minimization algorithm weighting methods choose according to singular value of interference matrixes. Simulation results show that the proposed algorithms considerably improve the sum rate performance and achieve the higher average achievable multiplexing gain in two-way relay interference networks.展开更多
Linear programming is a method for solving linear optimization problems with constraints, widely met in real-world applications. In the vast majority of these applications, the number of constraints is significantly l...Linear programming is a method for solving linear optimization problems with constraints, widely met in real-world applications. In the vast majority of these applications, the number of constraints is significantly larger than the number of variables. Since the crucial subject of these problems is to detect the constraints that will be verified as equality in an optimal solution, there are methods for investigating such constraints to accelerate the whole process. In this paper, a technique named proximity technique is addressed, which under a proposed theoretical framework gives an ascending order to the constraints in such a way that those with low ranking are characterized of high priority to be binding. Under this framework, two new Linear programming optimization algorithms are introduced, based on a proposed Utility matrix and a utility vector accordingly. For testing the addressed algorithms firstly a generator of 10,000 random linear programming problems of dimension n with m constraints, where , is introduced in order to simulate as many as possible real-world problems, and secondly, real-life linear programming examples from the NETLIB repository are tested. A discussion of the numerical results is given. Furthermore, already known methods for solving linear programming problems are suggested to be fitted under the proposed framework.展开更多
This paper introduces an optimization method(SCE-SR)that combines shuffled complex evolution(SCE)and stochastic ranking(SR)to solve constrained reservoir scheduling problems,ranking individuals with both objectives an...This paper introduces an optimization method(SCE-SR)that combines shuffled complex evolution(SCE)and stochastic ranking(SR)to solve constrained reservoir scheduling problems,ranking individuals with both objectives and constrains considered.A specialized strategy is used in the evolution process to ensure that the optimal results are feasible individuals.This method is suitable for handling multiple conflicting constraints,and is easy to implement,requiring little parameter tuning.The search properties of the method are ensured through the combination of deterministic and probabilistic approaches.The proposed SCE-SR was tested against hydropower scheduling problems of a single reservoir and a multi-reservoir system,and its performance is compared with that of two classical methods(the dynamic programming and genetic algorithm).The results show that the SCE-SR method is an effective and efficient method for optimizing hydropower generation and locating feasible regions quickly,with sufficient global convergence properties and robustness.The operation schedules obtained satisfy the basic scheduling requirements of reservoirs.展开更多
For an arbitrary tensor(multi-index array) with linear constraints at each direction,it is proved that the factors of any minimal canonical tensor approximation to this tensor satisfy the same linear constraints for t...For an arbitrary tensor(multi-index array) with linear constraints at each direction,it is proved that the factors of any minimal canonical tensor approximation to this tensor satisfy the same linear constraints for the corresponding directions.展开更多
高光谱图像(HSI)具有良好的光谱识别能力,但在采集过程中易受到混合噪声的污染,严重影响了后续任务的精度,因此HSI去噪是重要的预处理过程。针对现有去噪方法对空间-光谱先验信息利用不足、条纹噪声建模不合理的问题,提出一种新的基于...高光谱图像(HSI)具有良好的光谱识别能力,但在采集过程中易受到混合噪声的污染,严重影响了后续任务的精度,因此HSI去噪是重要的预处理过程。针对现有去噪方法对空间-光谱先验信息利用不足、条纹噪声建模不合理的问题,提出一种新的基于群稀疏正则化的高光谱图像去噪算法。该算法将干净HSI的空间-光谱低秩特性和各波段上条纹噪声的低秩结构融入一个新框架,实现了干净HSI与高强度结构化条纹噪声的分离;同时为了有效保持图像的边缘信息,在去噪模型中引入新的群稀疏正则化,即基于L_(2,1)范数的增强型三维全变分正则化(enhanced 3D total variation, E3DTV),充分挖掘HSI差分图像的稀疏先验信息,进一步提升了图像的分段平滑性。采用交替方向乘子法对变量优化求解,在仿真和真实数据集上进行数值实验表明,所提模型具有更好的去噪和去条纹性能,在视觉效果和定量评价结果上都明显优于其他对比算法。展开更多
基金supported by the National Science Foundation of China (NO.61271240, 61671253)
文摘Interference alignment(IA) is one of the promising measures for the multi-user network to manage interference. The rank constraints rank minimization means that interference spans the lowest dimensional subspace and the useful signal spans all available spatial dimensions. In order to improve the performance of two-way relay network, we can use rank constrained rank minimization(RCRM) to solve the IA problem. This paper proposes left reweighted nuclear norm minimization-γalgorithm and selective coupling reweighted nuclear norm minimization algorithm to implement interference alignment in two-way relay networks. The left reweighted nuclear norm minimization-γ algorithm is based on reweighted nuclear norm minimization algorithm and has a novel γ choosing rule. The selective coupling reweighted nuclear norm minimization algorithm weighting methods choose according to singular value of interference matrixes. Simulation results show that the proposed algorithms considerably improve the sum rate performance and achieve the higher average achievable multiplexing gain in two-way relay interference networks.
文摘Linear programming is a method for solving linear optimization problems with constraints, widely met in real-world applications. In the vast majority of these applications, the number of constraints is significantly larger than the number of variables. Since the crucial subject of these problems is to detect the constraints that will be verified as equality in an optimal solution, there are methods for investigating such constraints to accelerate the whole process. In this paper, a technique named proximity technique is addressed, which under a proposed theoretical framework gives an ascending order to the constraints in such a way that those with low ranking are characterized of high priority to be binding. Under this framework, two new Linear programming optimization algorithms are introduced, based on a proposed Utility matrix and a utility vector accordingly. For testing the addressed algorithms firstly a generator of 10,000 random linear programming problems of dimension n with m constraints, where , is introduced in order to simulate as many as possible real-world problems, and secondly, real-life linear programming examples from the NETLIB repository are tested. A discussion of the numerical results is given. Furthermore, already known methods for solving linear programming problems are suggested to be fitted under the proposed framework.
基金supported by the National Key Research and Development Program of China(Grant No.2016YFC0401702)the Fundamental Research Funds for the Central Universities(Grant No.2018B11214)the National Natural Science Foundation of China(Grants No.51379059 and 51579002)
文摘This paper introduces an optimization method(SCE-SR)that combines shuffled complex evolution(SCE)and stochastic ranking(SR)to solve constrained reservoir scheduling problems,ranking individuals with both objectives and constrains considered.A specialized strategy is used in the evolution process to ensure that the optimal results are feasible individuals.This method is suitable for handling multiple conflicting constraints,and is easy to implement,requiring little parameter tuning.The search properties of the method are ensured through the combination of deterministic and probabilistic approaches.The proposed SCE-SR was tested against hydropower scheduling problems of a single reservoir and a multi-reservoir system,and its performance is compared with that of two classical methods(the dynamic programming and genetic algorithm).The results show that the SCE-SR method is an effective and efficient method for optimizing hydropower generation and locating feasible regions quickly,with sufficient global convergence properties and robustness.The operation schedules obtained satisfy the basic scheduling requirements of reservoirs.
基金supported by the Russian Fund for Basic Research (RFBR grant 08-01-00115,RFBR/DFG grant 09-01-91332,RFBR grant 09-01-12058)Priority Research Programme of Department of Mathematical Sciences of Russian Academy of Sciences
文摘For an arbitrary tensor(multi-index array) with linear constraints at each direction,it is proved that the factors of any minimal canonical tensor approximation to this tensor satisfy the same linear constraints for the corresponding directions.
文摘高光谱图像(HSI)具有良好的光谱识别能力,但在采集过程中易受到混合噪声的污染,严重影响了后续任务的精度,因此HSI去噪是重要的预处理过程。针对现有去噪方法对空间-光谱先验信息利用不足、条纹噪声建模不合理的问题,提出一种新的基于群稀疏正则化的高光谱图像去噪算法。该算法将干净HSI的空间-光谱低秩特性和各波段上条纹噪声的低秩结构融入一个新框架,实现了干净HSI与高强度结构化条纹噪声的分离;同时为了有效保持图像的边缘信息,在去噪模型中引入新的群稀疏正则化,即基于L_(2,1)范数的增强型三维全变分正则化(enhanced 3D total variation, E3DTV),充分挖掘HSI差分图像的稀疏先验信息,进一步提升了图像的分段平滑性。采用交替方向乘子法对变量优化求解,在仿真和真实数据集上进行数值实验表明,所提模型具有更好的去噪和去条纹性能,在视觉效果和定量评价结果上都明显优于其他对比算法。