{"id":"https://openalex.org/W4414602324","doi":"https://doi.org/10.1007/s10589-025-00737-1","title":"Convergence rates for an inexact linearized ADMM for nonsmooth nonconvex optimization with nonlinear equality constraints","display_name":"Convergence rates for an inexact linearized ADMM for nonsmooth nonconvex optimization with nonlinear equality constraints","publication_year":2025,"publication_date":"2025-09-29","ids":{"openalex":"https://openalex.org/W4414602324","doi":"https://doi.org/10.1007/s10589-025-00737-1"},"language":"en","primary_location":{"id":"doi:10.1007/s10589-025-00737-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-025-00737-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10589-025-00737-1.pdf","source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10589-025-00737-1.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061379779","display_name":"Lahcen El Bourkhissi","orcid":null},"institutions":[{"id":"https://openalex.org/I61641377","display_name":"Universitatea Na\u021bional\u0103 de \u0218tiin\u021b\u0103 \u0219i Tehnologie Politehnica Bucure\u0219ti","ror":"https://ror.org/0558j5q12","country_code":"RO","type":"education","lineage":["https://openalex.org/I61641377"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Lahcen El Bourkhissi","raw_affiliation_strings":["Automatic Control and Systems Engineering Department, National University of Science and Technology Politehnica Bucharest, 060042, Bucharest, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Automatic Control and Systems Engineering Department, National University of Science and Technology Politehnica Bucharest, 060042, Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019114471","display_name":"Ion Necoara","orcid":"https://orcid.org/0000-0003-1102-2654"},"institutions":[{"id":"https://openalex.org/I4210153325","display_name":"Institute of Mathematical Statistics","ror":"https://ror.org/043f04882","country_code":"US","type":"other","lineage":["https://openalex.org/I4210153325"]},{"id":"https://openalex.org/I58077936","display_name":"Romanian Academy","ror":"https://ror.org/0561n6946","country_code":"RO","type":"archive","lineage":["https://openalex.org/I58077936"]},{"id":"https://openalex.org/I61641377","display_name":"Universitatea Na\u021bional\u0103 de \u0218tiin\u021b\u0103 \u0219i Tehnologie Politehnica Bucure\u0219ti","ror":"https://ror.org/0558j5q12","country_code":"RO","type":"education","lineage":["https://openalex.org/I61641377"]}],"countries":["RO","US"],"is_corresponding":false,"raw_author_name":"Ion Necoara","raw_affiliation_strings":["Automatic Control and Systems Engineering Department, National University of Science and Technology Politehnica Bucharest, 060042, Bucharest, Romania","Gheorghe Mihoc-Caius Iacob Institute of Mathematical Statistics and Applied Mathematics of the Romanian Academy, 050711, Bucharest, Romania"],"raw_orcid":"https://orcid.org/0000-0003-1102-2654","affiliations":[{"raw_affiliation_string":"Automatic Control and Systems Engineering Department, National University of Science and Technology Politehnica Bucharest, 060042, Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]},{"raw_affiliation_string":"Gheorghe Mihoc-Caius Iacob Institute of Mathematical Statistics and Applied Mathematics of the Romanian Academy, 050711, Bucharest, Romania","institution_ids":["https://openalex.org/I4210153325","https://openalex.org/I58077936"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5061379779"],"corresponding_institution_ids":["https://openalex.org/I61641377"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.26949649,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"93","issue":"2","first_page":"689","last_page":"727"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9977999925613403,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9954000115394592,"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/iterated-function","display_name":"Iterated function","score":0.7350000143051147},{"id":"https://openalex.org/keywords/augmented-lagrangian-method","display_name":"Augmented Lagrangian method","score":0.6624000072479248},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.6172999739646912},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6025000214576721},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.47589999437332153},{"id":"https://openalex.org/keywords/lyapunov-function","display_name":"Lyapunov function","score":0.4487000107765198},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4392000138759613},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.43220001459121704},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.42500001192092896},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4242999851703644}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8237000107765198},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.7350000143051147},{"id":"https://openalex.org/C150452318","wikidata":"https://www.wikidata.org/wiki/Q4820432","display_name":"Augmented Lagrangian method","level":2,"score":0.6624000072479248},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.6172999739646912},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6025000214576721},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.498199999332428},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.482699990272522},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.47589999437332153},{"id":"https://openalex.org/C60640748","wikidata":"https://www.wikidata.org/wiki/Q2337858","display_name":"Lyapunov function","level":3,"score":0.4487000107765198},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4392000138759613},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.43220001459121704},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.42500001192092896},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4242999851703644},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.35409998893737793},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.33739998936653137},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.3346000015735626},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.32670000195503235},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.3111000061035156},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.30970001220703125},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.3089999854564667},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.305400013923645},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.2799000144004822},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.2775999903678894},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.2775000035762787},{"id":"https://openalex.org/C117898588","wikidata":"https://www.wikidata.org/wiki/Q6664310","display_name":"Local convergence","level":3,"score":0.2754000127315521},{"id":"https://openalex.org/C5871375","wikidata":"https://www.wikidata.org/wiki/Q1780715","display_name":"Compact convergence","level":4,"score":0.274399995803833},{"id":"https://openalex.org/C2989514635","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization problem","level":3,"score":0.26350000500679016},{"id":"https://openalex.org/C64980692","wikidata":"https://www.wikidata.org/wiki/Q16191959","display_name":"Symbolic convergence theory","level":3,"score":0.2630000114440918},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.2614000141620636},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.26010000705718994}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10589-025-00737-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-025-00737-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10589-025-00737-1.pdf","source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s10589-025-00737-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-025-00737-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10589-025-00737-1.pdf","source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2759485449","display_name":null,"funder_award_id":"70/2022 (L2O-MOC)","funder_id":"https://openalex.org/F4320323983","funder_display_name":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii"},{"id":"https://openalex.org/G8885065467","display_name":null,"funder_award_id":"953348 (ELO-X)","funder_id":"https://openalex.org/F4320332999","funder_display_name":"Horizon 2020 Framework Programme"}],"funders":[{"id":"https://openalex.org/F4320323983","display_name":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii","ror":"https://ror.org/01q7jq182"},{"id":"https://openalex.org/F4320332999","display_name":"Horizon 2020 Framework Programme","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4414602324.pdf","grobid_xml":"https://content.openalex.org/works/W4414602324.grobid-xml"},"referenced_works_count":38,"referenced_works":["https://openalex.org/W646582900","https://openalex.org/W1503393484","https://openalex.org/W1699262394","https://openalex.org/W1969198137","https://openalex.org/W2022164193","https://openalex.org/W2030121914","https://openalex.org/W2040762549","https://openalex.org/W2045079045","https://openalex.org/W2057624533","https://openalex.org/W2123871098","https://openalex.org/W2130839351","https://openalex.org/W2315926684","https://openalex.org/W2785011264","https://openalex.org/W2901889632","https://openalex.org/W2943262196","https://openalex.org/W2962977105","https://openalex.org/W2964271484","https://openalex.org/W2998919771","https://openalex.org/W2999167634","https://openalex.org/W3011526999","https://openalex.org/W3048490699","https://openalex.org/W3080158618","https://openalex.org/W3103984481","https://openalex.org/W3114089334","https://openalex.org/W3127909534","https://openalex.org/W3197468702","https://openalex.org/W3199936146","https://openalex.org/W3205340111","https://openalex.org/W4210285640","https://openalex.org/W4237238238","https://openalex.org/W4242754681","https://openalex.org/W4249513058","https://openalex.org/W4281569539","https://openalex.org/W4292363360","https://openalex.org/W4301283118","https://openalex.org/W4319459406","https://openalex.org/W4391020186","https://openalex.org/W4391954608"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"In":[1],"this":[2,37],"paper,":[3],"we":[4,39,56,116,138,166,181],"consider":[5],"nonconvex":[6,11],"optimization":[7],"problems":[8],"with":[9,93],"nonsmooth":[10],"objective":[12,23,63],"function":[13,24,64],"and":[14,25,65,77,105,165,175,191],"nonlinear":[15,67,94,187],"equality":[16],"constraints.":[17],"We":[18,83],"assume":[19],"that":[20,101,140],"both":[21,172],"the":[22,26,58,62,66,70,74,86,90,110,121,144,154,157,173,176],"functional":[27,71],"constraints":[28,72,95],"can":[29],"be":[30],"separated":[31],"into":[32],"2":[33],"blocks.":[34],"To":[35,170],"solve":[36],"problem,":[38],"introduce":[40],"a":[41,79],"new":[42,87],"inexact":[43],"linearized":[44],"alternating":[45],"direction":[46],"method":[47,125],"of":[48,61,69,89,123,178],"multipliers":[49],"(ADMM)":[50],"algorithm.":[51],"Specifically,":[52],"at":[53],"each":[54],"iteration,":[55],"linearize":[57],"smooth":[59],"part":[60,68],"within":[73,132],"augmented":[75],"Lagrangian":[76],"add":[78],"dynamic":[80],"quadratic":[81],"regularization.":[82],"then":[84],"compute":[85],"iterate":[88],"block":[91],"associated":[92],"inexactly.":[96],"This":[97],"strategy":[98],"yields":[99],"subproblems":[100],"are":[102],"easily":[103],"solvable":[104],"their":[106],"(inexact)":[107],"solutions":[108],"become":[109],"next":[111],"iterates.":[112],"Using":[113],"Lyapunov":[114],"arguments,":[115],"establish":[117],"convergence":[118,168],"guarantees":[119],"for":[120,185],"iterates":[122],"our":[124,162,179],"toward":[126],"an":[127],"$$\\epsilon":[128],"$$":[129],"-first-order":[130],"solution":[131],"$$\\mathcal":[133],"{O}(\\epsilon":[134],"^{-2})$$":[135],"iterations.":[136],"Moreover,":[137],"demonstrate":[139],"in":[141],"cases":[142],"where":[143],"problem":[145],"data":[146],"exhibit":[147],"e.g.,":[148],"semi-algebraic":[149],"properties":[150],"or":[151],"more":[152],"general":[153],"KL":[155],"condition,":[156],"entire":[158],"sequence":[159],"generated":[160],"by":[161],"algorithm":[163],"converges,":[164],"provide":[167],"rates.":[169],"validate":[171],"theory":[174],"performance":[177],"algorithm,":[180],"conduct":[182],"numerical":[183],"simulations":[184],"several":[186],"model":[188],"predictive":[189],"control":[190],"matrix":[192],"factorization":[193],"problems.":[194]},"counts_by_year":[],"updated_date":"2026-03-09T07:00:12.390032","created_date":"2025-10-10T00:00:00"}