科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this paper, we consider the following minimization problem:where , , , and are given. An efficient inequality relaxation technique is presented to relax the matrix inequality constraint so that there is an optimal solution which is (R,S)-symmetric that minimize , and also satisfies the corrected matrix inequality constraint. A hybrid algorithm with convergence analysis is given to solve this problem. Numerical examples show that the algorithm requires less CPU times when compared with some other methods.
