Positive definite constrained least-squares estimation of matrices

作者: H. Hu

DOI: 10.1016/0024-3795(94)00024-8

关键词:

摘要: Abstract This paper presents a method for positive definite constrained least-squares estimation of matrices. The approach is to transform the problem into an equivalent convex quadratic program with infinitely many linear constraints and solve latter by generating solving sequence ordinary programs.

参考文章(8)
J. Geromel, On the determination of a diagonal solution of the Lyapunov equation IEEE Transactions on Automatic Control. ,vol. 30, pp. 404- 406 ,(1985) , 10.1109/TAC.1985.1103953
R. Fletcher, Semi-Definite Matrix Constraints in Optimization Siam Journal on Control and Optimization. ,vol. 23, pp. 493- 513 ,(1985) , 10.1137/0323032
Roger Fletcher, A Nonlinear Programming Problem in Statistics (Educational Testing) SIAM Journal on Scientific and Statistical Computing. ,vol. 2, pp. 257- 267 ,(1981) , 10.1137/0902021
David W. Peterson, Willard I. Zangwill, Nonlinear programming : a unified approach Econometrica. ,vol. 40, pp. 411- ,(1972) , 10.2307/1909424
J. C. Allwright, Positive Semidefinite Matrices: Characterization via Conical Hulls and Least-Squares Solution of a Matrix Equation SIAM Journal on Control and Optimization. ,vol. 26, pp. 537- 556 ,(1988) , 10.1137/0326032
H. Hu, I. Olkin, A numerical procedure for finding the positive definite matrix closest to a patterned matrix Statistics & Probability Letters. ,vol. 12, pp. 511- 515 ,(1991) , 10.1016/0167-7152(91)90006-D
D. Q. Mayne, M. Sahba, An efficient algorithm for solving inequalities Journal of Optimization Theory and Applications. ,vol. 45, pp. 407- 423 ,(1985) , 10.1007/BF00938444