ln a recent paper, the authors applied Dykstra's alternating projection algorithm to solve constrained least-squares n x n matrix problems. We extend these results in two different directions. First, we make use of the singular value decomposition to solve now constrained leastsquares rectangular m
β¦ LIBER β¦
Adaptive Algorithm for Constrained Least-Squares Problems
β Scribed by Z.F. Li; M.R. Osborne; T. Prvan
- Book ID
- 110344542
- Publisher
- Springer
- Year
- 2002
- Tongue
- English
- Weight
- 221 KB
- Volume
- 114
- Category
- Article
- ISSN
- 0022-3239
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Dykstra's algorithm for constrained leas
β
R. Escalante; M. Raydan
π
Article
π
1998
π
Elsevier Science
π
English
β 404 KB
Dykstraβs algorithm for constrained leas
β
Jiao-fen Li; Xi-yan Hu; Lei Zhang
π
Article
π
2010
π
Elsevier Science
π
English
β 432 KB
Analysis of a linearly constrained least
β
Franklin T. Luk; Sanzheng Qiao
π
Article
π
1993
π
Elsevier Science
π
English
β 455 KB
Dykstra's Algorithm for a Constrained Le
β
RenΓ© Escalante; Marcos Raydan
π
Article
π
1996
π
John Wiley and Sons
π
English
β 577 KB
We apply Dykstra's alternating projection algorithm to the constrained least-squares matrix problem that arises naturally in statistics and mathematical economics. In particular, we are concerned with the problem of finding the closest symmetric positive definite bounded and patterned matrix, in the
Noise-constrained least mean squares alg
β
Yongbin Wei; Gelfand, S.B.; Krogmeier, J.V.
π
Article
π
2001
π
IEEE
π
English
β 262 KB
A primal-dual interior-point algorithm f
β
M. Fernanda; P. Costa; Edite M. G. P. Fernandes
π
Article
π
2005
π
Springer-Verlag
π
English
β 911 KB