{"id":"https://openalex.org/W3035014064","doi":"https://doi.org/10.1109/sam48682.2020.9104264","title":"Greedy coordinate descent method on non-negative quadratic programming","display_name":"Greedy coordinate descent method on non-negative quadratic programming","publication_year":2020,"publication_date":"2020-06-01","ids":{"openalex":"https://openalex.org/W3035014064","doi":"https://doi.org/10.1109/sam48682.2020.9104264","mag":"3035014064"},"language":"en","primary_location":{"id":"doi:10.1109/sam48682.2020.9104264","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sam48682.2020.9104264","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE 11th Sensor Array and Multichannel Signal Processing Workshop (SAM)","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2012.05943","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Chenyu Wu","orcid":null},"institutions":[{"id":"https://openalex.org/I165799507","display_name":"Rensselaer Polytechnic Institute","ror":"https://ror.org/01rtyzb94","country_code":"US","type":"education","lineage":["https://openalex.org/I165799507"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Chenyu Wu","raw_affiliation_strings":["Department of Mathematical Sciences, Rensselaer Polytechnic Institute, Troy, NY, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Rensselaer Polytechnic Institute, Troy, NY, USA","institution_ids":["https://openalex.org/I165799507"]}]},{"author_position":"last","author":{"id":null,"display_name":"Yangyang Xu","orcid":null},"institutions":[{"id":"https://openalex.org/I165799507","display_name":"Rensselaer Polytechnic Institute","ror":"https://ror.org/01rtyzb94","country_code":"US","type":"education","lineage":["https://openalex.org/I165799507"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yangyang Xu","raw_affiliation_strings":["Department of Mathematical Sciences, Rensselaer Polytechnic Institute, Troy, NY, USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Rensselaer Polytechnic Institute, Troy, NY, USA","institution_ids":["https://openalex.org/I165799507"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I165799507"],"apc_list":null,"apc_paid":null,"fwci":0.1794,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.45329781,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"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.9998000264167786,"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.9998000264167786,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9976000189781189,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9966999888420105,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.7285000085830688},{"id":"https://openalex.org/keywords/coordinate-descent","display_name":"Coordinate descent","score":0.6866999864578247},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6664000153541565},{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.6653000116348267},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5636000037193298},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5325999855995178},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5302000045776367},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4909999966621399},{"id":"https://openalex.org/keywords/descent","display_name":"Descent (aeronautics)","score":0.4733999967575073}],"concepts":[{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.7285000085830688},{"id":"https://openalex.org/C157553263","wikidata":"https://www.wikidata.org/wiki/Q5168004","display_name":"Coordinate descent","level":2,"score":0.6866999864578247},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6664000153541565},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.6653000116348267},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5636000037193298},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5616999864578247},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5325999855995178},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5302000045776367},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5253000259399414},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4909999966621399},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.4733999967575073},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.46369999647140503},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.45179998874664307},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4372999966144562},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.38089999556541443},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3449000120162964},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.33009999990463257},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.32499998807907104},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.3140999972820282},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.29319998621940613},{"id":"https://openalex.org/C60810621","wikidata":"https://www.wikidata.org/wiki/Q2333568","display_name":"Optimal substructure","level":3,"score":0.29280000925064087},{"id":"https://openalex.org/C2983524802","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic model","level":3,"score":0.29269999265670776},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.28769999742507935},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.27489998936653137},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.27390000224113464},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.26649999618530273},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.25949999690055847},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.257999986410141},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2542000114917755}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/sam48682.2020.9104264","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sam48682.2020.9104264","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE 11th Sensor Array and Multichannel Signal Processing Workshop (SAM)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2012.05943","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2012.05943","pdf_url":"https://arxiv.org/pdf/2012.05943","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:2012.05943","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2012.05943","pdf_url":"https://arxiv.org/pdf/2012.05943","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":40,"referenced_works":["https://openalex.org/W1499137793","https://openalex.org/W1540764732","https://openalex.org/W1902027874","https://openalex.org/W1968154520","https://openalex.org/W1975768153","https://openalex.org/W2000769684","https://openalex.org/W2013850411","https://openalex.org/W2022393739","https://openalex.org/W2039050532","https://openalex.org/W2050968963","https://openalex.org/W2059745395","https://openalex.org/W2062770263","https://openalex.org/W2079482358","https://openalex.org/W2082639035","https://openalex.org/W2095984592","https://openalex.org/W2100556411","https://openalex.org/W2117686388","https://openalex.org/W2120816706","https://openalex.org/W2126381689","https://openalex.org/W2144920235","https://openalex.org/W2157570139","https://openalex.org/W2226862355","https://openalex.org/W2787198218","https://openalex.org/W2894185619","https://openalex.org/W2963264932","https://openalex.org/W2963419911","https://openalex.org/W2963648037","https://openalex.org/W2964013670","https://openalex.org/W2969771825","https://openalex.org/W2979298859","https://openalex.org/W3103793615","https://openalex.org/W6622974104","https://openalex.org/W6639343031","https://openalex.org/W6677553319","https://openalex.org/W6677659438","https://openalex.org/W6677759377","https://openalex.org/W6728443872","https://openalex.org/W6752210135","https://openalex.org/W6775196860","https://openalex.org/W6775638715"],"related_works":[],"abstract_inverted_index":{"The":[0,40],"coordinate":[1],"descent":[2],"(CD)":[3],"method":[4],"has":[5,44],"recently":[6],"become":[7],"popular":[8],"for":[9],"solving":[10,35],"very":[11],"large-scale":[12],"problems,":[13],"partly":[14],"due":[15],"to":[16,90],"its":[17,51],"simple":[18],"update,":[19],"low":[20],"memory":[21],"requirement,":[22],"and":[23,53,95,113],"fast":[24],"convergence.":[25],"In":[26],"this":[27],"paper,":[28],"we":[29],"explore":[30],"the":[31,58,65,70,83,96],"greedy":[32,41,71,85],"CD":[33,42,72,86],"on":[34,57,103,108],"non-negative":[36,97],"quadratic":[37],"programming":[38],"(NQP).":[39],"generally":[43],"much":[45],"more":[46],"expensive":[47],"per-update":[48,67],"complexity":[49],"than":[50],"cyclic":[52],"randomized":[54],"counterparts.":[55],"However,":[56],"NQP,":[59],"these":[60],"three":[61],"CDs":[62],"have":[63,74],"almost":[64],"same":[66],"cost,":[68],"while":[69],"can":[73],"significantly":[75],"faster":[76],"overall":[77],"convergence":[78],"speed.":[79],"We":[80],"also":[81,114],"apply":[82],"proposed":[84],"as":[87],"a":[88],"subroutine":[89],"solve":[91],"linearly":[92],"constrained":[93],"NQP":[94],"matrix":[98],"factorization.":[99],"Promising":[100],"numerical":[101],"results":[102],"both":[104],"problems":[105],"are":[106],"observed":[107],"instances":[109],"with":[110],"synthetic":[111],"data":[112],"image":[115],"data.":[116]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2020-06-19T00:00:00"}