{"id":"https://openalex.org/W7123358084","doi":"https://doi.org/10.1109/cdc57313.2025.11312551","title":"Blocked Cholesky factorization updates of the Riccati recursion using hyperbolic Householder transformations","display_name":"Blocked Cholesky factorization updates of the Riccati recursion using hyperbolic Householder transformations","publication_year":2025,"publication_date":"2025-12-09","ids":{"openalex":"https://openalex.org/W7123358084","doi":"https://doi.org/10.1109/cdc57313.2025.11312551"},"language":null,"primary_location":{"id":"doi:10.1109/cdc57313.2025.11312551","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc57313.2025.11312551","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 64th Conference on Decision and Control (CDC)","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/A5061594865","display_name":"Pieter Pas","orcid":"https://orcid.org/0000-0002-7004-2447"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Pieter Pas","raw_affiliation_strings":["KU Leuven,STADIUS Center for Dynamical Systems, Signal Processing and Data Analytics,Department of Electrical Engineering (ESAT),Leuven,Belgium,3001"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KU Leuven,STADIUS Center for Dynamical Systems, Signal Processing and Data Analytics,Department of Electrical Engineering (ESAT),Leuven,Belgium,3001","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031380765","display_name":"Panagiotis Patrinos","orcid":"https://orcid.org/0000-0003-4824-7697"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Panagiotis Patrinos","raw_affiliation_strings":["KU Leuven,STADIUS Center for Dynamical Systems, Signal Processing and Data Analytics,Department of Electrical Engineering (ESAT),Leuven,Belgium,3001"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"KU Leuven,STADIUS Center for Dynamical Systems, Signal Processing and Data Analytics,Department of Electrical Engineering (ESAT),Leuven,Belgium,3001","institution_ids":["https://openalex.org/I99464096"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I99464096"],"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":"5323","last_page":"5328"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.36309999227523804,"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.36309999227523804,"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/T11206","display_name":"Model Reduction and Neural Networks","score":0.3075999915599823,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10791","display_name":"Advanced Control Systems Optimization","score":0.17919999361038208,"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/cholesky-decomposition","display_name":"Cholesky decomposition","score":0.9381999969482422},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.7412999868392944},{"id":"https://openalex.org/keywords/incomplete-cholesky-factorization","display_name":"Incomplete Cholesky factorization","score":0.6435999870300293},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.6176000237464905},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4404999911785126},{"id":"https://openalex.org/keywords/incomplete-lu-factorization","display_name":"Incomplete LU factorization","score":0.4372999966144562},{"id":"https://openalex.org/keywords/algebraic-riccati-equation","display_name":"Algebraic Riccati equation","score":0.43459999561309814},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.3946000039577484},{"id":"https://openalex.org/keywords/riccati-equation","display_name":"Riccati equation","score":0.3774000108242035}],"concepts":[{"id":"https://openalex.org/C34727166","wikidata":"https://www.wikidata.org/wiki/Q515375","display_name":"Cholesky decomposition","level":3,"score":0.9381999969482422},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.7412999868392944},{"id":"https://openalex.org/C44363057","wikidata":"https://www.wikidata.org/wiki/Q6015160","display_name":"Incomplete Cholesky factorization","level":4,"score":0.6435999870300293},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.6176000237464905},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49900001287460327},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4404999911785126},{"id":"https://openalex.org/C134978465","wikidata":"https://www.wikidata.org/wiki/Q1654069","display_name":"Incomplete LU factorization","level":4,"score":0.4372999966144562},{"id":"https://openalex.org/C13847129","wikidata":"https://www.wikidata.org/wiki/Q4723989","display_name":"Algebraic Riccati equation","level":4,"score":0.43459999561309814},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4237000048160553},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.3946000039577484},{"id":"https://openalex.org/C45473103","wikidata":"https://www.wikidata.org/wiki/Q851503","display_name":"Riccati equation","level":3,"score":0.3774000108242035},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.3747999966144562},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.36820000410079956},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.364300012588501},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.34450000524520874},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.34279999136924744},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.3424000144004822},{"id":"https://openalex.org/C46085209","wikidata":"https://www.wikidata.org/wiki/Q17098969","display_name":"Minimum degree algorithm","level":5,"score":0.337799996137619},{"id":"https://openalex.org/C6802819","wikidata":"https://www.wikidata.org/wiki/Q1072174","display_name":"Linear system","level":2,"score":0.3294000029563904},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29679998755455017},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.2922999858856201},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2881999909877777},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.2849999964237213},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.271699994802475},{"id":"https://openalex.org/C171609451","wikidata":"https://www.wikidata.org/wiki/Q5425382","display_name":"FETI","level":4,"score":0.2687000036239624},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.2630999982357025},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.257999986410141},{"id":"https://openalex.org/C150452318","wikidata":"https://www.wikidata.org/wiki/Q4820432","display_name":"Augmented Lagrangian method","level":2,"score":0.25589999556541443}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc57313.2025.11312551","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc57313.2025.11312551","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 64th Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322308","display_name":"KU Leuven","ror":"https://ror.org/05f950310"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Newton":[0,120],"systems":[1,21,121],"in":[2,22,33,65,100],"quadratic":[3],"programming":[4],"(QP)":[5],"methods":[6],"are":[7,123,140],"often":[8],"solved":[9],"using":[10],"direct":[11],"Cholesky":[12,53,68],"or":[13],"LDL<sup":[14],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[15],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\u22a4</sup>":[16],"factorizations.":[17],"When":[18],"the":[19,41,57,78,97,109,118,125,128,135],"linear":[20],"successive":[23],"iterations":[24],"differ":[25],"by":[26],"a":[27,51,92],"low-rank":[28,67],"modification":[29],"(as":[30],"is":[31],"common":[32],"active":[34],"set":[35],"and":[36,61],"augmented":[37],"Lagrangian":[38],"methods),":[39],"updating":[40,96],"existing":[42],"factorization":[43,69,137],"can":[44,112],"offer":[45],"significant":[46],"performance":[47],"improvements":[48],"over":[49],"recomputing":[50],"full":[52],"factorization.":[54],"We":[55],"review":[56],"hyperbolic":[58,74],"Householder":[59],"transformation,":[60],"demonstrate":[62],"its":[63],"usefulness":[64],"describing":[66],"updates.":[70],"By":[71],"applying":[72],"this":[73],"Householder-based":[75],"framework":[76],"to":[77,115],"well-known":[79],"Riccati":[80],"recursion":[81],"for":[82,95,103],"solving":[83],"saddlepoint":[84],"problems":[85],"with":[86],"optimal":[87],"control":[88,106],"structure,":[89],"we":[90],"develop":[91],"novel":[93],"algorithm":[94],"factorizations":[98],"used":[99,114],"optimization":[101],"solvers":[102],"model":[104],"predictive":[105],"(MPC).":[107],"Specifically,":[108],"proposed":[110,136],"method":[111],"be":[113],"efficiently":[116],"solve":[117],"semismooth":[119],"that":[122],"at":[124],"core":[126],"of":[127,134],"QPALM-OCP":[129],"solver.":[130],"Optimized":[131],"open-source":[132],"implementations":[133],"update":[138],"routines":[139],"made":[141],"available.":[142]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2026-01-14T00:00:00"}