{"id":"https://openalex.org/W2896701864","doi":"https://doi.org/10.1007/s12532-019-00168-0","title":"Robust Euclidean embedding via EDM optimization","display_name":"Robust Euclidean embedding via EDM optimization","publication_year":2019,"publication_date":"2019-08-09","ids":{"openalex":"https://openalex.org/W2896701864","doi":"https://doi.org/10.1007/s12532-019-00168-0","mag":"2896701864"},"language":"en","primary_location":{"id":"doi:10.1007/s12532-019-00168-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s12532-019-00168-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s12532-019-00168-0.pdf","source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s12532-019-00168-0.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023017250","display_name":"Shenglong Zhou","orcid":"https://orcid.org/0000-0003-2843-1614"},"institutions":[{"id":"https://openalex.org/I43439940","display_name":"University of Southampton","ror":"https://ror.org/01ryk1543","country_code":"GB","type":"education","lineage":["https://openalex.org/I43439940"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Shenglong Zhou","raw_affiliation_strings":["School of Mathematical Sciences, University of Southampton, Southampton, SO17 1BJ, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematical Sciences, University of Southampton, Southampton, SO17 1BJ, UK","institution_ids":["https://openalex.org/I43439940"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071551240","display_name":"Naihua Xiu","orcid":"https://orcid.org/0000-0002-3129-2005"},"institutions":[{"id":"https://openalex.org/I21193070","display_name":"Beijing Jiaotong University","ror":"https://ror.org/01yj56c84","country_code":"CN","type":"education","lineage":["https://openalex.org/I21193070"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Naihua Xiu","raw_affiliation_strings":["Department of Applied Mathematics, Beijing Jiaotong University, Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Mathematics, Beijing Jiaotong University, Beijing, China","institution_ids":["https://openalex.org/I21193070"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112621269","display_name":"Houduo Qi","orcid":"https://orcid.org/0000-0003-3481-4814"},"institutions":[{"id":"https://openalex.org/I43439940","display_name":"University of Southampton","ror":"https://ror.org/01ryk1543","country_code":"GB","type":"education","lineage":["https://openalex.org/I43439940"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Hou-Duo Qi","raw_affiliation_strings":["School of Mathematical Sciences, University of Southampton, Southampton, SO17 1BJ, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematical Sciences, University of Southampton, Southampton, SO17 1BJ, UK","institution_ids":["https://openalex.org/I43439940"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5112621269"],"corresponding_institution_ids":["https://openalex.org/I43439940"],"apc_list":{"value":2390,"currency":"EUR","value_usd":3090},"apc_paid":{"value":2390,"currency":"EUR","value_usd":3090},"fwci":1.1653,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":{"value":0.75132539,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"12","issue":"3","first_page":"337","last_page":"387"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11447","display_name":"Blind Source Separation Techniques","score":0.9700000286102295,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10057","display_name":"Face and Expression Recognition","score":0.9624000191688538,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.723544716835022},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.7068250179290771},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.658928632736206},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.6397885680198669},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5997786521911621},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5626567006111145},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5306094288825989},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5114444494247437},{"id":"https://openalex.org/keywords/stationary-point","display_name":"Stationary point","score":0.5019040107727051},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.4962168335914612},{"id":"https://openalex.org/keywords/euclidean-distance-matrix","display_name":"Euclidean distance matrix","score":0.48718899488449097},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.48348909616470337},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4656200110912323},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.46441975235939026},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.44095396995544434},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36447203159332275},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3530493378639221},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.35105857253074646},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12875506281852722},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.12603595852851868},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09467288851737976}],"concepts":[{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.723544716835022},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.7068250179290771},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.658928632736206},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.6397885680198669},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5997786521911621},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5626567006111145},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5306094288825989},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5114444494247437},{"id":"https://openalex.org/C189237950","wikidata":"https://www.wikidata.org/wiki/Q2500758","display_name":"Stationary point","level":2,"score":0.5019040107727051},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4962168335914612},{"id":"https://openalex.org/C171558263","wikidata":"https://www.wikidata.org/wiki/Q5406122","display_name":"Euclidean distance matrix","level":3,"score":0.48718899488449097},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.48348909616470337},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4656200110912323},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.46441975235939026},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.44095396995544434},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36447203159332275},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3530493378639221},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.35105857253074646},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12875506281852722},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.12603595852851868},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09467288851737976},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s12532-019-00168-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s12532-019-00168-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s12532-019-00168-0.pdf","source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming Computation","raw_type":"journal-article"},{"id":"pmh:oai:eprints.soton.ac.uk:420991","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306401019","display_name":"ePrints Soton (University of Southampton)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I43439940","host_organization_name":"University of Southampton","host_organization_lineage":["https://openalex.org/I43439940"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Monograph"}],"best_oa_location":{"id":"doi:10.1007/s12532-019-00168-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s12532-019-00168-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s12532-019-00168-0.pdf","source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2949","issn":["1867-2949","1867-2957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming Computation","raw_type":"journal-article"},"sustainable_development_goals":[{"score":0.44999998807907104,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G2168199681","display_name":null,"funder_award_id":"11728101","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320277","display_name":"University of Southampton","ror":"https://ror.org/01ryk1543"},{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2896701864.pdf","grobid_xml":"https://content.openalex.org/works/W2896701864.grobid-xml"},"referenced_works_count":57,"referenced_works":["https://openalex.org/W68366368","https://openalex.org/W137370778","https://openalex.org/W1635564822","https://openalex.org/W1820840969","https://openalex.org/W1964922595","https://openalex.org/W1970503897","https://openalex.org/W1973192023","https://openalex.org/W1987314831","https://openalex.org/W1990908167","https://openalex.org/W1993436046","https://openalex.org/W1999597013","https://openalex.org/W2000389722","https://openalex.org/W2001141328","https://openalex.org/W2007304358","https://openalex.org/W2037261607","https://openalex.org/W2039402388","https://openalex.org/W2046272803","https://openalex.org/W2056201402","https://openalex.org/W2061681393","https://openalex.org/W2065569293","https://openalex.org/W2067752346","https://openalex.org/W2073887222","https://openalex.org/W2085013758","https://openalex.org/W2086342204","https://openalex.org/W2087382696","https://openalex.org/W2095172966","https://openalex.org/W2099918640","https://openalex.org/W2100456966","https://openalex.org/W2104371487","https://openalex.org/W2121408477","https://openalex.org/W2130479394","https://openalex.org/W2146281661","https://openalex.org/W2147191758","https://openalex.org/W2156678892","https://openalex.org/W2156865565","https://openalex.org/W2163392119","https://openalex.org/W2164916373","https://openalex.org/W2169065610","https://openalex.org/W2170042322","https://openalex.org/W2172219851","https://openalex.org/W2279366020","https://openalex.org/W2327230547","https://openalex.org/W2376603351","https://openalex.org/W2383560209","https://openalex.org/W2405272596","https://openalex.org/W2508393166","https://openalex.org/W2547406430","https://openalex.org/W2588599464","https://openalex.org/W2809824420","https://openalex.org/W2963244596","https://openalex.org/W2963784016","https://openalex.org/W3029645440","https://openalex.org/W4244829582","https://openalex.org/W4252316495","https://openalex.org/W4255617862","https://openalex.org/W4301014524","https://openalex.org/W6637050512"],"related_works":["https://openalex.org/W4294328694","https://openalex.org/W2908582041","https://openalex.org/W2389652943","https://openalex.org/W2129888254","https://openalex.org/W4229699757","https://openalex.org/W2033213447","https://openalex.org/W2369008545","https://openalex.org/W2085867756","https://openalex.org/W1638832135","https://openalex.org/W2026338131"],"abstract_inverted_index":{"This":[0],"paper":[1],"aims":[2],"to":[3,33,68,132],"propose":[4,78],"an":[5,113,141],"efficient":[6,114],"numerical":[7],"method":[8,72],"for":[9,58,73],"the":[10,16,22,46,64,91,98,148],"most":[11],"challenging":[12],"problem":[13,29,93],"known":[14,32],"as":[15,117],"robust":[17],"Euclidean":[18,52],"embedding":[19],"(REE)":[20],"in":[21,63,112],"family":[23],"of":[24,61,136,145,150,167],"multi-dimensional":[25],"scaling":[26],"(MDS).":[27],"The":[28],"is":[30,40,94,101,139,152],"notoriously":[31],"be":[34,85],"nonsmooth,":[35],"nonconvex":[36],"and":[37,51,160,174],"its":[38],"objective":[39],"non-Lipschitzian.":[41],"We":[42,76,88,125],"first":[43],"explain":[44],"that":[45,90,97,129],"semidefinite":[47],"programming":[48],"(SDP)":[49],"relaxations":[50],"distance":[53],"matrix":[54],"(EDM)":[55],"approach,":[56],"popular":[57],"other":[59],"types":[60],"problems":[62,169],"MDS":[65],"family,":[66],"failed":[67],"provide":[69],"a":[70,79,108,133,164],"viable":[71],"this":[74],"problem.":[75],"then":[77],"penalized":[80],"REE":[81,121],"(PREE),":[82],"which":[83,138],"can":[84],"economically":[86],"majorized.":[87],"show":[89],"majorized":[92],"convex":[95],"provided":[96],"penalty":[99],"parameter":[100],"above":[102],"certain":[103],"threshold.":[104],"Moreover,":[105],"it":[106],"has":[107],"closed-form":[109],"solution,":[110],"resulting":[111],"algorithm":[115],"dubbed":[116],"PREEEDM":[118,130,151],"(for":[119],"Penalized":[120],"via":[122],"EDM":[123,161],"optimization).":[124],"prove":[126],"among":[127],"others":[128],"converges":[131],"stationary":[134],"point":[135,144],"PREE,":[137],"also":[140],"approximate":[142],"critical":[143],"REE.":[146],"Finally,":[147],"efficiency":[149],"compared":[153],"with":[154],"several":[155],"state-of-the-art":[156],"methods":[157],"including":[158],"SDP":[159],"solvers":[162],"on":[163],"large":[165],"number":[166],"test":[168],"from":[170],"sensor":[171],"network":[172],"localization":[173],"molecular":[175],"conformation.":[176]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2026-06-19T15:47:20.252518","created_date":"2025-10-10T00:00:00"}