{"id":"https://openalex.org/W7138987437","doi":"https://doi.org/10.1109/globecom59602.2025.11432696","title":"Primal Decomposition Methods and Algorithms for Nonconvex Problems with Applications in Optimal Zero-Forcing Transmit and Receive Beamforming","display_name":"Primal Decomposition Methods and Algorithms for Nonconvex Problems with Applications in Optimal Zero-Forcing Transmit and Receive Beamforming","publication_year":2025,"publication_date":"2025-12-08","ids":{"openalex":"https://openalex.org/W7138987437","doi":"https://doi.org/10.1109/globecom59602.2025.11432696"},"language":"en","primary_location":{"id":"doi:10.1109/globecom59602.2025.11432696","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globecom59602.2025.11432696","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM 2025 - 2025 IEEE Global Communications Conference","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/A5114124805","display_name":"yiqing zhai","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yiqing Zhai","raw_affiliation_strings":["The Hong Kong University of Science and Technology,Guangzhou"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Hong Kong University of Science and Technology,Guangzhou","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129950989","display_name":"Ying Cui","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ying Cui","raw_affiliation_strings":["The Hong Kong University of Science and Technology,Guangzhou"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Hong Kong University of Science and Technology,Guangzhou","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5122030994","display_name":"Danny H. K. Tsang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Danny H. K. Tsang","raw_affiliation_strings":["The Hong Kong University of Science and Technology,Guangzhou"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Hong Kong University of Science and Technology,Guangzhou","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"5520","last_page":"5525"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.5835000276565552,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.5835000276565552,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.10779999941587448,"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/T11946","display_name":"Antenna Design and Optimization","score":0.06930000334978104,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.5638999938964844},{"id":"https://openalex.org/keywords/beamforming","display_name":"Beamforming","score":0.5282999873161316},{"id":"https://openalex.org/keywords/decomposition-method","display_name":"Decomposition method (queueing theory)","score":0.43869999051094055},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.4092000126838684},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.40689998865127563},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.3982999920845032},{"id":"https://openalex.org/keywords/limiting","display_name":"Limiting","score":0.3605000078678131},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.3264999985694885}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6392999887466431},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.5638999938964844},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5299000144004822},{"id":"https://openalex.org/C54197355","wikidata":"https://www.wikidata.org/wiki/Q5782992","display_name":"Beamforming","level":2,"score":0.5282999873161316},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5189999938011169},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.43869999051094055},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.4092000126838684},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.40689998865127563},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.3982999920845032},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3882000148296356},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.3605000078678131},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3264999985694885},{"id":"https://openalex.org/C27665512","wikidata":"https://www.wikidata.org/wiki/Q3042795","display_name":"Benders' decomposition","level":2,"score":0.32170000672340393},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.29679998755455017},{"id":"https://openalex.org/C189237950","wikidata":"https://www.wikidata.org/wiki/Q2500758","display_name":"Stationary point","level":2,"score":0.29420000314712524},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.27959999442100525},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.27219998836517334},{"id":"https://openalex.org/C131584629","wikidata":"https://www.wikidata.org/wiki/Q4308705","display_name":"Coupling (piping)","level":2,"score":0.2676999866962433},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.25850000977516174},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.25380000472068787},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.2502000033855438}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/globecom59602.2025.11432696","is_oa":false,"landing_page_url":"https://doi.org/10.1109/globecom59602.2025.11432696","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"GLOBECOM 2025 - 2025 IEEE Global Communications Conference","raw_type":"proceedings-article"},{"id":"pmh:oai:repository.hkust.edu.hk:1783.1-171204","is_oa":false,"landing_page_url":"http://repository.hkust.edu.hk/ir/Record/1783.1-171204","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"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":"Conference paper"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.5441828370094299}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320335480","display_name":"Guangzhou Municipal Science and Technology Project","ror":null},{"id":"https://openalex.org/F4320335777","display_name":"National Key Research and Development Program of China","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1484024531","https://openalex.org/W1974661392","https://openalex.org/W2098126478","https://openalex.org/W2100573451","https://openalex.org/W2110018596","https://openalex.org/W2162986857","https://openalex.org/W2295566694","https://openalex.org/W2508393166","https://openalex.org/W2803565980"],"related_works":[],"abstract_inverted_index":{"Existing":[0],"primal":[1,19,35,41,88,115,151],"decomposition":[2,20,36,42,89,116,152],"algorithms":[3],"for":[4,44,79,118],"nonconvex":[5,46,52,83,108],"problems":[6,81],"cannot":[7],"handle":[8],"nonlinear":[9,55],"equality":[10,56],"constraints":[11],"and":[12,25,38,54,69,93,96,125,133],"do":[13],"not":[14],"fully":[15],"exploit":[16],"the":[17,61,64,70,76,86,102,106,113,136,145,149],"original":[18,107],"structures,":[21],"limiting":[22],"their":[23],"effectiveness":[24],"efficiency.":[26],"To":[27],"address":[28],"these":[29],"limitations,":[30],"we":[31],"propose":[32],"a":[33,39,45,119],"new":[34,40,120],"method":[37],"algorithm":[43,90,117],"problem":[47],"with":[48],"coupling":[49],"variables":[50],"in":[51],"inequality":[53],"constraints.":[57],"Specifically,":[58],"they":[59],"remove":[60],"dependence":[62],"on":[63],"subproblems\u2019":[65],"globally":[66],"optimal":[67,121],"points":[68,104],"master":[71],"problem\u2019s":[72],"convexity,":[73],"successfully":[74],"generalizing":[75],"classic":[77],"ones":[78],"convex":[80],"to":[82,99,101],"problems.":[84],"Besides,":[85],"proposed":[87,114,150],"allows":[91],"parallel":[92],"distributed":[94],"implementations":[95],"is":[97,130],"shown":[98],"converge":[100],"stationary":[103],"of":[105,148],"problem.":[109,141],"We":[110],"also":[111],"customize":[112],"Zero-Forcing":[122],"(ZF)":[123],"transmit":[124,139],"receive":[126],"beamforming":[127,140],"problem,":[128],"which":[129],"more":[131],"general":[132],"challenging":[134],"than":[135],"existing":[137],"ZF":[138],"Numerical":[142],"results":[143],"demonstrate":[144],"superior":[146],"advantages":[147],"algorithm.":[153]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2026-03-20T00:00:00"}