{"id":"https://openalex.org/W2797492201","doi":"https://doi.org/10.1109/icassp.2018.8461868","title":"The Landscape of Non-Convex Quadratic Feasibility","display_name":"The Landscape of Non-Convex Quadratic Feasibility","publication_year":2018,"publication_date":"2018-04-01","ids":{"openalex":"https://openalex.org/W2797492201","doi":"https://doi.org/10.1109/icassp.2018.8461868","mag":"2797492201"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.2018.8461868","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2018.8461868","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036699573","display_name":"Amanda Bower","orcid":"https://orcid.org/0000-0002-4497-3088"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Amanda Bower","raw_affiliation_strings":["Department of Mathematics, University of Michigan"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Michigan","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083730924","display_name":"Lalit Jain","orcid":"https://orcid.org/0000-0002-1087-724X"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lalit Jain","raw_affiliation_strings":["Department of Mathematics, University of Michigan"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Michigan","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029521003","display_name":"Laura Balzano","orcid":"https://orcid.org/0000-0003-2914-123X"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan\u2013Ann Arbor","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Laura Balzano","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, University of Michigan"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, University of Michigan","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5036699573"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":0.4887,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.7173021,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"37","issue":null,"first_page":"3974","last_page":"3978"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.998199999332428,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9909999966621399,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.6616344451904297},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.632239580154419},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.6031493544578552},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5830726027488708},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5187999606132507},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.5062293410301208},{"id":"https://openalex.org/keywords/descent","display_name":"Descent (aeronautics)","score":0.494764506816864},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4936719834804535},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4892151355743408},{"id":"https://openalex.org/keywords/stochastic-gradient-descent","display_name":"Stochastic gradient descent","score":0.488238126039505},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.47501978278160095},{"id":"https://openalex.org/keywords/homogeneous","display_name":"Homogeneous","score":0.47359612584114075},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.45994633436203003},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.45499497652053833},{"id":"https://openalex.org/keywords/global-optimization","display_name":"Global optimization","score":0.45410025119781494},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.4249204099178314},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40799733996391296},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3443151116371155},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20234832167625427},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.14504283666610718},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07172289490699768}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6616344451904297},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.632239580154419},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.6031493544578552},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5830726027488708},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5187999606132507},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.5062293410301208},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.494764506816864},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4936719834804535},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4892151355743408},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.488238126039505},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.47501978278160095},{"id":"https://openalex.org/C66882249","wikidata":"https://www.wikidata.org/wiki/Q169336","display_name":"Homogeneous","level":2,"score":0.47359612584114075},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.45994633436203003},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.45499497652053833},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.45410025119781494},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.4249204099178314},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40799733996391296},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3443151116371155},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20234832167625427},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.14504283666610718},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07172289490699768},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icassp.2018.8461868","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2018.8461868","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W68180256","https://openalex.org/W85455704","https://openalex.org/W643977996","https://openalex.org/W1707761945","https://openalex.org/W1968265719","https://openalex.org/W1973192023","https://openalex.org/W2169371330","https://openalex.org/W2396019715","https://openalex.org/W2474090883","https://openalex.org/W2474122884","https://openalex.org/W2601087514","https://openalex.org/W2744139284","https://openalex.org/W2962811491","https://openalex.org/W2963461500","https://openalex.org/W2964156132","https://openalex.org/W4298393077","https://openalex.org/W6602719836","https://openalex.org/W6603418435","https://openalex.org/W6621127684","https://openalex.org/W6717724730"],"related_works":["https://openalex.org/W2357193936","https://openalex.org/W2364127131","https://openalex.org/W1985181089","https://openalex.org/W1909324310","https://openalex.org/W4293088966","https://openalex.org/W1989828432","https://openalex.org/W2352839224","https://openalex.org/W2150023909","https://openalex.org/W4250818594","https://openalex.org/W2045625580"],"abstract_inverted_index":{"Motivated":[0],"by":[1,81,93],"applications":[2],"such":[3],"as":[4,15],"ordinal":[5],"embedding":[6],"and":[7,30,60],"collaborative":[8],"ranking,":[9],"we":[10,49,75],"formulate":[11],"homogeneous":[12],"quadratic":[13,44],"feasibility":[14],"an":[16],"unconstrained,":[17],"non-convex":[18,35],"minimization":[19],"problem.":[20],"Our":[21],"work":[22],"aims":[23],"to":[24,39],"understand":[25],"the":[26,34,83],"landscape":[27],"(local":[28],"minimizers":[29,56],"global":[31,72],"minimizers)":[32],"of":[33,57],"objective,":[36],"which":[37],"corresponds":[38],"hinge":[40],"losses":[41],"arising":[42],"from":[43],"constraints.":[45],"Under":[46],"certain":[47],"assumptions,":[48],"give":[50],"necessary":[51],"conditions":[52],"for":[53],"non-global,":[54],"local":[55,68],"our":[58],"objective":[59],"additionally":[61],"show":[62],"that":[63,77],"in":[64],"two":[65],"dimensions,":[66],"every":[67],"minimizer":[69],"is":[70],"a":[71],"minimizer.":[73],"Empirically,":[74],"demonstrate":[76],"finding":[78],"feasible":[79],"points":[80],"solving":[82],"unconstrained":[84],"optimization":[85],"problem":[86],"with":[87],"stochastic":[88],"gradient":[89],"descent":[90],"works":[91],"reliably":[92],"utilizing":[94],"large":[95],"initializations.":[96]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}