{"id":"https://openalex.org/W2802164368","doi":"https://doi.org/10.1137/16m1088570","title":"A Regularized Factorization-Free Method for Equality-Constrained Optimization","display_name":"A Regularized Factorization-Free Method for Equality-Constrained Optimization","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2802164368","doi":"https://doi.org/10.1137/16m1088570","mag":"2802164368"},"language":"en","primary_location":{"id":"doi:10.1137/16m1088570","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1088570","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041451179","display_name":"Sylvain Arreckx","orcid":"https://orcid.org/0000-0002-8112-2135"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sylvain Arreckx","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"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dominique Orban","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.07,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.9107308,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"28","issue":"2","first_page":"1613","last_page":"1639"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":1.0,"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":1.0,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9983999729156494,"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"}},{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9979000091552734,"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/factorization","display_name":"Factorization","score":0.7223032712936401},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7082817554473877},{"id":"https://openalex.org/keywords/regularization","display_name":"Regularization (linguistics)","score":0.6268982887268066},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5705991387367249},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.5695379972457886},{"id":"https://openalex.org/keywords/augmented-lagrangian-method","display_name":"Augmented Lagrangian method","score":0.5522767901420593},{"id":"https://openalex.org/keywords/broyden\u2013fletcher\u2013goldfarb\u2013shanno-algorithm","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","score":0.5141251683235168},{"id":"https://openalex.org/keywords/incomplete-lu-factorization","display_name":"Incomplete LU factorization","score":0.484007328748703},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.47553062438964844},{"id":"https://openalex.org/keywords/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.4213167428970337},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3900444507598877},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2787036895751953},{"id":"https://openalex.org/keywords/matrix-decomposition","display_name":"Matrix decomposition","score":0.2373262345790863},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22609305381774902}],"concepts":[{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.7223032712936401},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7082817554473877},{"id":"https://openalex.org/C2776135515","wikidata":"https://www.wikidata.org/wiki/Q17143721","display_name":"Regularization (linguistics)","level":2,"score":0.6268982887268066},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5705991387367249},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.5695379972457886},{"id":"https://openalex.org/C150452318","wikidata":"https://www.wikidata.org/wiki/Q4820432","display_name":"Augmented Lagrangian method","level":2,"score":0.5522767901420593},{"id":"https://openalex.org/C132721684","wikidata":"https://www.wikidata.org/wiki/Q2877013","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","level":3,"score":0.5141251683235168},{"id":"https://openalex.org/C134978465","wikidata":"https://www.wikidata.org/wiki/Q1654069","display_name":"Incomplete LU factorization","level":4,"score":0.484007328748703},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.47553062438964844},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.4213167428970337},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3900444507598877},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2787036895751953},{"id":"https://openalex.org/C42355184","wikidata":"https://www.wikidata.org/wiki/Q1361088","display_name":"Matrix decomposition","level":3,"score":0.2373262345790863},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22609305381774902},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/16m1088570","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1088570","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:publications.polymtl.ca:37478","is_oa":false,"landing_page_url":"http://www.gerad.ca/fr/papers/G-2016-65/","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":"Rapport"},{"id":"pmh:oai:publications.polymtl.ca:40535","is_oa":false,"landing_page_url":"https://publications.polymtl.ca/40535/","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":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.6000000238418579,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1490084264","https://openalex.org/W1970946112","https://openalex.org/W1977108089","https://openalex.org/W1978975857","https://openalex.org/W1983585148","https://openalex.org/W1983886273","https://openalex.org/W2015757834","https://openalex.org/W2018850201","https://openalex.org/W2019894644","https://openalex.org/W2027507632","https://openalex.org/W2033477411","https://openalex.org/W2033624514","https://openalex.org/W2034835449","https://openalex.org/W2037328914","https://openalex.org/W2051434435","https://openalex.org/W2057565823","https://openalex.org/W2058839679","https://openalex.org/W2060701814","https://openalex.org/W2062294426","https://openalex.org/W2072274072","https://openalex.org/W2075998338","https://openalex.org/W2079693963","https://openalex.org/W2097897435","https://openalex.org/W2106353864","https://openalex.org/W2123871098","https://openalex.org/W2135779729","https://openalex.org/W2138831925","https://openalex.org/W2149416133","https://openalex.org/W2153993279","https://openalex.org/W2256780975","https://openalex.org/W2346238354","https://openalex.org/W2520766194"],"related_works":["https://openalex.org/W2371166759","https://openalex.org/W2041357654","https://openalex.org/W2039312875","https://openalex.org/W2393251729","https://openalex.org/W2387203583","https://openalex.org/W2363367808","https://openalex.org/W4206704743","https://openalex.org/W4313119266","https://openalex.org/W2490511642","https://openalex.org/W2030310352"],"abstract_inverted_index":{"We":[0,70,120],"propose":[1],"a":[2,9,35,67,101,111],"method":[3,27,90,106],"for":[4,58,93],"equality-constrained":[5],"optimization":[6],"based":[7],"on":[8],"problem":[10],"in":[11,66],"which":[12],"all":[13],"constraints":[14],"are":[15],"systematically":[16],"regularized.":[17],"The":[18],"regularization":[19],"is":[20,38,91,118],"equivalent":[21],"to":[22,33,49,54,62,126,132],"applying":[23],"an":[24],"augmented":[25],"Lagrangian":[26],"but":[28],"the":[29,86],"linear":[30,59],"system":[31],"used":[32],"compute":[34,63],"search":[36],"direction":[37],"reminiscent":[39],"of":[40,104,129],"regularized":[41],"sequential":[42],"quadratic":[43],"programming.":[44],"A":[45],"limited-memory":[46],"BFGS":[47],"approximation":[48],"second":[50],"derivatives":[51],"allows":[52],"us":[53],"employ":[55],"iterative":[56],"methods":[57,130],"least":[60],"squares":[61],"steps,":[64],"resulting":[65],"factorization-free":[68,112],"implementation.":[69],"establish":[71],"global":[72],"and":[73,88,131],"fast":[74],"local":[75],"convergence":[76],"under":[77],"weak":[78],"assumptions.":[79],"In":[80],"particular,":[81],"we":[82],"do":[83],"not":[84,115],"require":[85],"LICQ":[87],"our":[89,105,124],"suitable":[92],"degenerate":[94],"problems.":[95],"Preliminary":[96],"numerical":[97],"experiments":[98],"show":[99],"that":[100],"factorization-based":[102],"implementation":[103],"exhibits":[107],"significant":[108],"robustness":[109],"while":[110],"implementation,":[113],"though":[114],"as":[116],"robust,":[117],"promising.":[119],"briefly":[121],"discuss":[122],"generalizing":[123],"framework":[125],"other":[127],"classes":[128],"problems":[133],"with":[134],"inequality":[135],"constraints.":[136]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}