{"id":"https://openalex.org/W2099959094","doi":"https://doi.org/10.1137/s1052623493251463","title":"Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints","display_name":"Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints","publication_year":1996,"publication_date":"1996-08-01","ids":{"openalex":"https://openalex.org/W2099959094","doi":"https://doi.org/10.1137/s1052623493251463","mag":"2099959094"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623493251463","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623493251463","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/A5103149740","display_name":"Andrew R. Conn","orcid":"https://orcid.org/0000-0001-7470-1035"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. R. Conn","raw_affiliation_strings":["IBM T.J. Watson research Center"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM T.J. Watson research Center","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007869277","display_name":"Nicholas I. M. Gould","orcid":"https://orcid.org/0000-0002-1031-1588"},"institutions":[{"id":"https://openalex.org/I1286704778","display_name":"Rutherford Appleton Laboratory","ror":"https://ror.org/03gq8fr08","country_code":"GB","type":"facility","lineage":["https://openalex.org/I1286704778","https://openalex.org/I162524378","https://openalex.org/I4210087105"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"N. Gould","raw_affiliation_strings":["Rutherford Appleton Laboratory"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutherford Appleton Laboratory","institution_ids":["https://openalex.org/I1286704778"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108097617","display_name":"Annick Sartenaer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"A. Sartenaer","raw_affiliation_strings":["D\u00e9partement de Math\u00e9matique"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"D\u00e9partement de Math\u00e9matique","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002913605","display_name":"Philippe L. Toint","orcid":"https://orcid.org/0000-0002-6166-1860"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ph. L. Toint","raw_affiliation_strings":["D\u00e9partement de Math\u00e9matique"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"D\u00e9partement de Math\u00e9matique","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.9264,"has_fulltext":false,"cited_by_count":112,"citation_normalized_percentile":{"value":0.86550778,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"6","issue":"3","first_page":"674","last_page":"703"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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.9929999709129333,"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.991599977016449,"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/augmented-lagrangian-method","display_name":"Augmented Lagrangian method","score":0.9230208396911621},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7494895458221436},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.730390727519989},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6323480010032654},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5900100469589233},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.5830060839653015},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5824525356292725},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5731698274612427},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.47406667470932007},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.43295007944107056},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4194800555706024},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41634005308151245}],"concepts":[{"id":"https://openalex.org/C150452318","wikidata":"https://www.wikidata.org/wiki/Q4820432","display_name":"Augmented Lagrangian method","level":2,"score":0.9230208396911621},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7494895458221436},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.730390727519989},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6323480010032654},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5900100469589233},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.5830060839653015},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5824525356292725},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5731698274612427},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.47406667470932007},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.43295007944107056},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4194800555706024},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41634005308151245},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/s1052623493251463","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623493251463","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:cds.cern.ch:277875","is_oa":false,"landing_page_url":"http://cds.cern.ch/record/277875","pdf_url":null,"source":{"id":"https://openalex.org/S4306402195","display_name":"CERN Document Server (European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:dial.uclouvain.be:boreal:99739","is_oa":false,"landing_page_url":"http://hdl.handle.net/2078.2/99739","pdf_url":null,"source":{"id":"https://openalex.org/S4306401974","display_name":"DIAL (Catholic University of Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Optimization, Vol. 6, no. 3, p. 674-703 (1996)","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:epubs.cclrc.ac.uk:work/26016","is_oa":false,"landing_page_url":"http://purl.org/net/epubs/work/26016","pdf_url":null,"source":{"id":"https://openalex.org/S4306400334","display_name":"Science and Technology Facilities Council","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:purl.org/net/epubs:work/12165088","is_oa":false,"landing_page_url":"http://purl.org/net/epubs/work/12165088","pdf_url":null,"source":{"id":"https://openalex.org/S4306400334","display_name":"Science and Technology Facilities Council","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.6200000047683716}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1502501036","https://openalex.org/W1548713535","https://openalex.org/W1559779211","https://openalex.org/W1572204513","https://openalex.org/W1590012787","https://openalex.org/W1669104078","https://openalex.org/W1995202706","https://openalex.org/W2030490984","https://openalex.org/W2035741312","https://openalex.org/W2042613327","https://openalex.org/W2049421260","https://openalex.org/W2057624533","https://openalex.org/W2057697122","https://openalex.org/W2066746998","https://openalex.org/W2077658674","https://openalex.org/W2090243370","https://openalex.org/W2090523290","https://openalex.org/W2095169737","https://openalex.org/W2168665351","https://openalex.org/W3012317737","https://openalex.org/W3111467837","https://openalex.org/W4212997115","https://openalex.org/W4237209688","https://openalex.org/W4252894371","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2360271985","https://openalex.org/W2131718214","https://openalex.org/W2027659296","https://openalex.org/W4313189992","https://openalex.org/W2002987466","https://openalex.org/W2070276483","https://openalex.org/W2615021531","https://openalex.org/W2061155636","https://openalex.org/W1903454366","https://openalex.org/W2076134677"],"abstract_inverted_index":{"We":[0],"consider":[1,89],"the":[2,39,58,65,69,117,125,128],"global":[3,139],"and":[4,24,137,140],"local":[5],"convergence":[6,126,143],"properties":[7],"of":[8,11,49,53,116,127,130],"a":[9,51,79],"class":[10],"augmented":[12,44,59],"Lagrangian":[13,60],"methods":[14],"for":[15,99],"solving":[16,50],"nonlinear":[17],"programming":[18],"problems.":[19],"In":[20,120],"these":[21],"methods,":[22],"linear":[23,70,142],"more":[25],"general":[26,34,118],"constraints":[27,35],"are":[28,36],"handled":[29],"in":[30,42,55,64,95],"different":[31,107],"ways.":[32],"The":[33,46,84],"combined":[37],"with":[38,113],"objective":[40],"function":[41],"an":[43,135],"Lagrangian.":[45],"iteration":[47],"consists":[48],"sequence":[52,129],"subproblems;":[54],"each":[56],"subproblem":[57,73],"is":[61,74,82],"approximately":[62],"minimized":[63],"region":[66],"defined":[67],"by":[68,133],"constraints.":[71,119],"A":[72],"terminated":[75],"as":[76,78,144,146],"soon":[77],"stopping":[80,85],"condition":[81],"satisfied.":[83],"rules":[86],"that":[87,148],"we":[88,123],"here":[90],"encompass":[91],"practical":[92],"tests":[93],"used":[94],"several":[96],"existing":[97],"packages":[98],"linearly":[100],"constrained":[101],"optimization.":[102],"Our":[103],"algorithm":[104,136],"also":[105],"allows":[106],"penalty":[108,151],"parameters":[109,152],"to":[110],"be":[111],"associated":[112],"disjoint":[114],"subsets":[115],"this":[121],"paper,":[122],"analyze":[124],"iterates":[131],"generated":[132],"such":[134],"prove":[138],"fast":[141],"well":[145],"show":[147],"potentially":[149],"troublesome":[150],"remain":[153],"bounded":[154],"away":[155],"from":[156],"zero.":[157]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":8}],"updated_date":"2026-06-23T13:55:30.953635","created_date":"2025-10-10T00:00:00"}