{"id":"https://openalex.org/W4375869035","doi":"https://doi.org/10.1109/icassp49357.2023.10095559","title":"Element Selection with Wide Class of Optimization Criteria Using Non-Convex Sparse Optimization","display_name":"Element Selection with Wide Class of Optimization Criteria Using Non-Convex Sparse Optimization","publication_year":2023,"publication_date":"2023-05-05","ids":{"openalex":"https://openalex.org/W4375869035","doi":"https://doi.org/10.1109/icassp49357.2023.10095559"},"language":"en","primary_location":{"id":"doi:10.1109/icassp49357.2023.10095559","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/icassp49357.2023.10095559","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5018743094","display_name":"Taiga Kawamura","orcid":"https://orcid.org/0009-0008-3584-7822"},"institutions":[{"id":"https://openalex.org/I69740276","display_name":"Tokyo Metropolitan University","ror":"https://ror.org/00ws30h19","country_code":"JP","type":"education","lineage":["https://openalex.org/I69740276"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Taiga Kawamura","raw_affiliation_strings":["Graduate School of Systems Design,Tokyo Metropolitan University,Tokyo,Japan,191-0065"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Systems Design,Tokyo Metropolitan University,Tokyo,Japan,191-0065","institution_ids":["https://openalex.org/I69740276"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064535049","display_name":"Natsuki Ueno","orcid":"https://orcid.org/0000-0002-5906-563X"},"institutions":[{"id":"https://openalex.org/I69740276","display_name":"Tokyo Metropolitan University","ror":"https://ror.org/00ws30h19","country_code":"JP","type":"education","lineage":["https://openalex.org/I69740276"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Natsuki Ueno","raw_affiliation_strings":["Graduate School of Systems Design,Tokyo Metropolitan University,Tokyo,Japan,191-0065"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Systems Design,Tokyo Metropolitan University,Tokyo,Japan,191-0065","institution_ids":["https://openalex.org/I69740276"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056281759","display_name":"Nobutaka Ono","orcid":"https://orcid.org/0000-0003-4242-2773"},"institutions":[{"id":"https://openalex.org/I69740276","display_name":"Tokyo Metropolitan University","ror":"https://ror.org/00ws30h19","country_code":"JP","type":"education","lineage":["https://openalex.org/I69740276"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Nobutaka Ono","raw_affiliation_strings":["Graduate School of Systems Design,Tokyo Metropolitan University,Tokyo,Japan,191-0065"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Systems Design,Tokyo Metropolitan University,Tokyo,Japan,191-0065","institution_ids":["https://openalex.org/I69740276"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I69740276"],"apc_list":null,"apc_paid":null,"fwci":0.3739,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.61724831,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"16","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.9998999834060669,"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.9998999834060669,"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/T12879","display_name":"Distributed Sensor Networks and Detection Algorithms","score":0.9947999715805054,"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"}},{"id":"https://openalex.org/T10931","display_name":"Direction-of-Arrival Estimation Techniques","score":0.9908999800682068,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.6396362781524658},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5626919269561768},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5537409782409668},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5436069965362549},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5240086317062378},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4909382164478302},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.48140406608581543},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4436133801937103},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.413407564163208},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.32128840684890747},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.312314510345459},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2256620228290558}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6396362781524658},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5626919269561768},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5537409782409668},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5436069965362549},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5240086317062378},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4909382164478302},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.48140406608581543},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4436133801937103},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.413407564163208},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.32128840684890747},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.312314510345459},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2256620228290558},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"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":1,"locations":[{"id":"doi:10.1109/icassp49357.2023.10095559","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/icassp49357.2023.10095559","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ICASSP 2023 - 2023 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":21,"referenced_works":["https://openalex.org/W1977901803","https://openalex.org/W2004026774","https://openalex.org/W2007969648","https://openalex.org/W2045079045","https://openalex.org/W2046033161","https://openalex.org/W2058532290","https://openalex.org/W2112796928","https://openalex.org/W2128728535","https://openalex.org/W2169207653","https://openalex.org/W2222562092","https://openalex.org/W2294798173","https://openalex.org/W2418010766","https://openalex.org/W3007031763","https://openalex.org/W3093094851","https://openalex.org/W3131801167","https://openalex.org/W4206357553","https://openalex.org/W4214867409","https://openalex.org/W4244393449","https://openalex.org/W4292363360","https://openalex.org/W4297817021","https://openalex.org/W6686785280"],"related_works":["https://openalex.org/W3153752017","https://openalex.org/W2756132392","https://openalex.org/W3035814349","https://openalex.org/W4285101096","https://openalex.org/W4320477335","https://openalex.org/W2518949622","https://openalex.org/W4382725876","https://openalex.org/W2084892497","https://openalex.org/W2115614142","https://openalex.org/W2275184629"],"abstract_inverted_index":{"Element":[0],"selection":[1,18,65,107,129],"techniques":[2],"for":[3,127],"high-dimensional":[4],"features":[5],"have":[6],"various":[7],"applications":[8],"in":[9],"machine":[10],"learning.":[11],"In":[12,86],"general,":[13],"the":[14,44,47,52,87,94,105,121,124,137],"problem":[15,108],"of":[16,39,46,80,98,123],"element":[17,64,106,128],"is":[19,101],"typically":[20],"solved":[21],"by":[22,103],"greedy":[23,139],"methods":[24],"or":[25],"convex":[26],"relaxation":[27],"methods.":[28],"However,":[29],"these":[30],"algorithms":[31],"are":[32],"applicable":[33],"to":[34],"only":[35],"a":[36,77,110,114,131],"specific":[37],"class":[38,79],"optimization":[40,71,81,112],"criteria":[41,82],"such":[42],"as":[43,109],"minimization":[45],"squared":[48],"error":[49,133],"loss":[50,134],"between":[51],"original":[53],"and":[54],"restored":[55],"data.":[56],"To":[57],"overcome":[58],"this":[59],"limitation,":[60],"we":[61],"propose":[62],"an":[63,90],"algorithm":[66,91],"based":[67,92],"on":[68,93,113],"non-convex":[69,115],"sparse":[70],"that":[72],"can":[73],"be":[74],"used":[75],"with":[76,130,136],"wider":[78],"than":[83],"conventional":[84,138],"algorithms.":[85],"proposed":[88,125],"method,":[89],"alternating":[95],"direction":[96],"method":[97,126],"multipliers":[99],"(ADMM)":[100],"de-rived":[102],"reformulating":[104],"matrix":[111],"set.":[116],"A":[117],"numerical":[118],"experiment":[119],"demonstrated":[120],"effectiveness":[122],"non-squared":[132],"compared":[135],"method.":[140]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}