{"id":"https://openalex.org/W2158288046","doi":"https://doi.org/10.1080/10556780701223970","title":"Local convergence of an augmented Lagrangian method for matrix inequality constrained programming","display_name":"Local convergence of an augmented Lagrangian method for matrix inequality constrained programming","publication_year":2007,"publication_date":"2007-08-22","ids":{"openalex":"https://openalex.org/W2158288046","doi":"https://doi.org/10.1080/10556780701223970","mag":"2158288046"},"language":"en","primary_location":{"id":"doi:10.1080/10556780701223970","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780701223970","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","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/A5030567369","display_name":"Dominikus Noll","orcid":"https://orcid.org/0000-0002-8638-2438"},"institutions":[{"id":"https://openalex.org/I134560555","display_name":"Universit\u00e9 Toulouse III - Paul Sabatier","ror":"https://ror.org/02v6kpv12","country_code":"FR","type":"education","lineage":["https://openalex.org/I134560555","https://openalex.org/I4405258862"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Dominikus Noll","raw_affiliation_strings":["Universit\u00e9 Paul Sabatier, Institut de Math\u00e9matiques , 118, route de Narbonne, 31062, Toulouse, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Paul Sabatier, Institut de Math\u00e9matiques , 118, route de Narbonne, 31062, Toulouse, France","institution_ids":["https://openalex.org/I134560555"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5030567369"],"corresponding_institution_ids":["https://openalex.org/I134560555"],"apc_list":null,"apc_paid":null,"fwci":2.5389,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.89359214,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"22","issue":"5","first_page":"777","last_page":"802"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"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.9998000264167786,"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.9994999766349792,"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.9957000017166138,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/augmented-lagrangian-method","display_name":"Augmented Lagrangian method","score":0.8912244439125061},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.7063158750534058},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7024847865104675},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.6005395650863647},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.596354603767395},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.5421676635742188},{"id":"https://openalex.org/keywords/local-convergence","display_name":"Local convergence","score":0.5258522629737854},{"id":"https://openalex.org/keywords/compact-convergence","display_name":"Compact convergence","score":0.5150344371795654},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5085660219192505},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.49932074546813965},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.47841721773147583},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.4512384235858917},{"id":"https://openalex.org/keywords/modes-of-convergence","display_name":"Modes of convergence (annotated index)","score":0.4375261068344116},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4225625991821289},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.2566372752189636},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.2132968306541443},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1728936731815338},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.09922948479652405}],"concepts":[{"id":"https://openalex.org/C150452318","wikidata":"https://www.wikidata.org/wiki/Q4820432","display_name":"Augmented Lagrangian method","level":2,"score":0.8912244439125061},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.7063158750534058},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7024847865104675},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.6005395650863647},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.596354603767395},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.5421676635742188},{"id":"https://openalex.org/C117898588","wikidata":"https://www.wikidata.org/wiki/Q6664310","display_name":"Local convergence","level":3,"score":0.5258522629737854},{"id":"https://openalex.org/C5871375","wikidata":"https://www.wikidata.org/wiki/Q1780715","display_name":"Compact convergence","level":4,"score":0.5150344371795654},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5085660219192505},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.49932074546813965},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.47841721773147583},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4512384235858917},{"id":"https://openalex.org/C48216909","wikidata":"https://www.wikidata.org/wiki/Q6889156","display_name":"Modes of convergence (annotated index)","level":5,"score":0.4375261068344116},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4225625991821289},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.2566372752189636},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.2132968306541443},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1728936731815338},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.09922948479652405},{"id":"https://openalex.org/C47776270","wikidata":"https://www.wikidata.org/wiki/Q1455249","display_name":"Topological vector space","level":3,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"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/C81332173","wikidata":"https://www.wikidata.org/wiki/Q179899","display_name":"Topological space","level":2,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C174265945","wikidata":"https://www.wikidata.org/wiki/Q1142889","display_name":"Isolated point","level":4,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1080/10556780701223970","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780701223970","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.141.7915","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.141.7915","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://mip.ups-tlse.fr/~noll/PAPERS/alpen.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.154.6686","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.6686","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://mip.ups-tlse.fr/~noll/PAPERS/oms2.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00635896v1","is_oa":false,"landing_page_url":"https://hal.archives-ouvertes.fr/hal-00635896","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN: 1055-6788","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:HAL:hal-01868772v1","is_oa":false,"landing_page_url":"https://hal.science/hal-01868772","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Optimization Methods and Software, 2007, 22 (5), pp.777 - 802. ⟨10.1080/10556780701223970⟩","raw_type":"Journal articles"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5899999737739563,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W133145907","https://openalex.org/W572922989","https://openalex.org/W1507226278","https://openalex.org/W1521232115","https://openalex.org/W1601741115","https://openalex.org/W1669104078","https://openalex.org/W1967969202","https://openalex.org/W1974345178","https://openalex.org/W1979968848","https://openalex.org/W1981188096","https://openalex.org/W1982203621","https://openalex.org/W1982604350","https://openalex.org/W1993433915","https://openalex.org/W2000353557","https://openalex.org/W2001473319","https://openalex.org/W2007179152","https://openalex.org/W2007421997","https://openalex.org/W2012604200","https://openalex.org/W2013621063","https://openalex.org/W2025051282","https://openalex.org/W2029383729","https://openalex.org/W2037091587","https://openalex.org/W2039606278","https://openalex.org/W2042613327","https://openalex.org/W2051306216","https://openalex.org/W2055506505","https://openalex.org/W2057624533","https://openalex.org/W2063973166","https://openalex.org/W2079629485","https://openalex.org/W2090839010","https://openalex.org/W2094507464","https://openalex.org/W2101926728","https://openalex.org/W2123556725","https://openalex.org/W2132385139","https://openalex.org/W2135930989","https://openalex.org/W2145040771","https://openalex.org/W2145546299","https://openalex.org/W2161496432","https://openalex.org/W2495457432","https://openalex.org/W2612868624","https://openalex.org/W2798766386","https://openalex.org/W4230278445","https://openalex.org/W4285719527","https://openalex.org/W6666476492"],"related_works":["https://openalex.org/W2214864235","https://openalex.org/W4223624423","https://openalex.org/W2770097049","https://openalex.org/W2955848303","https://openalex.org/W3211129031","https://openalex.org/W4206353209","https://openalex.org/W4316804597","https://openalex.org/W2520766194","https://openalex.org/W4296991225","https://openalex.org/W2168680847"],"abstract_inverted_index":{"We":[0,15],"consider":[1],"nonlinear":[2,12],"optimization":[3],"programs":[4],"with":[5],"matrix":[6],"inequality":[7],"constraints,":[8],"also":[9],"known":[10],"as":[11],"semidefinite":[13],"programs.":[14],"prove":[16,45],"local":[17,46],"convergence":[18,48],"for":[19],"an":[20],"augmented":[21],"Lagrangian":[22],"method":[23],"which":[24],"uses":[25],"smooth":[26],"spectral":[27],"penalty":[28,55],"functions.":[29],"The":[30],"sufficient":[31],"second-order":[32],"no-gap":[33],"optimality":[34],"condition":[35],"and":[36],"a":[37],"suitable":[38],"implicit":[39],"function":[40],"theorem":[41],"are":[42],"used":[43],"to":[44,52,57],"linear":[47],"without":[49],"the":[50,54],"need":[51],"drive":[53],"parameter":[56],"0.":[58]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":5}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}