SCOPUS 정보 검색 플랫폼

Numerical Linear Algebra with Applications

Volumn 5, Issue 6, 1998, Pages 475-482

The Nearest 'Doubly Stochastic' Matrix to a Real Matrix with the same First Moment

(3) Glunt, William a Hayden, Thomas L b Reams, Robert b

a AUSTIN PEAY STATE UNIVERSITY (United States)

b UNIVERSITY OF KENTUCKY (United States)

Author keywords

Alternating projections; First moment; Nearest doubly stochastic matrix; Normal cone; RC1

Indexed keywords

EID: 0032237879 PISSN: 10705325 EISSN: None Source Type: Journal
DOI: 10.1002/(SICI)1099-1506(199811/12)5:6<475::AID-NLA155>3.0.CO;2-5 Document Type: Article

Times cited : (13)

References (10)

1
- 0030246542
- On projection algorithms for solving convex feasibility problems
- H. Bauschke and J. Borwein. On projection algorithms for solving convex feasibility problems. SIAM Review, 38(3), 367-426, 1996.
- (1996) SIAM Review , vol.38 , Issue.3 , pp. 367-426
- Bauschke, H.¹ Borwein, J.²

2
- 0004020084
- Oxford University Press, New York
- S. K. Berberian, Introduction to Hilbert Space, Oxford University Press, New York, 1961.
- (1961) Introduction to Hilbert Space
- Berberian, S.K.¹

3
- 0002436271
- A method for finding projections onto the intersections of convex sets in Hilbert spaces
- Advances in Order Restricted Statistical Inference, Eds: R. Dykstra, T. Robertson and F. T. Wright, Vol 37 Springer-Verlag, Berlin, New York
- J. Boyle and R. Dykstra. A method for finding projections onto the intersections of convex sets in Hilbert spaces. In Advances in Order Restricted Statistical Inference, Eds: R. Dykstra, T. Robertson and F. T. Wright, Vol 37 of Lecture Notes in Statistics, 37, 28-47, Springer-Verlag, Berlin, New York, 1985.
- (1985) Lecture Notes in Statistics , vol.37 , pp. 28-47
- Boyle, J.¹ Dykstra, R.²

4
- 84968503398
- Proximity maps for convex sets
- W. Cheney and A. Goldstein. Proximity maps for convex sets. Proc. Amer. Math. Soc., 10, 448-450, 1959.
- (1959) Proc. Amer. Math. Soc. , vol.10 , pp. 448-450
- Cheney, W.¹ Goldstein, A.²

5
- 0029308198
- Efficient linear circuit analysis by Padé approximation via the Lanczos Process
- P. Feldmann and R. W. Freund. Efficient linear circuit analysis by Padé approximation via the Lanczos Process. IEEE Trans. Comp. Aided Design, 14(5), 639-649, 1995.
- (1995) IEEE Trans. Comp. Aided Design , vol.14 , Issue.5 , pp. 639-649
- Feldmann, P.¹ Freund, R.W.²

6
- 0001886656
- A cyclic projection algorithm via duality
- N. Gaffke and R. Mathar. A cyclic projection algorithm via duality. Metrika, 36, 29-54, 1989.
- (1989) Metrika , vol.36 , pp. 29-54
- Gaffke, N.¹ Mathar, R.²

7
- 0000771519
- An Alternating projection algorithm for computing the nearest Euclidean distance matrix
- W. Glunt, T. L. Hayden, S. Hong and J. Wells. An Alternating projection algorithm for computing the nearest Euclidean distance matrix. SIAM J. Matrix Anal. Appl., 11(4), 589-600, 1990.
- (1990) SIAM J. Matrix Anal. Appl. , vol.11 , Issue.4 , pp. 589-600
- Glunt, W.¹ Hayden, T.L.² Hong, S.³ Wells, J.⁴

8
- 0000379660
- Computing a nearest symmetric positive semidefinite matrix
- N. J. Higham. Computing a nearest symmetric positive semidefinite matrix. Lin. Alg. Appl., 103, 103-118, 1988.
- (1988) Lin. Alg. Appl. , vol.103 , pp. 103-118
- Higham, N.J.¹

9
- 0003488911
- Addison-Wesley, Reading, Massachusetts
- D. G. Luenberger. Linear and Nonlinear Programming, Addison-Wesley, Reading, Massachusetts, 1984.
- (1984) Linear and Nonlinear Programming
- Luenberger, D.G.¹

10
- 0004267646
- Princeton University Press, New Jersey
- R. T. Rockafellar. Convex Analysis, Princeton University Press, New Jersey, 1970.
- (1970) Convex Analysis
- Rockafellar, R.T.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.