In this paper,we consider a cone problem of matrix optimization induced by spectral norm(MOSN).By Schur complement,MOSN can be reformulated as a nonlinear semidefinite programming(NLSDP)problem.Then we discuss the con...In this paper,we consider a cone problem of matrix optimization induced by spectral norm(MOSN).By Schur complement,MOSN can be reformulated as a nonlinear semidefinite programming(NLSDP)problem.Then we discuss the constraint nondegeneracy conditions and strong second-order sufficient conditions of MOSN and its SDP reformulation,and obtain that the constraint nondegeneracy condition of MOSN is not always equivalent to that of NLSDP.However,the strong second-order sufficient conditions of these two problems are equivalent without any assumption.Finally,a sufficient condition is given to ensure the nonsingularity of the Clarke’s generalized Jacobian of the KKT system for MOSN.展开更多
We consider maps on positive definite cones of von Neumann algebras preserving unitarily invariant norms of the spectral geometric means. The main results concern Jordan *-isomorphisms between <em>C</em>*-...We consider maps on positive definite cones of von Neumann algebras preserving unitarily invariant norms of the spectral geometric means. The main results concern Jordan *-isomorphisms between <em>C</em>*-algebras, and show that they are characterized by the preservation of unitarily invariant norms of those operations.展开更多
To avoid drawbacks of classic discrete Fourier transform(DFT)method,modern spectral estimation theory was introduced into harmonics and inter-harmonics analysis in electric power system.Idea of the subspace-based root...To avoid drawbacks of classic discrete Fourier transform(DFT)method,modern spectral estimation theory was introduced into harmonics and inter-harmonics analysis in electric power system.Idea of the subspace-based root-min-norm algorithm was described,but it is susceptive to noises with unstable performance in different SNRs.So the modified root-min-norm algorithm based on cross-spectral estimation was proposed,utilizing cross-correlation matrix and independence of different Gaussian noise series.Lots of simulation experiments were carried out to test performance of the algorithm in different conditions,and its statistical characteristics was presented.Simulation results show that the modified algorithm can efficiently suppress influence of the noises,and has high frequency resolution,high precision and high stability,and it is much superior to the classic DFT method.展开更多
Let us define to be a r-Toeplitz matrix. The entries in the first row of are or;where F<sub>n</sub> and L<sub>n</sub> denote the usual Fibonacci and Lucas numbers, respe...Let us define to be a r-Toeplitz matrix. The entries in the first row of are or;where F<sub>n</sub> and L<sub>n</sub> denote the usual Fibonacci and Lucas numbers, respectively. We obtained some bounds for the spectral norm of these matrices.展开更多
Let us define A=Hr=(aij)?to be n×n?r-Hankel matrix. The entries of matrix A are Fn=Fi+j-2?or Ln=Fi+j-2?where Fn?and Ln?denote the usual Fibonacci and Lucas numbers, respectively. Then, we obtained upper and l...Let us define A=Hr=(aij)?to be n×n?r-Hankel matrix. The entries of matrix A are Fn=Fi+j-2?or Ln=Fi+j-2?where Fn?and Ln?denote the usual Fibonacci and Lucas numbers, respectively. Then, we obtained upper and lower bounds for the spectral norm of matrix A. We compared our bounds with exact value of matrix A’s spectral norm. These kinds of matrices have connections with signal and image processing, time series analysis and many other problems.展开更多
基金This research is mainly supported by the National Natural Science Foundation of China(Nos.91130007 and 91330206).
文摘In this paper,we consider a cone problem of matrix optimization induced by spectral norm(MOSN).By Schur complement,MOSN can be reformulated as a nonlinear semidefinite programming(NLSDP)problem.Then we discuss the constraint nondegeneracy conditions and strong second-order sufficient conditions of MOSN and its SDP reformulation,and obtain that the constraint nondegeneracy condition of MOSN is not always equivalent to that of NLSDP.However,the strong second-order sufficient conditions of these two problems are equivalent without any assumption.Finally,a sufficient condition is given to ensure the nonsingularity of the Clarke’s generalized Jacobian of the KKT system for MOSN.
文摘We consider maps on positive definite cones of von Neumann algebras preserving unitarily invariant norms of the spectral geometric means. The main results concern Jordan *-isomorphisms between <em>C</em>*-algebras, and show that they are characterized by the preservation of unitarily invariant norms of those operations.
基金Shandong University of Science and Technology Research Fund(No.2010KYTD101)
文摘To avoid drawbacks of classic discrete Fourier transform(DFT)method,modern spectral estimation theory was introduced into harmonics and inter-harmonics analysis in electric power system.Idea of the subspace-based root-min-norm algorithm was described,but it is susceptive to noises with unstable performance in different SNRs.So the modified root-min-norm algorithm based on cross-spectral estimation was proposed,utilizing cross-correlation matrix and independence of different Gaussian noise series.Lots of simulation experiments were carried out to test performance of the algorithm in different conditions,and its statistical characteristics was presented.Simulation results show that the modified algorithm can efficiently suppress influence of the noises,and has high frequency resolution,high precision and high stability,and it is much superior to the classic DFT method.
文摘Let us define to be a r-Toeplitz matrix. The entries in the first row of are or;where F<sub>n</sub> and L<sub>n</sub> denote the usual Fibonacci and Lucas numbers, respectively. We obtained some bounds for the spectral norm of these matrices.
文摘Let us define A=Hr=(aij)?to be n×n?r-Hankel matrix. The entries of matrix A are Fn=Fi+j-2?or Ln=Fi+j-2?where Fn?and Ln?denote the usual Fibonacci and Lucas numbers, respectively. Then, we obtained upper and lower bounds for the spectral norm of matrix A. We compared our bounds with exact value of matrix A’s spectral norm. These kinds of matrices have connections with signal and image processing, time series analysis and many other problems.
