{"id":"https://openalex.org/W7116797934","doi":"https://doi.org/10.1007/s10107-025-02316-y","title":"On the partial convexification for low-rank spectral optimization: rank bounds and algorithms","display_name":"On the partial convexification for low-rank spectral optimization: rank bounds and algorithms","publication_year":2025,"publication_date":"2025-12-22","ids":{"openalex":"https://openalex.org/W7116797934","doi":"https://doi.org/10.1007/s10107-025-02316-y"},"language":"en","primary_location":{"id":"doi:10.1007/s10107-025-02316-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-025-02316-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-025-02316-y.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10107-025-02316-y.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5120975511","display_name":"Yongchun Li","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yongchun Li","raw_affiliation_strings":["ISyE, Georgia Institute of Technology, Atlanta, GA, USA"],"raw_orcid":"https://orcid.org/0000-0003-1938-377X","affiliations":[{"raw_affiliation_string":"ISyE, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048142877","display_name":"Weijun Xie","orcid":"https://orcid.org/0000-0001-5157-1194"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Weijun Xie","raw_affiliation_strings":["ISyE, Georgia Institute of Technology, Atlanta, GA, USA"],"raw_orcid":"https://orcid.org/0000-0001-5157-1194","affiliations":[{"raw_affiliation_string":"ISyE, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5048142877"],"corresponding_institution_ids":["https://openalex.org/I130701444"],"apc_list":{"value":3090,"currency":"USD","value_usd":3090},"apc_paid":{"value":3090,"currency":"USD","value_usd":3090},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.47240409,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"216","issue":"1-2","first_page":"651","last_page":"708"},"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.8676000237464905,"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.8676000237464905,"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.08299999684095383,"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.020899999886751175,"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/rank","display_name":"Rank (graph theory)","score":0.6304000020027161},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.46790000796318054},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4641000032424927},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.45890000462532043},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.43790000677108765},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.4309000074863434},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4293000102043152},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.41760000586509705},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.41359999775886536}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8646000027656555},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.6304000020027161},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.46790000796318054},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4641000032424927},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.45890000462532043},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.43790000677108765},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.4309000074863434},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4293000102043152},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.41760000586509705},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4169999957084656},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.41359999775886536},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39579999446868896},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3646000027656555},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3643999993801117},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.36340001225471497},{"id":"https://openalex.org/C201829737","wikidata":"https://www.wikidata.org/wiki/Q2022760","display_name":"Linear matrix inequality","level":2,"score":0.35440000891685486},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.3280999958515167},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.32670000195503235},{"id":"https://openalex.org/C90199385","wikidata":"https://www.wikidata.org/wiki/Q6692777","display_name":"Low-rank approximation","level":3,"score":0.3208000063896179},{"id":"https://openalex.org/C189237950","wikidata":"https://www.wikidata.org/wiki/Q2500758","display_name":"Stationary point","level":2,"score":0.3163999915122986},{"id":"https://openalex.org/C17137986","wikidata":"https://www.wikidata.org/wiki/Q215067","display_name":"Orthogonality","level":2,"score":0.301800012588501},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.2973000109195709},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.2946999967098236},{"id":"https://openalex.org/C48753275","wikidata":"https://www.wikidata.org/wiki/Q11216","display_name":"Numerical analysis","level":2,"score":0.288100004196167},{"id":"https://openalex.org/C2778459887","wikidata":"https://www.wikidata.org/wiki/Q6787865","display_name":"Matrix completion","level":3,"score":0.28769999742507935},{"id":"https://openalex.org/C39847760","wikidata":"https://www.wikidata.org/wiki/Q1385465","display_name":"Extreme point","level":2,"score":0.2842000126838684},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.26669999957084656},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.2603999972343445},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.25049999356269836}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10107-025-02316-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-025-02316-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-025-02316-y.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s10107-025-02316-y","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-025-02316-y","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-025-02316-y.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5284879186","display_name":"Collaborative Research: CIF: Small: Interpretable Fair Machine Learning: Frameworks, Robustness, and Scalable Algorithms","funder_award_id":"2246417","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6412956065","display_name":"CAREER: Favorable Optimization under Distributional Distortions: Frameworks, Algorithms, and Applications","funder_award_id":"2246414","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6718763443","display_name":null,"funder_award_id":"N00014-24-1-2066","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G8588579486","display_name":null,"funder_award_id":"2246414","funder_id":"https://openalex.org/F4320337391","funder_display_name":"Division of Civil, Mechanical and Manufacturing Innovation"},{"id":"https://openalex.org/G8876996369","display_name":null,"funder_award_id":"N00014","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"},{"id":"https://openalex.org/F4320337391","display_name":"Division of Civil, Mechanical and Manufacturing Innovation","ror":"https://ror.org/028yd4c30"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7116797934.pdf","grobid_xml":"https://content.openalex.org/works/W7116797934.grobid-xml"},"referenced_works_count":34,"referenced_works":["https://openalex.org/W1542918674","https://openalex.org/W1568307856","https://openalex.org/W1970355999","https://openalex.org/W1986471478","https://openalex.org/W1991825408","https://openalex.org/W2005102197","https://openalex.org/W2016723762","https://openalex.org/W2049371785","https://openalex.org/W2061234613","https://openalex.org/W2068300001","https://openalex.org/W2093022060","https://openalex.org/W2103972604","https://openalex.org/W2135159299","https://openalex.org/W2138505091","https://openalex.org/W2143075842","https://openalex.org/W2149335048","https://openalex.org/W2158907148","https://openalex.org/W2162748558","https://openalex.org/W2162995463","https://openalex.org/W2167391223","https://openalex.org/W2520174214","https://openalex.org/W2552451242","https://openalex.org/W2625859466","https://openalex.org/W2963227682","https://openalex.org/W2977942161","https://openalex.org/W3005066781","https://openalex.org/W3088334794","https://openalex.org/W3111964120","https://openalex.org/W3131933343","https://openalex.org/W3163505053","https://openalex.org/W3217615765","https://openalex.org/W4200478062","https://openalex.org/W4390050924","https://openalex.org/W4400197068"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"A":[1],"Low-rank":[2],"Spectral":[3],"Optimization":[4],"Problem":[5],"(LSOP)":[6],"minimizes":[7],"a":[8,20,50,93,118,123,129],"linear":[9,16],"objective":[10],"function":[11],"subject":[12],"to":[13,56,99,110],"multiple":[14],"two-sided":[15],"inequalities":[17],"intersected":[18],"with":[19,39,122],"low-rank":[21],"and":[22,48,77,96,128,152],"spectral":[23],"constrained":[24],"domain.":[25],"Although":[26],"solving":[27],"LSOP":[28],"is":[29,45,108],"generally":[30],"NP-hard,":[31],"its":[32,40],"partial":[33],"convexification":[34],"(i.e.,":[35],"replacing":[36],"the":[37,58,90,105,135,140,148,153,156],"domain":[38],"convex":[41,125],"hull),":[42],"termed":[43],"\u201cLSOP-R,\"":[44],"often":[46],"tractable":[47],"yields":[49],"high-quality":[51],"solution.":[52],"This":[53],"motivates":[54],"us":[55,98],"study":[57],"strength":[59,149],"of":[60,71,150,155],"LSOP-R.":[61],"Specifically,":[62],"we":[63,116,145],"derive":[64,100],"rank":[65,83,142],"bounds":[66,84],"for":[67],"any":[68],"extreme":[69],"point":[70],"LSOP-R":[72,107,151],"in":[73,89],"different":[74],"matrix":[75],"spaces":[76],"prove":[78],"their":[79],"tightness.":[80],"The":[81],"proposed":[82,157],"recover":[85],"two":[86],"well-known":[87],"results":[88],"literature":[91],"from":[92],"fresh":[94],"angle":[95],"allow":[97],"sufficient":[101],"conditions":[102],"under":[103],"which":[104,132],"relaxation":[106],"equivalent":[109],"LSOP.":[111],"To":[112],"effectively":[113],"solve":[114],"LSOP-R,":[115],"develop":[117],"column":[119],"generation":[120],"algorithm":[121],"vector-based":[124],"pricing":[126],"oracle":[127],"rank-reduction":[130],"algorithm,":[131],"ensures":[133],"that":[134],"output":[136],"solution":[137],"always":[138],"satisfies":[139],"theoretical":[141],"bound.":[143],"Finally,":[144],"numerically":[146],"verify":[147],"efficacy":[154],"algorithms.":[158]},"counts_by_year":[],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-12-22T00:00:00"}