{"id":"https://openalex.org/W4414979748","doi":"https://doi.org/10.48550/arxiv.2510.05885","title":"MadNCL: A GPU Implementation of Algorithm NCL for Large-Scale, Degenerate Nonlinear Programs","display_name":"MadNCL: A GPU Implementation of Algorithm NCL for Large-Scale, Degenerate Nonlinear Programs","publication_year":2025,"publication_date":"2025-10-07","ids":{"openalex":"https://openalex.org/W4414979748","doi":"https://doi.org/10.48550/arxiv.2510.05885"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2510.05885","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2510.05885","pdf_url":"https://arxiv.org/pdf/2510.05885","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2510.05885","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043783059","display_name":"Alexis Montoison","orcid":"https://orcid.org/0000-0002-3403-5450","observed_orcids":["https://orcid.org/0000-0002-3403-5450"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Montoison, Alexis","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010044940","display_name":"Fran\u00e7ois Pacaud","orcid":"https://orcid.org/0000-0002-9009-6573","observed_orcids":["https://orcid.org/0000-0002-9009-6573","https://orcid.org/0000-0003-0596-3554"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pacaud, Fran\u00e7ois","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039807799","display_name":"Michael A. Saunders","orcid":"https://orcid.org/0000-0003-3800-4982","observed_orcids":["https://orcid.org/0000-0003-3800-4982"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Saunders, Michael","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102718927","display_name":"Sungho Shin","orcid":"https://orcid.org/0000-0002-9889-3278","observed_orcids":["https://orcid.org/0000-0002-9889-3278"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shin, Sungho","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5027758717","display_name":"Dominique Orban","orcid":"https://orcid.org/0000-0002-8017-7687","observed_orcids":["https://orcid.org/0000-0002-8017-7687"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Orban, Dominique","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"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":true,"cited_by_count":1,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9922000169754028,"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.9922000169754028,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.003000000026077032,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.0010000000474974513,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/augmented-lagrangian-method","display_name":"augmented Lagrangian method","score":0.9879999756813049},{"id":"https://openalex.org/keywords/gpu-implementation","display_name":"GPU implementation","score":0.7350000143051147},{"id":"https://openalex.org/keywords/kkt-systems","display_name":"KKT systems","score":0.8140000104904175},{"id":"https://openalex.org/keywords/infeasibility-detection","display_name":"infeasibility detection","score":0.847000002861023},{"id":"https://openalex.org/keywords/optimal-power-flow","display_name":"optimal power flow","score":0.8640000224113464},{"id":"https://openalex.org/keywords/security-constrained-optimal-power-flow","display_name":"security-constrained optimal power flow","score":0.9789999723434448},{"id":"https://openalex.org/keywords/mathematical-programs-with-equilibrium-constraints","display_name":"mathematical programs with equilibrium constraints","score":0.75}],"concepts":[{"id":"https://openalex.org/C50454189","wikidata":"https://www.wikidata.org/wiki/Q2075125","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","level":2,"score":0.9564999938011169},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7469000220298767},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6316999793052673},{"id":"https://openalex.org/C150452318","wikidata":"https://www.wikidata.org/wiki/Q4820432","display_name":"Augmented Lagrangian method","level":2,"score":0.6085000038146973},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.5899999737739563},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.5304999947547913},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.5133000016212463},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.48910000920295715},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4494999945163727},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4343000054359436},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42809998989105225},{"id":"https://openalex.org/C72319582","wikidata":"https://www.wikidata.org/wiki/Q584304","display_name":"Degenerate energy levels","level":2,"score":0.4259999990463257},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4074999988079071},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4074000120162964},{"id":"https://openalex.org/C2778119891","wikidata":"https://www.wikidata.org/wiki/Q477690","display_name":"CUDA","level":2,"score":0.38609999418258667},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.3828999996185303},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.3824000060558319},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.34220001101493835},{"id":"https://openalex.org/C11210021","wikidata":"https://www.wikidata.org/wiki/Q1520713","display_name":"Linearization","level":3,"score":0.32829999923706055},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.31299999356269836},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.3124000132083893},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.31200000643730164},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2896000146865845},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.28839999437332153},{"id":"https://openalex.org/C459310","wikidata":"https://www.wikidata.org/wiki/Q117801","display_name":"Computational science","level":1,"score":0.2637999951839447},{"id":"https://openalex.org/C124584101","wikidata":"https://www.wikidata.org/wiki/Q1053266","display_name":"Multiplier (economics)","level":2,"score":0.25870001316070557},{"id":"https://openalex.org/C73684929","wikidata":"https://www.wikidata.org/wiki/Q598870","display_name":"Lagrange multiplier","level":2,"score":0.2533999979496002}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:arXiv.org:2510.05885","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2510.05885","pdf_url":"https://arxiv.org/pdf/2510.05885","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:HAL:hal-05434698v1","doi":null,"is_oa":false,"landing_page_url":"https://hal.science/hal-05434698v1","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2025","raw_type":"info:eu-repo/semantics/preprint"},{"id":"doi:10.48550/arxiv.2510.05885","doi":"https://doi.org/10.48550/arxiv.2510.05885","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2510.05885","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2510.05885","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2510.05885","pdf_url":"https://arxiv.org/pdf/2510.05885","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4414979748.pdf","grobid_xml":"https://content.openalex.org/works/W4414979748.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2194220534","https://openalex.org/W4398796700","https://openalex.org/W4221144092","https://openalex.org/W4413469480","https://openalex.org/W4320492792","https://openalex.org/W4406601921","https://openalex.org/W7077478565","https://openalex.org/W4407949301","https://openalex.org/W4414416624","https://openalex.org/W7213597464"],"abstract_inverted_index":{"We":[0,51,172],"present":[1,173],"a":[2],"GPU":[3,88,176],"implementation":[4,177],"of":[5,60,68,84,91,94,178,196],"Algorithm":[6,56,179],"NCL,":[7,57],"an":[8,174,185],"augmented":[9,34],"Lagrangian":[10,35],"method":[11,36],"for":[12,29,87,137,200],"solving":[13,30],"large-scale":[14,208],"and":[15,22,46,63,66,75,189,193,209,218],"degenerate":[16,210],"nonlinear":[17,31],"programs.":[18],"Although":[19],"interior-point":[20,126,186],"methods":[21],"sequential":[23],"quadratic":[24,100],"programming":[25],"are":[26],"widely":[27],"used":[28],"programs,":[32],"the":[33,61,81,92,95,105,110,125,165,191,197],"is":[37],"known":[38],"to":[39,55,113,133],"offer":[40],"superior":[41],"robustness":[42],"against":[43],"constraint":[44],"degeneracies":[45],"can":[47,141],"rapidly":[48],"detect":[49],"infeasibility.":[50],"introduce":[52],"several":[53],"enhancements":[54],"including":[58,212,235],"fusion":[59],"inner":[62],"outer":[64],"loops":[65],"use":[67],"extrapolation":[69],"steps,":[70],"which":[71],"improve":[72],"both":[73],"efficiency":[74],"convergence":[76],"stability.":[77],"Further,":[78],"NCL":[79,106,170,180],"has":[80],"key":[82],"advantage":[83],"being":[85],"well-suited":[86],"architectures":[89],"because":[90],"regularity":[93],"KKT":[96,111,122,166,198],"systems":[97,112,140,167,199],"provided":[98],"by":[99,181],"penalty":[101],"terms.":[102],"In":[103],"particular,":[104],"subproblem":[107,187],"formulation":[108],"allows":[109],"be":[114,142],"naturally":[115],"expressed":[116],"as":[117,154,184],"either":[118],"stabilized":[119,192],"or":[120,131],"condensed":[121,194],"systems,":[123],"whereas":[124],"approach":[127],"requires":[128],"aggressive":[129],"reformulations":[130],"relaxations":[132],"make":[134],"it":[135],"suitable":[136],"GPUs.":[138],"Both":[139],"efficiently":[143,227],"solved":[144],"on":[145,160,206,228],"GPUs":[146,229],"using":[147],"sparse":[148],"\\ldlt":[149],"factorization":[150],"with":[151],"static":[152],"pivoting,":[153],"implemented":[155],"in":[156],"NVIDIA":[157],"cuDSS.":[158],"Building":[159],"these":[161],"advantages,":[162],"we":[163],"examine":[164],"arising":[168],"from":[169],"subproblems.":[171],"optimized":[175],"leveraging":[182],"MadNLP":[183],"solver":[188],"utilizing":[190],"formulations":[195],"computing":[201],"Newton":[202],"steps.":[203],"Numerical":[204],"experiments":[205],"various":[207],"NLPs,":[211],"optimal":[213,220],"power":[214,221],"flow,":[215,222],"COPS":[216],"benchmarks,":[217],"security-constrained":[219],"demonstrate":[223],"that":[224],"MadNCL":[225],"operates":[226],"while":[230],"effectively":[231],"managing":[232],"problem":[233],"degeneracy,":[234],"MPCC":[236],"constraints.":[237]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-11-05T12:25:35.769452","created_date":"2025-10-10T00:00:00"}