{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T20:25:28Z","timestamp":1770063928231,"version":"3.49.0"},"publisher-location":"Boston, MA","reference-count":67,"publisher":"Springer US","isbn-type":[{"value":"9780387747583","type":"print"},{"value":"9780387747590","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_355","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T10:59:49Z","timestamp":1219661989000},"page":"1967-1975","source":"Crossref","is-referenced-by-count":12,"title":["Matrix Completion Problems"],"prefix":"10.1007","author":[{"given":"Monique","family":"Laurent","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"355_CR1_355","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0024-3795(88)90240-6","volume":"107","author":"J. Agler","year":"1988","unstructured":"Agler J, Helton JW, McCullough S, Rodman L (1988) Positive semidefinite matrices with a\u00a0given sparsity pattern. Linear Alg & Its Appl 107:101\u2013149","journal-title":"Linear Alg. & Its Appl."},{"key":"355_CR2_355","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1023\/A:1008655427845","volume":"12","author":"A.Y. Alfakih","year":"1998","unstructured":"Alfakih AY, Khandani A, Wolkowicz H (1998) Solving Euclidean distance matrix completion problems via semidefinite programming. Comput Optim Appl 12:13\u201330","journal-title":"Comput. Optim. Appl."},{"key":"355_CR3_355","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1137\/0805002","volume":"5","author":"F. Alizadeh","year":"1995","unstructured":"Alizadeh F (1995) Interior point methods in semidefinite programming with applications in combinatorial optimization. SIAM J Optim 5:13\u201351","journal-title":"SIAM J. Optim."},{"key":"355_CR4_355","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1137\/S0895479893249757","volume":"16","author":"M. Bakonyi","year":"1995","unstructured":"Bakonyi M, Johnson CR (1995) The Euclidian distance matrix completion problem. SIAM J Matrix Anal Appl 16:646\u2013654","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"355_CR5_355","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02592023","volume":"36","author":"F. Barahona","year":"1986","unstructured":"Barahona F, Mahjoub AR (1986) On the cut polytope. Math Program 36:157\u2013173","journal-title":"Math. Program."},{"key":"355_CR6_355","series-title":"Memoirs Amer. Math. Soc.","volume-title":"The real positive definite completion problem: cycle completability","author":"W.W. Barrett","year":"1996","unstructured":"Barrett WW, Johnson CR, Loewy R (1996) The real positive definite completion problem: cycle completability. Memoirs Amer Math Soc, vol\u00a0584. Amer. Math. Soc., Providence, RI"},{"key":"355_CR7_355","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0024-3795(89)90706-4","volume":"121","author":"W.W. Barrett","year":"1989","unstructured":"Barrett WW, Johnson CR, Lundquist M (1989) Determinantal formulas for matrix completions associated with chordal graphs. Linear Alg & Its Appl 121:265\u2013289","journal-title":"Linear Alg. & Its Appl."},{"key":"355_CR8_355","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0024-3795(93)90234-F","volume":"192","author":"W. Barrett","year":"1993","unstructured":"Barrett W, Johnson CR, Tarazaga P (1993) The real positive definite completion problem for a\u00a0simple cycle. Linear Alg & Its Appl 192:3\u201331","journal-title":"Linear Alg. & Its Appl."},{"key":"355_CR9_355","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02573959","volume":"10","author":"A.I. Barvinok","year":"1993","unstructured":"Barvinok AI (1993) Feasibility testing for systems of real quadratic equations. Discrete Comput Geom 10:1\u201313","journal-title":"Discrete Comput. Geom."},{"key":"355_CR10_355","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF02574037","volume":"13","author":"A.I. Barvinok","year":"1995","unstructured":"Barvinok AI (1995) Problems of distance geometry and convex properties of quadratic maps. Discrete Comput Geom 13:189\u2013202","journal-title":"Discrete Comput. Geom."},{"key":"355_CR11_355","volume-title":"Theory and applications of distance geometry","author":"L.M. Blumenthal","year":"1953","unstructured":"Blumenthal LM (1953) Theory and applications of distance geometry. Oxford Univ. Press, Oxford"},{"key":"355_CR12_355","first-page":"165","volume-title":"The Gohberg Anniv. Coll., vol\u00a0I","author":"N. Cohen","year":"1989","unstructured":"Cohen N, Johnson CR, Rodman L, Woederman HJ (1989) Ranks of completions of partial matrices. In: Dym H, et al (eds) The Gohberg Anniv. Coll. vol\u00a0I, Birkh\u00e4user, Basel, pp 165\u2013185"},{"key":"355_CR13_355","volume-title":"Distance geometry and molecular conformation","author":"G.M. Crippen","year":"1988","unstructured":"Crippen GM, Havel TF (1988) Distance geometry and molecular conformation. Res. Studies Press, Taunton, UK"},{"key":"355_CR14_355","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-04295-9","volume-title":"Geometry of cuts and metrics","author":"M. Deza","year":"1997","unstructured":"Deza M, Laurent M (1997) Geometry of cuts and metrics. Algorithms and Combinatorics, vol\u00a015. Springer, Berlin"},{"key":"355_CR15_355","first-page":"85","volume":"44","author":"J.H. Drew","year":"1998","unstructured":"Drew JH, Johnson CR (1998) The completely positive and doubly nonnegative completion problems. Linear Alg & Its Appl 44:85\u201392","journal-title":"Linear Alg. & Its Appl."},{"key":"355_CR16_355","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0024-3795(81)90215-9","volume":"36","author":"H. Dym","year":"1981","unstructured":"Dym H, Gohberg I (1981) Extensions of band matrices with band inverses. Linear Alg & Its Appl 36:1\u201324","journal-title":"Linear Alg. & Its Appl."},{"key":"355_CR17_355","first-page":"15","volume":"24","author":"R.L. Ellis","year":"1988","unstructured":"Ellis RL, Lay DC, Gohberg I (1988) On negative eigenvalues of selfadjoint extensions of band matrices. Linear Alg & Its Appl 24:15\u201325","journal-title":"Linear Alg. & Its Appl."},{"key":"355_CR18_355","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0024-3795(98)10210-0","volume":"288","author":"J. Geelen","year":"1999","unstructured":"Geelen J (1999) Maximum rank matrix completion. Linear Alg & Its Appl 288:211\u2013217","journal-title":"Linear Alg. & Its Appl."},{"key":"355_CR19_355","first-page":"175","volume":"14","author":"W. Glunt","year":"1998","unstructured":"Glunt W, Hayden TL, Raydan M (1998) Molecular conformations from distance matrices. J\u00a0Comput Chem 14:175\u2013190","journal-title":"J. Comput. Chem."},{"key":"355_CR20_355","first-page":"143","volume":"79","author":"M.X. Goemans","year":"1997","unstructured":"Goemans MX (1997) Semidefinite programming in combinatorial optimization. Math Program 79:143\u2013161","journal-title":"Math. Program."},{"key":"355_CR21_355","volume-title":"Algorithmic theory and perfect graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic MC (1980) Algorithmic theory and perfect graphs. Acad. Press, New York"},{"key":"355_CR22_355","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0024-3795(80)90212-8","volume":"31","author":"L.J. Gray","year":"1980","unstructured":"Gray LJ, Wilson DG (1980) Nonnegative factorization of positive semidefinite nonnegative matrices. Linear Alg & Its Appl 31:119\u2013127","journal-title":"Linear Alg. & Its Appl."},{"key":"355_CR23_355","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0024-3795(84)90207-6","volume":"58","author":"R. Grone","year":"1984","unstructured":"Grone R, Johnson CR, S\u00e1 EM, Wolkowicz H (1984) Positive definite completions of partial hermitian matrices. Linear Alg & Its Appl 58:109\u2013124","journal-title":"Linear Alg. & Its Appl."},{"key":"355_CR24_355","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric algorithms and combinatorial optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel M, Lov\u00e1sz L, Schrijver A (1988) Geometric algorithms and combinatorial optimization. Springer, Berlin"},{"key":"355_CR25_355","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1080\/03081088408817619","volume":"16","author":"D.J. Hartfiel","year":"1984","unstructured":"Hartfiel DJ, Loewy R (1984) A\u00a0determinantal version of the Frobenius-K\u00f6nig theorem. Linear Multilinear Algebra 16:155\u2013165","journal-title":"Linear Multilinear Algebra"},{"key":"355_CR26_355","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0079-6107(91)90007-F","volume":"56","author":"T.F. Havel","year":"1991","unstructured":"Havel TF (1991) An evaluation of computational strategies for use in the determination of protein structure from distance constraints obtained by nuclear magnetic resonance. Program Biophys Biophys Chem 56:43\u201378","journal-title":"Program. Biophys. Biophys. Chem."},{"key":"355_CR27_355","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1137\/0806020","volume":"6","author":"C. Helmberg","year":"1996","unstructured":"Helmberg C, Rendl F, Vanderbei RJ, Wolkowicz H (1996) An interior-point method for semidefinite programming. SIAM J Optim 6:342\u2013361","journal-title":"SIAM J. Optim."},{"key":"355_CR28_355","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1137\/0610028","volume":"10","author":"J.W. Helton","year":"1989","unstructured":"Helton JW, Pierce S, Rodman L (1989) The ranks of extremal positive semidefinite matrices with given sparsity pattern. SIAM J Matrix Anal Appl 10:407\u2013423","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"355_CR29_355","unstructured":"Hendrickson B (1990) The molecule problem: Determining conformation from pairwise distances. PhD Thesis. Techn. Report Dept. Computer Sci. Cornell Univ. 90\u20131159"},{"key":"355_CR30_355","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1137\/0221008","volume":"21","author":"B. Hendrickson","year":"1992","unstructured":"Hendrickson B (1992) Conditions for unique graph realizations. SIAM J Comput 21:65\u201384","journal-title":"SIAM J. Comput."},{"key":"355_CR31_355","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1137\/0805040","volume":"5","author":"B. Hendrickson","year":"1995","unstructured":"Hendrickson B (1995) The molecule problem: exploiting structure in global optimization. SIAM J Optim 5:835\u2013857","journal-title":"SIAM J. Optim."},{"key":"355_CR32_355","series-title":"Proc. Symp. Appl. Math.","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1090\/psapm\/040\/1059486","volume-title":"Matrix Theory and Appl.","author":"C.R. Johnson","year":"1990","unstructured":"Johnson CR (1990) Matrix completion problems: A\u00a0survey. In: Johnson CR (ed) Matrix Theory and Appl. Proc Symp Appl Math. Amer. Math. Soc., Providence, RI, pp 171\u2013198"},{"key":"355_CR33_355","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1080\/03081089508818392","volume":"39","author":"C.R. Johnson","year":"1995","unstructured":"Johnson CR, Jones C, Kroschel B (1995) The distance matrix completion problem: cycle completability. Linear Multilinear Algebra 39:195\u2013207","journal-title":"Linear Multilinear Algebra"},{"key":"355_CR34_355","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1023\/A:1018363021404","volume":"9","author":"C.R. Johnson","year":"1998","unstructured":"Johnson CR, Kroschel B, Wolkowicz H (1998) An interior-point method for approximate positive semidefinite completions. Comput Optim Appl 9:175\u2013190","journal-title":"Comput. Optim. Appl."},{"key":"355_CR35_355","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1080\/03081088408817622","volume":"16","author":"C.R. Johnson","year":"1984","unstructured":"Johnson CR, Rodman L (1984) Inertia possibilities for completions of partial Hermitian matrices. Linear multilinear algebra 16:179\u2013195","journal-title":"Linear multilinear algebra"},{"key":"355_CR36_355","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/0022-1236(86)90091-1","volume":"69","author":"C.R. Johnson","year":"1986","unstructured":"Johnson CR, Rodman L (1986) Completion of matrices to contractions. J\u00a0Funct Anal 69:260\u2013267","journal-title":"J. Funct. Anal."},{"key":"355_CR37_355","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/978-3-0348-9284-1_5","volume-title":"Contributions to Operator Theory and its Applications","author":"C.R. Johnson","year":"1988","unstructured":"Johnson CR, Rodman L (1988) Chordal inheritance principles and positive definite completions of partial matrices over function rings. In: Gohberg I (ed) Contributions to Operator Theory and its Applications. Birkh\u00e4user, Basel, pp 107\u2013127"},{"issue":"4","key":"355_CR38_355","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/0024-3795(95)00096-A","volume":"223","author":"C.R. Johnson","year":"1995","unstructured":"Johnson CR, Tarazaga P (1995) Connections between the real positive semidefinite and distance matrix completion problems. Linear Alg & Its Appl 223(4):375\u2013391","journal-title":"Linear Alg. & Its Appl."},{"key":"355_CR39_355","doi-asserted-by":"crossref","unstructured":"Khachiyan L, Porkolab L (1997) Computing integral points in convex semi-algebraic sets. 38th Annual Symp. Foundations Computer Sci., pp 162\u2013171","DOI":"10.1109\/SFCS.1997.646105"},{"key":"355_CR40_355","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0012-365X(93)90374-3","volume":"114","author":"N. Kogan","year":"1993","unstructured":"Kogan N, Berman A (1993) Characterization of completely positive graphs. Discret Math 114:297\u2013304","journal-title":"Discret Math."},{"key":"355_CR41_355","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0076-6879(89)77011-7","volume":"177","author":"I.D. Kuntz","year":"1993","unstructured":"Kuntz ID, Thomason JF, Oshiro CM (1993) Distance geometry. Methods in Enzymologie 177:159\u2013204","journal-title":"Methods in Enzymologie"},{"key":"355_CR42_355","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01534980","volume":"4","author":"G. Laman","year":"1970","unstructured":"Laman G (1970) On graphs and rigidity of plane skeletal structures. J\u00a0Eng Math 4:331\u2013340","journal-title":"J. Engin. Math."},{"key":"355_CR43_355","first-page":"255","volume":"79","author":"M. Laurent","year":"1997","unstructured":"Laurent M (1997) Cuts, matrix completions and graph rigidity. Math Program 79:255\u2013283","journal-title":"Math. Program."},{"key":"355_CR44_355","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0024-3795(95)00741-5","volume":"252","author":"M. Laurent","year":"1997","unstructured":"Laurent M (1997) The real positive semidefinite completion problem for series-parallel graphs. Linear Alg & Its Appl 252:347\u2013366","journal-title":"Linear Alg. & Its Appl."},{"key":"355_CR45_355","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/S0024-3795(97)83714-7","volume":"273","author":"M. Laurent","year":"1998","unstructured":"Laurent M (1998) A\u00a0connection between positive semidefinite and Euclidean distance matrix completion problems. Linear Alg & Its Appl 273:9\u201322","journal-title":"Linear Alg. & Its Appl."},{"key":"355_CR46_355","unstructured":"Laurent M (1998) On the order of a\u00a0graph and its deficiency in chordality. CWI Report PNA-R9801"},{"key":"355_CR47_355","series-title":"Fields Inst. Res. Math. Sci. Commun.","first-page":"51","volume-title":"Topics in Semidefinite and Interior-Point Methods","author":"M. Laurent","year":"1998","unstructured":"Laurent M (1998) A\u00a0tour d'horizon on positive semidefinite and Euclidean distance matrix completion problems. In: Pardalos PM,\n\t    Wolkowicz H (eds) Topics in Semidefinite and Interior-Point Methods. Fields Inst Res Math Sci Commun. Amer. Math. Soc., Providence, RI, pp 51\u201376"},{"issue":"3","key":"355_CR48_355","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1137\/S0895479899352689","volume":"22","author":"M. Laurent","year":"2000","unstructured":"Laurent M (2000) Polynomial instances of the positive semidefinite and Euclidean distance matrix completion problems. SIAM J Matrix Anal Appl 22(3)(874\u2013894","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"355_CR49_355","first-page":"285","volume-title":"Handbook Statist., vol\u00a02","author":"J. de Leeuw","year":"1982","unstructured":"de Leeuw J, Heiser W (1982) Theory of multidimensional scaling. In: Krishnaiah PR, Kanal LN (eds) Handbook Statist., vol\u00a02, North-Holland, Amsterdam, pp 285\u2013316"},{"key":"355_CR50_355","volume-title":"Matching theory","author":"L. Lov\u00e1sz","year":"1986","unstructured":"Lov\u00e1sz L, Plummer MD (1986) Matching theory. Akad. Kiad\u00f3, Budapest"},{"key":"355_CR51_355","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1137\/0603009","volume":"3","author":"L. Lov\u00e1sz","year":"1982","unstructured":"Lov\u00e1sz L, Yemini Y (1982) On generic rigidity in the plane. SIAM J Alg Discrete Meth 3:91\u201398","journal-title":"SIAM J. Alg. Discrete Meth."},{"key":"355_CR52_355","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0024-3795(91)90169-W","volume":"150","author":"M.E. Lundquist","year":"1991","unstructured":"Lundquist ME, Johnson CR (1991) Linearly constrained positive definite completions. Linear Alg & Its Appl 150:195\u2013207","journal-title":"Linear Alg. & Its Appl."},{"key":"355_CR53_355","series-title":"DIMACS","first-page":"151","volume-title":"Global Minimization of Nonconvex Energy Functions: Molecular Conformation and Protein Folding","author":"J.J. Mor\u00e9","year":"1996","unstructured":"Mor\u00e9 JJ, Wu Z (1996) \u03f5-optimal solutions to distance geometry problems via global continuation. In: Pardalos PM, Shalloway D (eds) DIMACS, vol\u00a023, Amer. Math. Soc., Providence, RI, 151\u2013168"},{"key":"355_CR54_355","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1137\/S1052623495283024","volume":"7","author":"J.J. Mor\u00e9","year":"1997","unstructured":"Mor\u00e9 JJ, Wu Z (1997) Global continuation for distance geometry problems. SIAM J Optim 7:814\u2013836","journal-title":"SIAM J. Optim."},{"key":"355_CR55_355","series-title":"IMA","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/978-1-4613-8354-3_2","volume-title":"Combinatorial and graph-theoretical problems in linear algebra","author":"K. Murota","year":"1993","unstructured":"Murota K (1993) Mixed matrices: Irreducibility and decomposition. In: Brualdi RA et al (eds) Combinatorial and graph-theoretical problems in linear algebra. IMA. Springer, Berlin, pp 39\u201371"},{"key":"355_CR56_355","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior point polynomial algorithms in convex programming: Theory and algorithms","author":"Y.E. Nesterov","year":"1994","unstructured":"Nesterov YE, Nemirovsky AS (1994) Interior point polynomial algorithms in convex programming: Theory and algorithms. SIAM, Philadelphia"},{"key":"355_CR57_355","volume-title":"Math. Program.","author":"P.M. Pardalos","year":"1997","unstructured":"Pardalos PM, Lin X (1997) A\u00a0tabu based pattern search method for the distance geometry problem. In: Giannessis F et al (eds) Math. Program. Kluwer, Dordrecht"},{"key":"355_CR58_355","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0022-1236(89)90050-5","volume":"85","author":"V.I. Paulsen","year":"1989","unstructured":"Paulsen VI, Power SC, Smith RR (1989) Schur products and matrix completions. J\u00a0Funct Anal 85:151\u2013178","journal-title":"J. Funct. Anal."},{"key":"355_CR59_355","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1023\/A:1008203903341","volume":"10","author":"L. Porkolab","year":"1997","unstructured":"Porkolab L, Khachiyan L (1997) On the complexity of semidefinite programs. J\u00a0Global Optim 10:351\u2013365","journal-title":"J. Global Optim."},{"key":"355_CR60_355","first-page":"129","volume":"77","author":"M.V. Ramana","year":"1997","unstructured":"Ramana MV (1997) An exact duality theory for semidefinite programming and its complexity implications. Math Program 77:129\u2013162","journal-title":"Math. Program."},{"key":"355_CR61_355","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/0022-247X(70)90282-9","volume":"32","author":"D.J. Rose","year":"1970","unstructured":"Rose DJ (1970) Triangulated graphs and the elimination process. J\u00a0Math Anal Appl 32:597\u2013609","journal-title":"J. Math. Anal. Appl."},{"key":"355_CR62_355","unstructured":"Saxe JB (1979) Embeddability of weighted graphs in k-space is strongly NP-hard. In: Proc. 17th Allerton Conf. Communications, Control and Computing,  pp 480\u2013489"},{"key":"355_CR63_355","doi-asserted-by":"publisher","first-page":"724","DOI":"10.2307\/1968654","volume":"36","author":"I.J. Schoenberg","year":"1935","unstructured":"Schoenberg IJ (1935) Remarks to M. Fr\u00e9chet's article \u2018Sur la d\u00e9finition axiomatique d'une classe d'espaces vectoriels distanci\u00e9s applicables vectoriellement sur l'espace de Hilbert\u2019, Ann of Math 36:724\u2013732","journal-title":"Ann. of Math."},{"key":"355_CR64_355","unstructured":"WEB: http:\/\/orion.math.uwaterloo.ca:80\/~hwolkowi\/henry\/software\/readme.html"},{"key":"355_CR65_355","unstructured":"WEB: http:\/\/www.zib.de\/helmberg\/semidef.html"},{"key":"355_CR66_355","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1007\/BF01196124","volume":"10","author":"H.J. Woerdeman","year":"1987","unstructured":"Woerdeman HJ (1987) The lower order of lower triangular operators and minimal rank extensions. Integral Eq Operator Theory 10:859\u2013879","journal-title":"Integral Eq. Operator Theory"},{"key":"355_CR67_355","doi-asserted-by":"crossref","unstructured":"Yemini Y (1979) Some theoretical aspects of position-location problems. Proc. 20th Annual Symp. Foundations Computer Sci.,  pp 1\u20138","DOI":"10.1109\/SFCS.1979.39"}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_355","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T09:38:15Z","timestamp":1720690695000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_355"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":67,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_355","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}