{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:56:45Z","timestamp":1725490605311},"publisher-location":"Dordrecht","reference-count":40,"publisher":"Springer Netherlands","isbn-type":[{"type":"print","value":"9781402064784"},{"type":"electronic","value":"9781402064791"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-1-4020-6479-1_7","type":"book-chapter","created":{"date-parts":[[2007,9,6]],"date-time":"2007-09-06T03:45:12Z","timestamp":1189050312000},"page":"193-214","source":"Crossref","is-referenced-by-count":0,"title":["Relative Newton and Smoothing Multiplier Optimization Methods for Blind Source Separation"],"prefix":"10.1007","author":[{"given":"Michael","family":"Zibulevsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"7","key":"7_CR1_Ref","doi-asserted-by":"publisher","first-page":"1712","DOI":"10.1109\/78.599941","volume":"45","author":"D Pham","year":"1997","unstructured":"D. Pham and P. Garat, \u201cBlind separation of a mixture of independent sources through a quasi-maximum likelihood approach,\u201d IEEE Transactions on Signal Processing, vol. 45, no. 7, pp. 1712-1725, 1997.","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"6","key":"7_CR2_Ref","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1162\/neco.1995.7.6.1129","volume":"7","author":"AJ Bell","year":"1995","unstructured":"A. J. Bell and T. J. Sejnowski, \u201cAn information-maximization approach to blind separation and blind deconvolution,\u201d Neural Computation, vol. 7, no. 6, pp. 1129-1159, 1995.","journal-title":"Neural Computation"},{"key":"7_CR3_Ref","unstructured":"J.-F. Cardoso, \u201cOn the performance of orthogonal source separation algo-rithms,\u201d in EUSIPCO, Edinburgh, Sept. 1994, pp. 776-779."},{"key":"7_CR4_Ref","doi-asserted-by":"crossref","unstructured":".\u2014\u2014, \u201cBlind signal separation: statistical principles,\u201d Proceedings of the IEEE, vol.9, no.10, pp.2009-2025, Oct.1998.[Online]. Available: ftp:\/\/sig.enst.fr\/pub\/jfc\/Papers\/ProcIEEE.us.ps.gz","DOI":"10.1109\/5.720250"},{"issue":"1","key":"7_CR5_Ref","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/S1064827596304010","volume":"20","author":"SS Chen","year":"1998","unstructured":"S. S. Chen, D. L. Donoho, and M. A. Saunders, \u201cAtomic decomposition by basis pursuit,\u201d SIAM J. Sci. Comput., vol. 20, no. 1, pp. 33-61, 1998.","journal-title":"SIAM J. Sci. Comput."},{"key":"7_CR6_Ref","doi-asserted-by":"publisher","first-page":"3311","DOI":"10.1016\/S0042-6989(97)00169-7","volume":"37","author":"BA Olshausen","year":"1997","unstructured":"B. A. Olshausen and D. J. Field, \u201cSparse coding with an overcomplete basis set: A strategy employed by v1?\u201d Vision Research, vol. 37, pp. 3311-3325, 1997.","journal-title":"Vision Research"},{"issue":"7","key":"7_CR7_Ref","doi-asserted-by":"publisher","first-page":"1587","DOI":"10.1364\/JOSAA.16.001587","volume":"16","author":"MS Lewicki","year":"1999","unstructured":"M. S. Lewicki and B. A. Olshausen, \u201cA probabilistic framework for the adapta-tion and comparison of image codes,\u201d Journal of the Optical Society of America, vol. 16, no. 7, pp. 1587-1601, 1999.","journal-title":"Journal of the Optical Society of America"},{"issue":"4","key":"7_CR8_Ref","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1162\/089976601300014385","volume":"13","author":"M Zibulevsky","year":"2001","unstructured":"M. Zibulevsky and B. A. Pearlmutter, \u201cBlind source separation by sparse decomposition in a signal dictionary,\u201d Neural Computations, vol. 13, no. 4, pp. 863-882, 2001.","journal-title":"Neural Computations"},{"key":"7_CR9_Ref","doi-asserted-by":"crossref","unstructured":"M. Zibulevsky, B. A. Pearlmutter, P. Bofill, and P. Kisilev, \u201cBlind source separation by sparse decomposition,\u201d in Independent Components Analysis: Princeiples and Practice, S. J. Roberts and R. M. Everson, Eds. Cambridge University Press, 2001.","DOI":"10.1017\/CBO9780511624148.008"},{"key":"7_CR10_Ref","unstructured":"M. Zibulevsky, P. Kisilev, Y. Y. Zeevi, and B. A. Pearlmutter, \u201cBlind source separation via multinode sparse representation,\u201d in Advances in Neural Infor-mation Processing Systems 12. MIT Press, 2002."},{"issue":"3","key":"7_CR11_Ref","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1109\/72.761722","volume":"10","author":"A Hyv\u00e4rinen","year":"1999","unstructured":"A. Hyv\u00e4rinen, \u201cFast and robust fixed-point algorithms for independent com-ponent analysis,\u201d IEEE Transactions on Neural Networks, vol. 10, no. 3, pp. 626-634, 1999.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"7_CR12_Ref","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1016\/S0960-0779(00)00077-1","volume":"12","author":"T Akuzawa","year":"2001","unstructured":"T. Akuzawa and N. Murata, \u201cMultiplicative nonholonomic Newton-like algo-rithm,\u201d Chaos, Solitons and Fractals, vol. 12, p. 785, 2001.","journal-title":"Chaos, Solitons and Fractals"},{"key":"7_CR13_Ref","unstructured":"T. Akuzawa, \u201cExtended quasi-Newton method for the ICA,\u201d Laboratory for Mathematical Neuroscience, RIKEN Brain Science Institute, Tech. Rep., 2000, http:\/\/www.mns.brain.riken.go.jp\/\u02dcakuzawa\/publ.html ."},{"issue":"4","key":"7_CR14_Ref","doi-asserted-by":"publisher","first-page":"1136","DOI":"10.1137\/S089547980035689X","volume":"22","author":"D Pham","year":"2001","unstructured":"D. Pham, \u201cJoint approximate diagonalization of positive definite matrices,\u201d SIAM J. on Matrix Anal. and Appl., vol. 22, no. 4, pp. 1136-1152, 2001.","journal-title":"SIAM J. on Matrix Anal. and Appl."},{"issue":"9","key":"7_CR15_Ref","doi-asserted-by":"publisher","first-page":"1837","DOI":"10.1109\/78.942614","volume":"49","author":"D Pham","year":"2001","unstructured":"D. Pham and J.-F. Cardoso, \u201cBlind separation of instantaneous mixtures of non-stationary sources,\u201d IEEE Transactions on Signal Processing, vol. 49, no. 9, pp. 1837-1848, 2001.","journal-title":"IEEE Transactions on Signal Processing"},{"key":"7_CR16_Ref","unstructured":"M. Joho and K. Rahbar, \u201cJoint diagonalization of correlation matrices by using Newton methods with application to blind signal separation,\u201d SAM 2002, 2002, http:\/\/www.phonak.uiuc.edu\/\u02dcjoho\/research\/publications\/sam 2002 2.pdf ."},{"key":"7_CR17_Ref","unstructured":"A. Ziehe, P. Laskov, G. Nolte, and K.-R. Mueller, \u201cA fast algorithm for joint diagonalization with non-orthogonal transformations and its application to blind source separation,\u201d Journal of Machine Learning Research, vol. 5, pp. 801-818, July 2004."},{"key":"7_CR18_Ref","doi-asserted-by":"crossref","unstructured":"B. Kort and D. Bertsekas, \u201cMultiplier methods for convex programming,\u201d Proc 1073 IEEE Conf. Decision Control, San-Diego, Calif., pp. 428-432, 1973.","DOI":"10.1109\/CDC.1973.269203"},{"key":"7_CR19_Ref","volume-title":"Constrained Optimization and Lagrange Multiplier Methods","author":"D Bertsekas","year":"1982","unstructured":"D. Bertsekas, Constrained Optimization and Lagrange Multiplier Methods. New York: Academic Press, 1982."},{"key":"7_CR20_Ref","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF01586050","volume":"54","author":"R Polyak","year":"1992","unstructured":"R. Polyak, \u201cModified barrier functions: Theory and methods,\u201d Math. Program-ming, vol. 54, pp. 177-222, 1992.","journal-title":"Math. Program-ming"},{"key":"7_CR21_Ref","unstructured":"A. Ben-Tal, I. Yuzefovich, and M. Zibulevsky, \u201cPenalty\/barrier multiplier meth-ods for min-max and constrained smooth convex programs,\u201d Opt. Lab., Dept. of Indust. Eng., Technion, Haifa, Israel, Tech. Rep. 9, 1992."},{"key":"7_CR22_Ref","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01580598","volume":"60","author":"P Tseng","year":"1993","unstructured":"P. Tseng and D. Bertsekas, \u201cConvergence of the exponential multiplier method for convex programming,\u201d Math. Programming, vol. 60, pp. 1-19, 1993.","journal-title":"Math. Programming"},{"key":"7_CR23_Ref","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/BF02206826","volume":"62","author":"MG Breitfeld","year":"1996","unstructured":"M. G. Breitfeld and D. Shanno, \u201cComputational experience with penalty\/bar-rier methods for nonlinear programming,\u201d Annals of Operations Research, vol. 62, pp. 439-464, 1996.","journal-title":"Annals of Operations Research"},{"key":"7_CR24_Ref","unstructured":"M. Zibulevsky, \u201cPenalty\/barrier multiplier methods for large-scale nonlinear and semidefinite programming,\u201d Ph.D. dissertation, Technion - Israel Institute of Technology, 1996, http:\/\/ie.technion.ac.il\/\u02dcmcib\/ ."},{"issue":"2","key":"7_CR25_Ref","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1137\/S1052623493259215","volume":"7","author":"A Ben-Tal","year":"1997","unstructured":"A. Ben-Tal and M. Zibulevsky, \u201cPenalty\/barrier multiplier methods for con-vex programming problems,\u201d SIAM Journal on Optimization, vol. 7, no. 2, pp. 347-366, 1997.","journal-title":"SIAM Journal on Optimization"},{"issue":"4","key":"7_CR26_Ref","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1080\/10556780008805787","volume":"13","author":"L Mosheyev","year":"2000","unstructured":"L. Mosheyev and M. Zibulevsky, \u201cPenalty\/barrier multiplier algorithm for semi-definite programming,\u201d Optimization Methods and Software, vol. 13, no. 4, pp. 235-261, 2000.","journal-title":"Optimization Methods and Software"},{"issue":"3","key":"7_CR27_Ref","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1080\/1055678031000098773","volume":"18","author":"M Kocvara","year":"2003","unstructured":"M. Kocvara and M. Stingl, \u201cPENNON - a code for convex nonlinear and semidefinite programming,\u201d Optimization Methods and Softwarte, vol. 18(3), pp. 317-333, 2003.","journal-title":"Optimization Methods and Softwarte"},{"key":"7_CR28_Ref","doi-asserted-by":"crossref","unstructured":"A. Ben-Tal and M. Teboulle, \u201cA smoothing technique for nondifferentiable optimization problems,\u201d Fifth French German Conference, Lecture Notes in Math. 1405, Springer-Verlag, New York, pp. 1-11, 1989.","DOI":"10.1007\/BFb0083582"},{"key":"7_CR29_Ref","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF00249052","volume":"5","author":"C Chen","year":"1996","unstructured":"C. Chen and O. L. Mangasarian, \u201cA class of smoothing functions for nonlin-ear and mixed complementarity problems,\u201d Computational Optimization and Applications, vol. 5, pp. 97-138, 1996.","journal-title":"Computational Optimization and Applications"},{"issue":"17","key":"7_CR30_Ref","doi-asserted-by":"publisher","first-page":"1386","DOI":"10.1049\/el:19940956","volume":"30","author":"A Cichocki","year":"1994","unstructured":"A. Cichocki, R. Unbehauen, and E. Rummert, \u201cRobust learning algorithm for blind separation of signals,\u201d Electronics Letters, vol. 30, no. 17, pp. 1386-1387, 1994.","journal-title":"Electronics Letters"},{"key":"7_CR31_Ref","unstructured":"S. Amari, A. Cichocki, and H. H. Yang, \u201cA new learning algorithm for blind signal separation,\u201d in Advances in Neural Information Processing Systems 8. MIT Press, 1996. [Online]. Available: http:\/\/www.cs.cmu.edu\/Groups\/NIPS\/ NIPS95\/Papers.html"},{"issue":"12","key":"7_CR32_Ref","doi-asserted-by":"publisher","first-page":"3017","DOI":"10.1109\/78.553476","volume":"44","author":"J-F Cardoso","year":"1996","unstructured":"J.-F. Cardoso and B. Laheld, \u201cEquivariant adaptive source separation,\u201d IEEE Transactions on Signal Processing, vol. 44, no. 12, pp. 3017-3030, 1996.","journal-title":"IEEE Transactions on Signal Processing"},{"key":"7_CR33_Ref","volume-title":"Practical Optimization","author":"PE Gill","year":"1981","unstructured":"P. E. Gill, W. Murray, and M. H. Wright, Practical Optimization. New York: Academic Press, 1981."},{"key":"7_CR34_Ref","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R Rockafellar","year":"1970","unstructured":"R. Rockafellar, Convex Analysis. Princeton, NJ: Princeton University Press, 1970."},{"key":"7_CR35_Ref","unstructured":"M. Zibulevsky,\u201cSmoothing method of multipliers for sum-max prob-lems,\u201d Dept. of Elec. Eng., Technion, Tech. Rep., 2003, http:\/\/ie.technion.ac.il\/\u02dcmcib\/ ."},{"key":"7_CR36_Ref","unstructured":"A. Cichocki, S. Amari, and K. Siwek,\u201cICALAB toolbox for im- age processing- benchmarks,\u201d2002, http:\/\/www.bsp.brain.riken.go.jp\/ ICALAB\/ICALABImageProc\/benchmarks\/."},{"issue":"1","key":"7_CR37_Ref","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1162\/089976699300016863","volume":"11","author":"J-F Cardoso","year":"1999","unstructured":"J.-F. Cardoso, \u201cHigh-order contrasts for independent component analysis,\u201d Neural Computation, vol. 11, no. 1, pp. 157-192, 1999.","journal-title":"Neural Computation"},{"key":"7_CR38_Ref","unstructured":"S. Makeig, \u201cICA toolbox for psychophysiological research,\u201d Computational Neurobiology Laboratory, the Salk Institute for Biological Studies, 1998, http:\/\/www.cnl.salk.edu\/\u02dc ica.html ."},{"key":"7_CR39_Ref","unstructured":"A. Hyv\u00e4rinen,\u201cThe Fast-ICA MATLAB package,\u201d 1998, http:\/\/www.cis.hut.fi\/\u02dcaapo\/ ."},{"key":"7_CR40_Ref","unstructured":"J.-F. Cardoso, \u201cJADE for real-valued data,\u201d 1999, http:\/\/sig.enst.fr: 80\/\u223ccar-doso\/guidesepsou.html."}],"container-title":["Signals and Communication Technology","Blind Speech Separation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4020-6479-1_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,29]],"date-time":"2021-04-29T01:35:00Z","timestamp":1619660100000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4020-6479-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9781402064784","9781402064791"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-1-4020-6479-1_7","relation":{},"ISSN":["1860-4862"],"issn-type":[{"type":"print","value":"1860-4862"}],"subject":[],"published":{"date-parts":[[2007]]}}}