{"id":"https://openalex.org/W4282584602","doi":"https://doi.org/10.1137/21m1399956","title":"Cutting Plane Generation through Sparse Principal Component Analysis","display_name":"Cutting Plane Generation through Sparse Principal Component Analysis","publication_year":2022,"publication_date":"2022-06-01","ids":{"openalex":"https://openalex.org/W4282584602","doi":"https://doi.org/10.1137/21m1399956"},"language":"en","primary_location":{"id":"doi:10.1137/21m1399956","is_oa":false,"landing_page_url":"https://doi.org/10.1137/21m1399956","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hdl.handle.net/11585/905200","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051547862","display_name":"Santanu S. Dey","orcid":"https://orcid.org/0000-0003-0294-8287"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Santanu S. Dey","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-0294-8287","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025774365","display_name":"Aleksandr M. Kazachkov","orcid":"https://orcid.org/0000-0002-4949-9565"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Aleksandr Kazachkov","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-4949-9565","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083656325","display_name":"Andrea Lodi","orcid":"https://orcid.org/0000-0001-9269-633X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Andrea Lodi","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-9269-633X","affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5078750171","display_name":"Gonzalo Mu\u00f1oz","orcid":"https://orcid.org/0000-0002-9003-441X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gonzalo Munoz","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-9003-441X","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5051547862"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2809,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.75055134,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"32","issue":"2","first_page":"1319","last_page":"1343"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9990000128746033,"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"}},{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9955000281333923,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9879000186920166,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/cutting-plane-method","display_name":"Cutting-plane method","score":0.7577637434005737},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6480392813682556},{"id":"https://openalex.org/keywords/sparse-pca","display_name":"Sparse PCA","score":0.6151255369186401},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5852895975112915},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.5846199989318848},{"id":"https://openalex.org/keywords/quadratic-growth","display_name":"Quadratic growth","score":0.5660878419876099},{"id":"https://openalex.org/keywords/sparse-approximation","display_name":"Sparse approximation","score":0.5490838885307312},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5472062826156616},{"id":"https://openalex.org/keywords/robust-principal-component-analysis","display_name":"Robust principal component analysis","score":0.5362970232963562},{"id":"https://openalex.org/keywords/column-generation","display_name":"Column generation","score":0.5232048034667969},{"id":"https://openalex.org/keywords/principal-component-analysis","display_name":"Principal component analysis","score":0.5136873126029968},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5022387504577637},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.49496549367904663},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.482827752828598},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4223180413246155},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3329311013221741},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.20972180366516113},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.137262761592865}],"concepts":[{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.7577637434005737},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6480392813682556},{"id":"https://openalex.org/C24252448","wikidata":"https://www.wikidata.org/wiki/Q7573786","display_name":"Sparse PCA","level":3,"score":0.6151255369186401},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5852895975112915},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.5846199989318848},{"id":"https://openalex.org/C195956108","wikidata":"https://www.wikidata.org/wiki/Q7268362","display_name":"Quadratic growth","level":2,"score":0.5660878419876099},{"id":"https://openalex.org/C124066611","wikidata":"https://www.wikidata.org/wiki/Q28684319","display_name":"Sparse approximation","level":2,"score":0.5490838885307312},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5472062826156616},{"id":"https://openalex.org/C2777749129","wikidata":"https://www.wikidata.org/wiki/Q17148469","display_name":"Robust principal component analysis","level":3,"score":0.5362970232963562},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.5232048034667969},{"id":"https://openalex.org/C27438332","wikidata":"https://www.wikidata.org/wiki/Q2873","display_name":"Principal component analysis","level":2,"score":0.5136873126029968},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5022387504577637},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.49496549367904663},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.482827752828598},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4223180413246155},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3329311013221741},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.20972180366516113},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.137262761592865},{"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/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/21m1399956","is_oa":false,"landing_page_url":"https://doi.org/10.1137/21m1399956","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:cris.unibo.it:11585/905200","is_oa":true,"landing_page_url":"https://hdl.handle.net/11585/905200","pdf_url":null,"source":{"id":"https://openalex.org/S4306402579","display_name":"Archivio istituzionale della ricerca (Alma Mater Studiorum Universit\u00e0 di Bologna)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210117483","host_organization_name":"Istituto di Ematologia di Bologna","host_organization_lineage":["https://openalex.org/I4210117483"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:publications.polymtl.ca:51340","is_oa":false,"landing_page_url":"https://publications.polymtl.ca/51340/","pdf_url":null,"source":{"id":"https://openalex.org/S4306401013","display_name":"PolyPublie (\u00c9cole Polytechnique de Montr\u00e9al)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45683168","host_organization_name":"Polytechnique Montr\u00e9al","host_organization_lineage":["https://openalex.org/I45683168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article de revue"}],"best_oa_location":{"id":"pmh:oai:cris.unibo.it:11585/905200","is_oa":true,"landing_page_url":"https://hdl.handle.net/11585/905200","pdf_url":null,"source":{"id":"https://openalex.org/S4306402579","display_name":"Archivio istituzionale della ricerca (Alma Mater Studiorum Universit\u00e0 di Bologna)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210117483","host_organization_name":"Istituto di Ematologia di Bologna","host_organization_lineage":["https://openalex.org/I4210117483"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G890759835","display_name":null,"funder_award_id":"11190515","funder_id":"https://openalex.org/F4320338073","funder_display_name":"Fondo Nacional de Desarrollo Cient\u00edfico y Tecnol\u00f3gico"}],"funders":[{"id":"https://openalex.org/F4320338073","display_name":"Fondo Nacional de Desarrollo Cient\u00edfico y Tecnol\u00f3gico","ror":"https://ror.org/02ap3w078"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":52,"referenced_works":["https://openalex.org/W942484584","https://openalex.org/W1564910180","https://openalex.org/W1582056940","https://openalex.org/W1878408459","https://openalex.org/W1972746552","https://openalex.org/W1985123706","https://openalex.org/W1988390398","https://openalex.org/W1988622494","https://openalex.org/W2000642309","https://openalex.org/W2000923338","https://openalex.org/W2025308368","https://openalex.org/W2035660776","https://openalex.org/W2071143636","https://openalex.org/W2071550336","https://openalex.org/W2078327411","https://openalex.org/W2078992232","https://openalex.org/W2091213699","https://openalex.org/W2105880662","https://openalex.org/W2115679232","https://openalex.org/W2122340891","https://openalex.org/W2125772126","https://openalex.org/W2137678593","https://openalex.org/W2139559439","https://openalex.org/W2141380252","https://openalex.org/W2143075842","https://openalex.org/W2157030448","https://openalex.org/W2165281529","https://openalex.org/W2165969805","https://openalex.org/W2169053534","https://openalex.org/W2171238021","https://openalex.org/W2790253958","https://openalex.org/W2920857515","https://openalex.org/W2939980816","https://openalex.org/W2943555794","https://openalex.org/W2963024421","https://openalex.org/W2963227682","https://openalex.org/W2963575397","https://openalex.org/W2964069177","https://openalex.org/W2964081927","https://openalex.org/W2964289932","https://openalex.org/W2975229626","https://openalex.org/W2981881596","https://openalex.org/W2992793632","https://openalex.org/W3008300991","https://openalex.org/W3022658014","https://openalex.org/W3025795274","https://openalex.org/W3092933581","https://openalex.org/W3093436698","https://openalex.org/W3112132453","https://openalex.org/W3129033895","https://openalex.org/W4212864101","https://openalex.org/W4226106437"],"related_works":["https://openalex.org/W2302215559","https://openalex.org/W2073944685","https://openalex.org/W2463344124","https://openalex.org/W107071865","https://openalex.org/W2145962650","https://openalex.org/W4283792950","https://openalex.org/W2161798622","https://openalex.org/W2951443864","https://openalex.org/W2030257792","https://openalex.org/W2791609404"],"abstract_inverted_index":{"Quadratically":[0],"constrained":[1],"quadratic":[2],"programs":[3],"(QCQPs)":[4],"are":[5,114],"optimization":[6,21],"models":[7],"whose":[8],"remarkable":[9],"expressiveness":[10],"have":[11],"made":[12],"them":[13],"a":[14,28,40,45,96,123,132],"cornerstone":[15],"of":[16,108,166],"methodological":[17],"research":[18],"for":[19,58,163],"nonconvex":[20,109],"problems.":[22],"However,":[23],"modern":[24],"methods":[25],"to":[26,32,69,116,121,152],"solve":[27],"general":[29],"QCQP":[30],"fail":[31],"scale,":[33],"encountering":[34],"computational":[35,160],"challenges":[36],"even":[37],"with":[38,73],"just":[39],"few":[41],"hundred":[42],"variables.":[43],"Specifically,":[44],"semidefinite":[46],"programming":[47,77],"(SDP)":[48],"relaxation":[49,78],"is":[50,68],"typically":[51],"employed,":[52],"which":[53,149],"provides":[54],"strong":[55,82],"dual":[56],"bounds":[57],"QCQPs":[59],"but":[60],"relies":[61],"on":[62],"memory-intensive":[63],"algorithms.":[64],"An":[65],"appealing":[66],"alternative":[67],"replace":[70],"the":[71,105,141,164],"SDP":[72],"an":[74],"easier-to-solve":[75],"linear":[76,99],"while":[79],"still":[80],"achieving":[81,91],"bounds.":[83],"In":[84],"this":[85,92],"work,":[86],"we":[87],"make":[88],"advances":[89],"toward":[90],"goal":[93],"by":[94],"developing":[95],"computationally":[97],"efficient":[98],"cutting":[100,112],"plane":[101],"algorithm":[102],"that":[103],"emulates":[104],"SDP-based":[106],"approximations":[107],"QCQPs.":[110],"The":[111],"planes":[113],"required":[115],"be":[117],"sparse,":[118],"in":[119,147],"order":[120],"ensure":[122],"numerically":[124],"attractive":[125],"approximation,":[126],"and":[127,140],"efficiently":[128],"computable.":[129],"We":[130,157],"present":[131],"novel":[133],"connection":[134],"between":[135],"such":[136],"sparse":[137,142],"cut":[138],"generation":[139],"principal":[143],"component":[144],"analysis":[145],"problem":[146],"statistics,":[148],"allows":[150],"us":[151],"achieve":[153],"these":[154],"two":[155],"goals.":[156],"show":[158],"extensive":[159],"results":[161],"advocating":[162],"use":[165],"our":[167],"approach.":[168]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2022-06-14T00:00:00"}