{"id":"https://openalex.org/W7129439578","doi":"https://doi.org/10.48550/arxiv.2602.14154","title":"A Penalty Approach for Differentiation Through Black-Box Quadratic Programming Solvers","display_name":"A Penalty Approach for Differentiation Through Black-Box Quadratic Programming Solvers","publication_year":2026,"publication_date":"2026-02-15","ids":{"openalex":"https://openalex.org/W7129439578","doi":"https://doi.org/10.48550/arxiv.2602.14154"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.14154","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126173389","display_name":"Yuxuan Linghu","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Linghu, Yuxuan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126264948","display_name":"Zhiyuan Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Zhiyuan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5126208382","display_name":"Qi Deng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Deng, Qi","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5126173389"],"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":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.4779999852180481,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.4779999852180481,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.2800000011920929,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.08020000159740448,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.6796000003814697},{"id":"https://openalex.org/keywords/karush\u2013kuhn\u2013tucker-conditions","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","score":0.5996000170707703},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.5662999749183655},{"id":"https://openalex.org/keywords/differentiable-function","display_name":"Differentiable function","score":0.474700003862381},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.444599986076355},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4401000142097473},{"id":"https://openalex.org/keywords/automatic-differentiation","display_name":"Automatic differentiation","score":0.4311000108718872},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4205999970436096}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6919999718666077},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.6796000003814697},{"id":"https://openalex.org/C50454189","wikidata":"https://www.wikidata.org/wiki/Q2075125","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","level":2,"score":0.5996000170707703},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5690000057220459},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.5662999749183655},{"id":"https://openalex.org/C202615002","wikidata":"https://www.wikidata.org/wiki/Q783507","display_name":"Differentiable function","level":2,"score":0.474700003862381},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.444599986076355},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4401000142097473},{"id":"https://openalex.org/C133512626","wikidata":"https://www.wikidata.org/wiki/Q787371","display_name":"Automatic differentiation","level":3,"score":0.4311000108718872},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4205999970436096},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.40310001373291016},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3790999948978424},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3564000129699707},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.33059999346733093},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31929999589920044},{"id":"https://openalex.org/C2989514635","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization problem","level":3,"score":0.3084000051021576},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.2849000096321106},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.27869999408721924},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.2775000035762787},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.2712000012397766}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.14154","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.14154","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.14154","pdf_url":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.14154","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Differentiating":[0],"through":[1,20,88],"the":[2,21,54,70,77,92,101,107],"solution":[3,78,93],"of":[4,94],"a":[5,10,43,80,95,136],"quadratic":[6],"program":[7],"(QP)":[8],"is":[9,60,147,162],"central":[11],"problem":[12,84],"in":[13,100,110],"differentiable":[14],"optimization.":[15],"Most":[16],"existing":[17],"approaches":[18],"differentiate":[19,87],"Karush--Kuhn--Tucker":[22],"(KKT)":[23],"system,":[24],"but":[25],"their":[26],"computational":[27,117],"cost":[28],"and":[29,62,85,114,119,135,153,165],"numerical":[30],"robustness":[31],"can":[32,63],"degrade":[33],"at":[34,167],"scale.":[35],"To":[36],"address":[37],"these":[38],"limitations,":[39],"we":[40,75],"propose":[41],"dXPP,":[42],"penalty-based":[44],"differentiation":[45,71,113,151],"framework":[46],"that":[47,145],"decouples":[48],"QP":[49,67],"solving":[50,55],"from":[51],"differentiation.":[52],"In":[53,69],"step":[56,72],"(forward":[57],"pass),":[58,74],"dXPP":[59,123,146],"solver-agnostic":[61],"leverage":[64],"any":[65],"black-box":[66],"solver.":[68],"(backward":[73],"map":[76],"to":[79],"smooth":[81],"approximate":[82],"penalty":[83],"implicitly":[86],"it,":[89],"requiring":[90],"only":[91],"much":[96],"smaller":[97],"linear":[98],"system":[99],"primal":[102],"variables.":[103],"This":[104],"approach":[105],"bypasses":[106],"difficulties":[108],"inherent":[109],"explicit":[111],"KKT":[112],"significantly":[115],"improves":[116],"efficiency":[118],"robustness.":[120],"We":[121],"evaluate":[122],"on":[124,157],"various":[125],"tasks,":[126],"including":[127],"randomly":[128],"generated":[129],"QPs,":[130],"large-scale":[131,158],"sparse":[132],"projection":[133],"problems,":[134],"real-world":[137],"multi-period":[138],"portfolio":[139],"optimization":[140],"task.":[141],"Empirical":[142],"results":[143],"demonstrate":[144],"competitive":[148],"with":[149],"KKT-based":[150],"methods":[152],"achieves":[154],"substantial":[155],"speedups":[156],"problems.":[159],"Our":[160],"implementation":[161],"open":[163],"source":[164],"available":[166],"https://github.com/mmmmmmlinghu/dXPP.":[168]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-18T00:00:00"}