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 ✦
Dykstra’s algorithm for constrained least-squares doubly symmetric matrix problems
✍ Scribed by Jiao-fen Li; Xi-yan Hu; Lei Zhang
- Book ID
- 108281634
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 432 KB
- Volume
- 411
- Category
- Article
- ISSN
- 0304-3975
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 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
Adaptive Algorithm for Constrained Least
✍
Z.F. Li; M.R. Osborne; T. Prvan
📂
Article
📅
2002
🏛
Springer
🌐
English
⚖ 221 KB
A New Algorithm for Constrained Matrix L
✍
Wei-Yong Yan; John B. Moore
📂
Article
📅
2000
🏛
Springer US
🌐
English
⚖ 93 KB
A primal-dual interior-point algorithm f
✍
M. Fernanda; P. Costa; Edite M. G. P. Fernandes
📂
Article
📅
2005
🏛
Springer-Verlag
🌐
English
⚖ 911 KB
Error analysis of null space algorithm f
✍
E. Galligani; A. Laratta
📂
Article
📅
1994
🏛
Springer Vienna
🌐
English
⚖ 433 KB