{"id":"https://openalex.org/W3004479298","doi":"https://doi.org/10.1109/isit44484.2020.9174368","title":"On the Sample Complexity and Optimization Landscape for Quadratic Feasibility Problems","display_name":"On the Sample Complexity and Optimization Landscape for Quadratic Feasibility Problems","publication_year":2020,"publication_date":"2020-06-01","ids":{"openalex":"https://openalex.org/W3004479298","doi":"https://doi.org/10.1109/isit44484.2020.9174368","mag":"3004479298"},"language":"en","primary_location":{"id":"doi:10.1109/isit44484.2020.9174368","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit44484.2020.9174368","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2002.01066","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Parth K. Thaker","orcid":null},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Parth K. Thaker","raw_affiliation_strings":["Arizona State University,Electrical, Computer and Energy Engineering,Tempe,USA"],"affiliations":[{"raw_affiliation_string":"Arizona State University,Electrical, Computer and Energy Engineering,Tempe,USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Gautam Dasarathy","orcid":null},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gautam Dasarathy","raw_affiliation_strings":["Arizona State University,Electrical, Computer and Energy Engineering,Tempe,USA"],"affiliations":[{"raw_affiliation_string":"Arizona State University,Electrical, Computer and Energy Engineering,Tempe,USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"last","author":{"id":null,"display_name":"Angelia Nedi\u0107","orcid":null},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Angelia Nedi\u0107","raw_affiliation_strings":["Arizona State University,Electrical, Computer and Energy Engineering,Tempe,USA"],"affiliations":[{"raw_affiliation_string":"Arizona State University,Electrical, Computer and Energy Engineering,Tempe,USA","institution_ids":["https://openalex.org/I55732556"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I55732556"],"apc_list":null,"apc_paid":null,"fwci":0.2958,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.46787709,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1438","last_page":"1443"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/initialization","display_name":"Initialization","score":0.6635000109672546},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.6467000246047974},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5738999843597412},{"id":"https://openalex.org/keywords/restricted-isometry-property","display_name":"Restricted isometry property","score":0.5471000075340271},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.47859999537467957},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.46950000524520874},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.46540001034736633},{"id":"https://openalex.org/keywords/hermitian-matrix","display_name":"Hermitian matrix","score":0.44769999384880066},{"id":"https://openalex.org/keywords/quadratic-unconstrained-binary-optimization","display_name":"Quadratic unconstrained binary optimization","score":0.4104999899864197}],"concepts":[{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.6635000109672546},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.6467000246047974},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6162999868392944},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5738999843597412},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5546000003814697},{"id":"https://openalex.org/C17902559","wikidata":"https://www.wikidata.org/wiki/Q17099734","display_name":"Restricted isometry property","level":3,"score":0.5471000075340271},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.47859999537467957},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.46950000524520874},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.46540001034736633},{"id":"https://openalex.org/C94940","wikidata":"https://www.wikidata.org/wiki/Q652941","display_name":"Hermitian matrix","level":2,"score":0.44769999384880066},{"id":"https://openalex.org/C177179195","wikidata":"https://www.wikidata.org/wiki/Q7268372","display_name":"Quadratic unconstrained binary optimization","level":4,"score":0.4104999899864197},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39259999990463257},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.38370001316070557},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3822999894618988},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3747999966144562},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.35910001397132874},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.3449000120162964},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.3296999931335449},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.31850001215934753},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.30379998683929443},{"id":"https://openalex.org/C166437778","wikidata":"https://www.wikidata.org/wiki/Q50695","display_name":"Quadratic function","level":3,"score":0.299699991941452},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.2849999964237213},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.2840000092983246},{"id":"https://openalex.org/C61326573","wikidata":"https://www.wikidata.org/wiki/Q1496376","display_name":"Gaussian process","level":3,"score":0.2797999978065491},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.2727999985218048},{"id":"https://openalex.org/C82457910","wikidata":"https://www.wikidata.org/wiki/Q740207","display_name":"Isometry (Riemannian geometry)","level":2,"score":0.26910001039505005},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.26420000195503235},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25110000371932983}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit44484.2020.9174368","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit44484.2020.9174368","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2002.01066","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2002.01066","pdf_url":"https://arxiv.org/pdf/2002.01066","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2002.01066","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2002.01066","pdf_url":"https://arxiv.org/pdf/2002.01066","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W1995246641","https://openalex.org/W2002711323","https://openalex.org/W2005037112","https://openalex.org/W2040192961","https://openalex.org/W2049371785","https://openalex.org/W2074859470","https://openalex.org/W2074916818","https://openalex.org/W2078397124","https://openalex.org/W2108927308","https://openalex.org/W2118333298","https://openalex.org/W2140214428","https://openalex.org/W2142949395","https://openalex.org/W2200439770","https://openalex.org/W2236834722","https://openalex.org/W2283023501","https://openalex.org/W2604524164","https://openalex.org/W2606666012","https://openalex.org/W2611652301","https://openalex.org/W2744139284","https://openalex.org/W2772283936","https://openalex.org/W2797492201","https://openalex.org/W2962914151","https://openalex.org/W2963882048","https://openalex.org/W3004479298","https://openalex.org/W6638393198","https://openalex.org/W6638615092","https://openalex.org/W6639111076","https://openalex.org/W6679168169","https://openalex.org/W6695367633","https://openalex.org/W6713266246","https://openalex.org/W6713600550","https://openalex.org/W6713869322","https://openalex.org/W6734280532","https://openalex.org/W6735792551","https://openalex.org/W6735923916","https://openalex.org/W6737198670","https://openalex.org/W6740651434","https://openalex.org/W6745653240","https://openalex.org/W6745733088","https://openalex.org/W6749879446","https://openalex.org/W6756001544","https://openalex.org/W6789140773"],"related_works":[],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,39,68,69,101,104,141],"problem":[3,44,72,92],"of":[4,52,133,140],"recovering":[5],"a":[6,49,122,129,156,161,174],"complex":[7,123],"vector":[8],"x":[9],"\u2208":[10],"\u2102":[11],"<sup":[12,28,114],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[13,21,26,29,108,112,115],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n</sup>":[14],"from":[15,121],"m":[16],"quadratic":[17,36,70],"measurements":[18],"{\u3008A":[19],"<sub":[20,25,107,111],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">i</sub>":[22,109],"x,":[23],"x\u3009}":[24],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">i=1</sub>":[27,113],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">m</sup>":[30,116],".":[31],"This":[32],"problem,":[33,135],"known":[34,41],"as":[35],"feasibility,":[37],"encompasses":[38],"well":[40],"phase":[42],"retrieval":[43],"and":[45,60,95,136],"has":[46],"applications":[47],"in":[48,79,100,177],"wide":[50],"range":[51],"important":[53],"areas":[54],"including":[55],"power":[56],"system":[57],"state":[58],"estimation":[59],"x-ray":[61],"crystallography.":[62],"In":[63,83],"general,":[64],"not":[65],"only":[66],"is":[67],"feasibility":[71],"NP-hard":[73],"to":[74,153,155],"solve,":[75],"but":[76],"it":[77],"may":[78],"fact":[80],"be":[81],"unidentifiable.":[82],"this":[84,91,134],"paper,":[85],"we":[86,127],"establish":[87,137],"conditions":[88],"under":[89],"which":[90],"becomes":[93],"identifiable,":[94],"further":[96],"prove":[97],"isometry":[98],"properties":[99],"case":[102],"when":[103],"matrices":[105,119],"{A":[106],"}":[110],"are":[117],"Hermitian":[118],"sampled":[120],"Gaussian":[124],"distribution.":[125],"Moreover,":[126],"explore":[128],"nonconvex":[130],"optimization":[131,143],"formulation":[132],"salient":[138],"features":[139],"associated":[142],"landscape":[144],"that":[145],"enables":[146],"gradient":[147],"algorithms":[148],"with":[149,160],"an":[150],"arbitrary":[151],"initialization":[152],"converge":[154],"globally":[157],"optimal":[158],"point":[159],"high":[162],"probability.":[163],"Our":[164],"results":[165],"also":[166],"reveal":[167],"sample":[168],"complexity":[169],"requirements":[170],"for":[171],"successfully":[172],"identifying":[173],"feasible":[175],"solution":[176],"these":[178],"contexts.":[179]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2020-02-14T00:00:00"}