{"id":"https://openalex.org/W2885730995","doi":"https://doi.org/10.1109/isit.2018.8437535","title":"Fast Low-Rank Matrix Estimation for Ill-Conditioned Matrices","display_name":"Fast Low-Rank Matrix Estimation for Ill-Conditioned Matrices","publication_year":2018,"publication_date":"2018-06-01","ids":{"openalex":"https://openalex.org/W2885730995","doi":"https://doi.org/10.1109/isit.2018.8437535","mag":"2885730995"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2018.8437535","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437535","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Symposium on Information Theory (ISIT)","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/A5102925408","display_name":"Mohammadreza Soltani","orcid":"https://orcid.org/0000-0003-4217-9224"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mohammadreza Soltani","raw_affiliation_strings":["Iowa State University"],"affiliations":[{"raw_affiliation_string":"Iowa State University","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066142047","display_name":"Chinmay Hegde","orcid":"https://orcid.org/0000-0003-4574-8066"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chinmay Hegde","raw_affiliation_strings":["Iowa State University"],"affiliations":[{"raw_affiliation_string":"Iowa State University","institution_ids":["https://openalex.org/I173911158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102925408"],"corresponding_institution_ids":["https://openalex.org/I173911158"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08390878,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"abs 1411 3406","issue":null,"first_page":"371","last_page":"375"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":1.0,"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":1.0,"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.9962000250816345,"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/T10931","display_name":"Direction-of-Arrival Estimation Techniques","score":0.9782999753952026,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.6199654936790466},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5809316635131836},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.5141587257385254},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5024144649505615},{"id":"https://openalex.org/keywords/matrix-completion","display_name":"Matrix completion","score":0.5015473365783691},{"id":"https://openalex.org/keywords/singular-value","display_name":"Singular value","score":0.4745928943157196},{"id":"https://openalex.org/keywords/singular-value-decomposition","display_name":"Singular value decomposition","score":0.4734760522842407},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4562358856201172},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45266398787498474},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4440816044807434},{"id":"https://openalex.org/keywords/low-rank-approximation","display_name":"Low-rank approximation","score":0.44369739294052124},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.440170556306839},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4211367964744568},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4116784930229187},{"id":"https://openalex.org/keywords/affine-transformation","display_name":"Affine transformation","score":0.4115893542766571},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.41046595573425293},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4001584053039551},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08881261944770813}],"concepts":[{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.6199654936790466},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5809316635131836},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.5141587257385254},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5024144649505615},{"id":"https://openalex.org/C2778459887","wikidata":"https://www.wikidata.org/wiki/Q6787865","display_name":"Matrix completion","level":3,"score":0.5015473365783691},{"id":"https://openalex.org/C109282560","wikidata":"https://www.wikidata.org/wiki/Q4166054","display_name":"Singular value","level":3,"score":0.4745928943157196},{"id":"https://openalex.org/C22789450","wikidata":"https://www.wikidata.org/wiki/Q420904","display_name":"Singular value decomposition","level":2,"score":0.4734760522842407},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4562358856201172},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45266398787498474},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4440816044807434},{"id":"https://openalex.org/C90199385","wikidata":"https://www.wikidata.org/wiki/Q6692777","display_name":"Low-rank approximation","level":3,"score":0.44369739294052124},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.440170556306839},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4211367964744568},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4116784930229187},{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.4115893542766571},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.41046595573425293},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4001584053039551},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08881261944770813},{"id":"https://openalex.org/C25023664","wikidata":"https://www.wikidata.org/wiki/Q1575637","display_name":"Hankel matrix","level":2,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.0},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2018.8437535","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2018.8437535","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":57,"referenced_works":["https://openalex.org/W1573301526","https://openalex.org/W1836708065","https://openalex.org/W1871489475","https://openalex.org/W1884015253","https://openalex.org/W2097596242","https://openalex.org/W2100897755","https://openalex.org/W2106037979","https://openalex.org/W2116600879","https://openalex.org/W2116680824","https://openalex.org/W2118550318","https://openalex.org/W2143075842","https://openalex.org/W2145962650","https://openalex.org/W2151825876","https://openalex.org/W2163224677","https://openalex.org/W2164616133","https://openalex.org/W2171623021","https://openalex.org/W2206289079","https://openalex.org/W2268674159","https://openalex.org/W2345561455","https://openalex.org/W2487980609","https://openalex.org/W2554489331","https://openalex.org/W2557168633","https://openalex.org/W2585305991","https://openalex.org/W2611328865","https://openalex.org/W2774799892","https://openalex.org/W2798291370","https://openalex.org/W2950190315","https://openalex.org/W2952160444","https://openalex.org/W2962833660","https://openalex.org/W2962975464","https://openalex.org/W2963015408","https://openalex.org/W2963099043","https://openalex.org/W2963130606","https://openalex.org/W2963166399","https://openalex.org/W2963443408","https://openalex.org/W2963759574","https://openalex.org/W2964198102","https://openalex.org/W4206519735","https://openalex.org/W4250224698","https://openalex.org/W4297776040","https://openalex.org/W4297785630","https://openalex.org/W4298263336","https://openalex.org/W6634173106","https://openalex.org/W6638615092","https://openalex.org/W6639384702","https://openalex.org/W6675083050","https://openalex.org/W6675840925","https://openalex.org/W6677276404","https://openalex.org/W6681017033","https://openalex.org/W6682550672","https://openalex.org/W6683110664","https://openalex.org/W6684103851","https://openalex.org/W6685292845","https://openalex.org/W6685688796","https://openalex.org/W6688433028","https://openalex.org/W6731724206","https://openalex.org/W6750531877"],"related_works":["https://openalex.org/W2952489973","https://openalex.org/W2106005123","https://openalex.org/W4300776969","https://openalex.org/W3103289951","https://openalex.org/W2266965707","https://openalex.org/W2108753466","https://openalex.org/W2084983808","https://openalex.org/W2906317811","https://openalex.org/W4318564253","https://openalex.org/W2994409951"],"abstract_inverted_index":{"We":[0,93,136],"study":[1],"the":[2,47,61,65,78,98,113,129],"general":[3],"problem":[4,19],"of":[5,10,42,64,80,121],"optimizing":[6],"a":[7,11,72],"convex":[8],"function":[9],"matrix-valued":[12],"variable":[13],"subject":[14],"to":[15,36],"low-rank":[16],"constraints.":[17],"This":[18],"has":[20],"attracted":[21],"significant":[22],"attention;":[23],"however,":[24],"existing":[25],"first-order":[26],"methods":[27],"for":[28,97,133],"solving":[29],"such":[30],"problems":[31],"either":[32],"are":[33],"too":[34],"slow":[35],"converge,":[37],"or":[38],"require":[39,57],"multiple":[40],"invocations":[41],"singular":[43],"value":[44],"decompositions.":[45],"On":[46],"other":[48],"hand,":[49],"factorization-based":[50],"non-convex":[51],"algorithms,":[52],"while":[53,88],"being":[54],"much":[55],"faster,":[56],"stringent":[58],"assumptions":[59],"on":[60,112],"condition":[62],"number":[63],"optimum.":[66],"In":[67],"this":[68,106],"paper,":[69],"we":[70,108],"provide":[71],"novel":[73],"algorithmic":[74],"framework":[75,96],"that":[76,126],"achieves":[77,128],"best":[79,130],"both":[81,134],"worlds:":[82],"as":[83,85,116,118],"fast":[84],"factorization":[86],"methods,":[87],"requiring":[89],"no":[90],"spectral":[91],"assumptions.":[92],"instantiate":[94],"our":[95,122,139],"nonlinear":[99],"affine":[100],"rank":[101],"minimization":[102],"(NLARM)":[103],"problem.":[104],"For":[105],"problem,":[107],"derive":[109],"explicit":[110],"bounds":[111,132],"sample":[114],"complexity":[115],"well":[117],"running":[119],"time":[120],"approach,":[123],"and":[124],"show":[125],"it":[127],"possible":[131],"cases.":[135],"also":[137],"support":[138],"proposed":[140],"algorithm":[141],"via":[142],"several":[143],"experimental":[144],"results.":[145]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}