{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T07:48:04Z","timestamp":1778917684479,"version":"3.51.4"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,3,11]],"date-time":"2015-03-11T00:00:00Z","timestamp":1426032000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s10208-015-9256-x","type":"journal-article","created":{"date-parts":[[2015,3,10]],"date-time":"2015-03-10T21:18:46Z","timestamp":1426022326000},"page":"457-492","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["A Quadratically Convergent Algorithm for Structured Low-Rank Approximation"],"prefix":"10.1007","volume":"16","author":[{"given":"\u00c9ric","family":"Schost","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre-Jean","family":"Spaenlehauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,11]]},"reference":[{"key":"9256_CR1","doi-asserted-by":"crossref","unstructured":"Absil, P.A., Amodei, L., Meyer, G.: Two Newton methods on the manifold of fixed-rank matrices endowed with Riemannian quotient geometries. Computational Statistics (2013)","DOI":"10.1007\/s00180-013-0441-6"},{"key":"9256_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61257-2","volume-title":"Numerical continuation methods","author":"E Allgower","year":"1990","unstructured":"Allgower, E., Georg, K.: Numerical continuation methods, vol.\u00a013. Springer-Verlag Berlin (1990)"},{"key":"9256_CR3","volume-title":"Geometry of algebraic curves I","author":"E Arbarello","year":"1984","unstructured":"Arbarello, E., Cornalba, M., Griffiths, P., Harris, J.: Geometry of algebraic curves I, vol. 268. Springer (1984)"},{"issue":"2","key":"9256_CR4","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/BF02760034","volume":"3","author":"A Ben-Israel","year":"1965","unstructured":"Ben-Israel, A.: A modified Newton-Raphson method for the solution of systems of equations. Israel Journal of Mathematics 3(2), 94\u201398 (1965)","journal-title":"Israel Journal of Mathematics"},{"key":"9256_CR5","doi-asserted-by":"crossref","unstructured":"Bini, D., Boito, P.: Structured matrix-based methods for polynomial-GCD: analysis and comparisons. In: Proceedings of the 2007 international symposium on Symbolic and algebraic computation, pp. 9\u201316. ACM (2007)","DOI":"10.1145\/1277548.1277551"},{"key":"9256_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0080378","volume-title":"Determinantal Rings","author":"W Bruns","year":"1988","unstructured":"Bruns, W., Vetter, U.: Determinantal Rings. Springer (1988)"},{"issue":"1","key":"9256_CR7","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1109\/29.1488","volume":"36","author":"J Cadzow","year":"1988","unstructured":"Cadzow, J.: Signal enhancement-a composite property mapping algorithm. IEEE Transactions on Acoustics, Speech and Signal Processing 36(1), 49\u201362 (1988)","journal-title":"IEEE Transactions on Acoustics, Speech and Signal Processing"},{"issue":"6","key":"9256_CR8","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1109\/JPROC.2009.2035722","volume":"98","author":"E Candes","year":"2010","unstructured":"Candes, E., Plan, Y.: Matrix completion with noise. Proceedings of the IEEE 98(6), 925\u2013936 (2010)","journal-title":"Proceedings of the IEEE"},{"issue":"6","key":"9256_CR9","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"E Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E., Recht, B.: Exact matrix completion via convex optimization. Foundations of Computational Mathematics 9(6), 717\u2013772 (2009)","journal-title":"Foundations of Computational Mathematics"},{"issue":"5","key":"9256_CR10","doi-asserted-by":"crossref","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"E Cand\u00e8s","year":"2010","unstructured":"Cand\u00e8s, E., Tao, T.: The power of convex relaxation: Near-optimal matrix completion. Information Theory, IEEE Transactions on 56(5), 2053\u20132080 (2010)","journal-title":"Information Theory, IEEE Transactions on"},{"key":"9256_CR11","doi-asserted-by":"crossref","unstructured":"Ch\u00e8ze, G., Yakoubsohn, J.C., Galligo, A., Mourrain, B.: Computing nearest GCD with certification. In: Proceedings of the 2009 conference on Symbolic numeric computation, pp. 29\u201334. ACM (2009)","DOI":"10.1145\/1577190.1577200"},{"key":"9256_CR12","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0024-3795(02)00505-0","volume":"366","author":"M Chu","year":"2003","unstructured":"M., R., R. (2003) Structured Low Rank Approximation. Linear algebra and its applications 366:157\u2013172","journal-title":"Linear algebra and its applications"},{"key":"9256_CR13","doi-asserted-by":"crossref","unstructured":"Condat, L., Hirabayashi, A.: Cadzow denoising upgraded: A new projection method for the recovery of Dirac pulses from noisy linear measurements (2012). Preprint","DOI":"10.1109\/ICASSP.2013.6638819"},{"issue":"12","key":"9256_CR14","doi-asserted-by":"crossref","first-page":"3394","DOI":"10.1109\/TSP.2004.837413","volume":"52","author":"R Corless","year":"2004","unstructured":"Corless, R., Watt, S., Zhi, L.: QR factoring to compute the GCD of univariate approximate polynomials. IEEE Transactions on Signal Processing 52(12), 3394\u20133402 (2004)","journal-title":"IEEE Transactions on Signal Processing"},{"key":"9256_CR15","volume-title":"Points fixes, z\u00e9ros et la m\u00e9thode de Newton","author":"JP Dedieu","year":"2006","unstructured":"Dedieu, J.P.: Points fixes, z\u00e9ros et la m\u00e9thode de Newton, vol.\u00a054. Springer (2006)"},{"issue":"1","key":"9256_CR16","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1006\/jcom.2001.0612","volume":"18","author":"JP Dedieu","year":"2002","unstructured":"Dedieu, J.P., Kim, M.H.: Newton\u2019s method for analytic systems of equations with constant rank derivatives. Journal of Complexity 18(1), 187\u2013209 (2002)","journal-title":"Journal of Complexity"},{"key":"9256_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-9298-9","volume-title":"Best approximation in inner product spaces","author":"F Deutsch","year":"2001","unstructured":"Deutsch, F.: Best approximation in inner product spaces. Springer (2001)"},{"key":"9256_CR18","doi-asserted-by":"crossref","unstructured":"Draisma, J., Horobet, E., Ottaviani, G., Sturmfels, B., Thomas, R.R.: The Euclidean distance degree of an algebraic variety. Foundations of Computational Mathematics (2015). To appear","DOI":"10.1145\/2631948.2631951"},{"issue":"3","key":"9256_CR19","doi-asserted-by":"crossref","first-page":"541","DOI":"10.2307\/2374622","volume":"110","author":"D Eisenbud","year":"1988","unstructured":"Eisenbud, D.: Linear sections of determinantal varieties. American Journal of Mathematics 110(3), 541\u2013575 (1988)","journal-title":"American Journal of Mathematics"},{"key":"9256_CR20","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0022-4049(97)00013-3","volume":"117","author":"I Emiris","year":"1997","unstructured":"Emiris, I., Galligo, A., Lombardi, H.: Certified approximate univariate GCDs. Journal of Pure and Applied Algebra 117, 229\u2013251 (1997)","journal-title":"Journal of Pure and Applied Algebra"},{"issue":"3","key":"9256_CR21","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1090\/S0002-9947-1937-1501907-0","volume":"41","author":"K Friedrichs","year":"1937","unstructured":"Friedrichs, K.: On certain inequalities and characteristic value problems for analytic functions and for functions of two variables. Transactions of the American Mathematical Society 41(3), 321\u2013364 (1937)","journal-title":"Transactions of the American Mathematical Society"},{"key":"9256_CR22","doi-asserted-by":"crossref","unstructured":"Gao, S., Kaltofen, E., May, J., Yang, Z., Zhi, L.: Approximate factorization of multivariate polynomials via differential equations. In: Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation, pp. 167\u2013174. ACM (2004)","DOI":"10.1145\/1005285.1005311"},{"key":"9256_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-7904-5","volume-title":"Stable mappings and their singularities","author":"M Golubitsky","year":"1973","unstructured":"Golubitsky, M., Guillemin, V.: Stable mappings and their singularities, vol. 314. Springer-Verlag New York (1973)"},{"key":"9256_CR24","doi-asserted-by":"crossref","unstructured":"Hogben, L. (ed.): Handbook of Linear Algebra. Discrete Mathematics and Its Applications. Taylor & Francis (2006)","DOI":"10.1201\/9781420010572"},{"key":"9256_CR25","doi-asserted-by":"crossref","unstructured":"Jain, P., Netrapalli, P., Sanghavi, S.: Low-rank matrix completion using alternating minimization. In: Proceedings of STOC\u20192013, pp. 665\u2013674. ACM (2013)","DOI":"10.1145\/2488608.2488693"},{"issue":"5","key":"9256_CR26","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/j.jsc.2007.11.005","volume":"43","author":"E Kaltofen","year":"2008","unstructured":"Kaltofen, E., May, J., Yang, Z., Zhi, L.: Approximate factorization of multivariate polynomials using singular value decomposition. Journal of Symbolic Computation 43(5), 359\u2013376 (2008)","journal-title":"Journal of Symbolic Computation"},{"key":"9256_CR27","doi-asserted-by":"crossref","unstructured":"Kaltofen, E., Yang, Z., Zhi, L.: Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials. In: Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, pp. 169\u2013176. ACM (2006)","DOI":"10.1145\/1145768.1145799"},{"key":"9256_CR28","doi-asserted-by":"crossref","unstructured":"Kaltofen, E., Yang, Z., Zhi, L.: Structured low rank approximation of a Sylvester matrix. In: Symbolic-numeric computation, pp. 69\u201383. Springer (2007)","DOI":"10.1007\/978-3-7643-7984-1_5"},{"key":"9256_CR29","doi-asserted-by":"crossref","unstructured":"Karmarkar, N., Lakshman, Y.: Approximate polynomial greatest common divisors and nearest singular polynomials. In: Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, pp. 35\u201339. ACM (1996)","DOI":"10.1145\/236869.236892"},{"issue":"6","key":"9256_CR30","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1006\/jsco.1998.0232","volume":"26","author":"N Karmarkar","year":"1998","unstructured":"Karmarkar, N., Lakshman, Y.: On approximate GCDs of univariate polynomials. Journal of Symbolic Computation 26(6), 653\u2013666 (1998)","journal-title":"Journal of Symbolic Computation"},{"issue":"1","key":"9256_CR31","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1287\/moor.1070.0291","volume":"33","author":"AS Lewis","year":"2008","unstructured":"Lewis, A.S., Malick, J.: Alternating projections on manifolds. Mathematics of Operations Research 33(1), 216\u2013234 (2008)","journal-title":"Mathematics of Operations Research"},{"key":"9256_CR32","first-page":"165","volume":"11","author":"B Li","year":"2005","unstructured":"Li B., Yang Z., Zhi L. (2005) Fast low rank approximation of a Sylvester matrix by structured total least norm. J. Japan Soc. Symbolic and Algebraic Comp 11:165\u2013174","journal-title":"J. Japan Soc. Symbolic and Algebraic Comp"},{"issue":"4","key":"9256_CR33","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1016\/j.automatica.2007.09.011","volume":"44","author":"I Markovsky","year":"2008","unstructured":"Markovsky, I.: Structured low-rank approximation and its applications. Automatica 44(4), 891\u2013909 (2008)","journal-title":"Automatica"},{"issue":"4","key":"9256_CR34","doi-asserted-by":"crossref","first-page":"1521","DOI":"10.1137\/13094520X","volume":"35","author":"G Ottaviani","year":"2014","unstructured":"Ottaviani, G., Spaenlehauer, P.J., Sturmfels, B.: Exact solutions in structured low-rank approximation. SIAM Journal on Matrix Analysis and Applications 35(4), 1521 \u2013 1542 (2014)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"2","key":"9256_CR35","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1006\/inco.2001.3032","volume":"167","author":"V Pan","year":"2001","unstructured":"Pan, V.: Computation of approximate polynomial GCDs and an extension. Information and Computation 167(2), 71\u201385 (2001)","journal-title":"Information and Computation"},{"issue":"4","key":"9256_CR36","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1023\/A:1022347425533","volume":"39","author":"H Park","year":"1999","unstructured":"Park, H., Zhang, L., Rosen, J.: Low rank approximation of a Hankel matrix by structured total least norm. BIT Numerical Mathematics 39(4), 757\u2013779 (1999)","journal-title":"BIT Numerical Mathematics"},{"key":"9256_CR37","unstructured":"Recht, B.: A simpler approach to matrix completion. The Journal of Machine Learning Research pp. 3413\u20133430 (2011)"},{"key":"9256_CR38","doi-asserted-by":"crossref","unstructured":"Recht, B., Xu, W., Hassibi, B.: Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization. In: 47th IEEE Conference on Decision and Control, 2008., pp. 3065\u20133070. IEEE (2008)","DOI":"10.1109\/CDC.2008.4739332"},{"issue":"1","key":"9256_CR39","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1137\/S0895479896301662","volume":"20","author":"J Rosen","year":"1998","unstructured":"Rosen, J., Park, H., Glick, J.: Structured total least norm for nonlinear problems. SIAM Journal on Matrix Analysis and Applications 20(1), 14\u201330 (1998)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"9256_CR40","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1006\/jnth.1999.2381","volume":"77","author":"W Ruppert","year":"1999","unstructured":"Ruppert, W.: Reducibility of polynomials $$f(x, y)$$ f ( x , y ) modulo $$p$$ p . Journal of Number Theory 77, 62\u201370 (1999)","journal-title":"Journal of Number Theory"},{"issue":"1","key":"9256_CR41","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/0885-064X(85)90024-X","volume":"1","author":"A Sch\u00f6nhage","year":"1985","unstructured":"Sch\u00f6nhage, A.: Quasi-GCD computations. Journal of Complexity 1(1), 118\u2013137 (1985)","journal-title":"Journal of Complexity"},{"key":"9256_CR42","doi-asserted-by":"crossref","unstructured":"Terui, A.: An iterative method for calculating approximate GCD of univariate polynomials. In: Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation, pp. 351\u2013358. ACM (2009)","DOI":"10.1145\/1576702.1576750"},{"key":"9256_CR43","doi-asserted-by":"crossref","unstructured":"Vandereycken, B.: Low-rank matrix completion by Riemannian optimization. SIAM Journal on Optimization (2013). Accepted","DOI":"10.1137\/110845768"},{"key":"9256_CR44","first-page":"141","volume":"31","author":"J Winkler","year":"2008","unstructured":"Winkler, J., Allan, J.: Structured low rank approximations of the Sylvester resultant matrix for approximate GCDs of Bernstein basis polynomials. Electronic Transactions on Numerical Analysis 31, 141\u2013155 (2008)","journal-title":"Electronic Transactions on Numerical Analysis"},{"key":"9256_CR45","first-page":"244","volume":"11","author":"JC Yakoubsohn","year":"2011","unstructured":"Yakoubsohn, J.C., Masmoudi, M., Cheze, G., Auroux, D.: Approximate GCD a la Dedieu. Applied Mathematics E-Notes 11, 244\u2013248 (2011)","journal-title":"Applied Mathematics E-Notes"},{"key":"9256_CR46","doi-asserted-by":"crossref","unstructured":"Zeng, Z., Dayton, B.: The approximate GCD of inexact polynomials. In: Proceedings of the 2004 International Symposium on Symbolic and Algebraic Computation, pp. 320\u2013327. ACM (2004).","DOI":"10.1145\/1005285.1005331"}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-015-9256-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-015-9256-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-015-9256-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,21]],"date-time":"2019-08-21T21:02:02Z","timestamp":1566421322000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-015-9256-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,11]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["9256"],"URL":"https:\/\/doi.org\/10.1007\/s10208-015-9256-x","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,11]]}}}