{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T06:26:55Z","timestamp":1723357615803},"reference-count":26,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T00:00:00Z","timestamp":1051747200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Signal Processing"],"published-print":{"date-parts":[[2003,5]]},"DOI":"10.1016\/s0165-1684(03)00002-1","type":"journal-article","created":{"date-parts":[[2003,3,26]],"date-time":"2003-03-26T00:21:05Z","timestamp":1048638065000},"page":"1135-1140","source":"Crossref","is-referenced-by-count":18,"title":["Computation of symmetric positive definite Toeplitz matrices by the hybrid steepest descent method"],"prefix":"10.1016","volume":"83","author":[{"given":"Konstantinos","family":"Slavakis","sequence":"first","affiliation":[]},{"given":"Isao","family":"Yamada","sequence":"additional","affiliation":[]},{"given":"Kohichi","family":"Sakaniwa","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0165-1684(03)00002-1_BIB1","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1137\/S0036144593251710","article-title":"On projection algorithms for solving convex feasibility problems","volume":"38","author":"Bauschke","year":"1996","journal-title":"SIAM Rev."},{"key":"10.1016\/S0165-1684(03)00002-1_BIB2","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/978-1-4613-9940-7_3","article-title":"A method for finding projections onto the intersection of convex sets in Hilbert space","volume":"37","author":"Boyle","year":"1986","journal-title":"Lecture Notes in Statist."},{"key":"10.1016\/S0165-1684(03)00002-1_BIB3","first-page":"688","article-title":"The method of successive projections for finding a common point of convex sets","volume":"6","author":"Bregman","year":"1965","journal-title":"Soviet Math. Dokl."},{"issue":"3","key":"10.1016\/S0165-1684(03)00002-1_BIB4","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1090\/S0002-9939-1959-0105008-8","article-title":"Proximity maps for convex sets","volume":"10","author":"Cheney","year":"1959","journal-title":"Proc. Amer. Math. Soc."},{"issue":"2","key":"10.1016\/S0165-1684(03)00002-1_BIB5","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/5.214546","article-title":"The foundations of set theoretic estimation","volume":"81","author":"Combettes","year":"1993","journal-title":"Proc. IEEE"},{"issue":"11","key":"10.1016\/S0165-1684(03)00002-1_BIB6","doi-asserted-by":"crossref","first-page":"2955","DOI":"10.1109\/78.330356","article-title":"Inconsistent signal feasibility problems","volume":"42","author":"Combettes","year":"1994","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"10.1016\/S0165-1684(03)00002-1_BIB7","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1137\/S036301299732626X","article-title":"Strong convergence of block-iterative outer approximation methods for convex optimization","volume":"38","author":"Combettes","year":"2000","journal-title":"SIAM J. Control Optim."},{"issue":"9","key":"10.1016\/S0165-1684(03)00002-1_BIB8","doi-asserted-by":"crossref","first-page":"2460","DOI":"10.1109\/78.782189","article-title":"Hard-constrained inconsistent signal feasibility problems","volume":"47","author":"Combettes","year":"1999","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/S0165-1684(03)00002-1_BIB9","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1080\/01630569808816813","article-title":"Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings","volume":"19","author":"Deutsch","year":"1998","journal-title":"Numer. Funct. Anal. Optim."},{"key":"10.1016\/S0165-1684(03)00002-1_BIB10","series-title":"Convex Analysis and Variational Problems","author":"Ekeland","year":"1976"},{"key":"10.1016\/S0165-1684(03)00002-1_BIB11","series-title":"Matrix Computations","author":"Golub","year":"1996"},{"issue":"7","key":"10.1016\/S0165-1684(03)00002-1_BIB12","doi-asserted-by":"crossref","first-page":"1873","DOI":"10.1109\/78.298303","article-title":"Application of alternating convex projection methods for computation of positive Toeplitz matrices","volume":"42","author":"Grigoriadis","year":"1994","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"10.1016\/S0165-1684(03)00002-1_BIB13","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/BF02192178","article-title":"Alternating convex projection methods for discrete-time covariance control design","volume":"88","author":"Grigoriadis","year":"1996","journal-title":"J. Optim. Appl."},{"key":"10.1016\/S0165-1684(03)00002-1_BIB14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0041-5553(67)90113-9","article-title":"The method of projections for finding the common point of convex sets","volume":"7","author":"Gubin","year":"1967","journal-title":"USSR Comput. Math. Phys."},{"key":"10.1016\/S0165-1684(03)00002-1_BIB15","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0024-3795(88)90223-6","article-title":"Computing a nearest symmetric positive semidefinite matrix","volume":"103","author":"Higham","year":"1988","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/S0165-1684(03)00002-1_BIB16","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01582891","article-title":"On the convergence of Han's method for convex programming with quadratic objective","volume":"52","author":"Iusem","year":"1991","journal-title":"Math. Programming"},{"key":"10.1016\/S0165-1684(03)00002-1_BIB17","first-page":"1357","article-title":"Approximation de points fixes de contractions","volume":"284","author":"Lions","year":"1977","journal-title":"C.R. Acad. Sci. Paris S\u00e8rie A\u2013B"},{"issue":"1&2","key":"10.1016\/S0165-1684(03)00002-1_BIB18","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1081\/NFA-120003674","article-title":"Non-strictly convex minimization over the fixed point set of an asymptotically shrinking nonexpansive mapping","volume":"23","author":"Ogura","year":"2002","journal-title":"Numer. Funct. Anal. Optim."},{"key":"10.1016\/S0165-1684(03)00002-1_BIB19","series-title":"Digital Processing of Random Signals: Theory and Methods","author":"Porat","year":"1993"},{"key":"10.1016\/S0165-1684(03)00002-1_BIB20","doi-asserted-by":"crossref","unstructured":"K. Slavakis, I. Yamada, K. Sakaniwa, Spectrum estimation of real vector wide sense stationary processes by the Hybrid Steepest Descent Method, in: Proceedings of the ICASSP, Orlando, 2002.","DOI":"10.1109\/ICASSP.2002.1006003"},{"key":"10.1016\/S0165-1684(03)00002-1_BIB21","series-title":"Vector Space Projections: A Numerical Approach to Signal and Image Processing, Neural Nets, and Optics","author":"Stark","year":"1998"},{"key":"10.1016\/S0165-1684(03)00002-1_BIB22","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1007\/BF01190119","article-title":"Approximation of fixed points of nonexpansive mappings","volume":"58","author":"Wittmann","year":"1992","journal-title":"Arch. Math."},{"key":"10.1016\/S0165-1684(03)00002-1_BIB23","series-title":"Inherently Parallel Alg. in Feasibility and Optimization and Their Application","first-page":"473","article-title":"The hybrid steepest descent method for the variational inequality problem over the intersection of fixed point sets of non-expansive mappings","author":"Yamada","year":"2001"},{"key":"10.1016\/S0165-1684(03)00002-1_BIB24","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1080\/01630569808816822","article-title":"Quadratic optimization of fixed points of nonexpansive mappings in Hilbert space","volume":"19","author":"Yamada","year":"1998","journal-title":"Numer. Funct. Anal. Optim."},{"key":"10.1016\/S0165-1684(03)00002-1_BIB25","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1090\/conm\/313\/05379","article-title":"A numerically robust hybrid steepest descent method for the convexly constrained generalized inverse problems","volume":"313","author":"Yamada","year":"2002","journal-title":"Contemp. Math."},{"key":"10.1016\/S0165-1684(03)00002-1_BIB26","series-title":"Nonlinear Functional Analysis and Its Applications I: Fixed Point Theorems","author":"Zeidler","year":"1986"}],"container-title":["Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0165168403000021?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0165168403000021?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T07:21:06Z","timestamp":1583997666000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0165168403000021"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,5]]},"references-count":26,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2003,5]]}},"alternative-id":["S0165168403000021"],"URL":"https:\/\/doi.org\/10.1016\/s0165-1684(03)00002-1","relation":{},"ISSN":["0165-1684"],"issn-type":[{"value":"0165-1684","type":"print"}],"subject":[],"published":{"date-parts":[[2003,5]]}}}