{"id":"https://openalex.org/W1967581563","doi":"https://doi.org/10.1137/s1052623497316026","title":"A Global Convergence Analysis of an Algorithm for Large-Scale Nonlinear Optimization Problems","display_name":"A Global Convergence Analysis of an Algorithm for Large-Scale Nonlinear Optimization Problems","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W1967581563","doi":"https://doi.org/10.1137/s1052623497316026","mag":"1967581563"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623497316026","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623497316026","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/A5055227859","display_name":"Paul T. Boggs","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Paul T. Boggs","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011525108","display_name":"Anthony J. Kearsley","orcid":"https://orcid.org/0000-0002-9576-0621"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anthony J. Kearsley","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5054755159","display_name":"Jon W. Tolle","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jon W. Tolle","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5055227859"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.5269,"has_fulltext":false,"cited_by_count":48,"citation_normalized_percentile":{"value":0.87342271,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"9","issue":"4","first_page":"833","last_page":"862"},"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.9966999888420105,"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/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.9965000152587891,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.8004416823387146},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.7723066806793213},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.7532075643539429},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6652750968933105},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6495447158813477},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.6190982460975647},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6178695559501648},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5848013162612915},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.5495343804359436},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.5363491773605347},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.49344101548194885},{"id":"https://openalex.org/keywords/trust-region","display_name":"Trust region","score":0.4683952331542969},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.4328484535217285},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4325668215751648},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4241907000541687},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.3821331262588501},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2698162794113159}],"concepts":[{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.8004416823387146},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.7723066806793213},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7532075643539429},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6652750968933105},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6495447158813477},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.6190982460975647},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6178695559501648},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5848013162612915},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.5495343804359436},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.5363491773605347},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.49344101548194885},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.4683952331542969},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.4328484535217285},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4325668215751648},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4241907000541687},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.3821331262588501},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2698162794113159},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"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/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","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/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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s1052623497316026","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623497316026","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:CiteSeerX.psu:10.1.1.42.6846","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.6846","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://csmr.ca.sandia.gov/~ptboggs/pubs/theory.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W248084129","https://openalex.org/W1502501036","https://openalex.org/W1601541039","https://openalex.org/W1999895462","https://openalex.org/W2013261078","https://openalex.org/W2040016978","https://openalex.org/W2069752241","https://openalex.org/W2072274072","https://openalex.org/W2083431695","https://openalex.org/W2098918699","https://openalex.org/W2108814972","https://openalex.org/W2119079709","https://openalex.org/W2149416133","https://openalex.org/W2174582422","https://openalex.org/W2461327536","https://openalex.org/W2808829785"],"related_works":["https://openalex.org/W1555927645","https://openalex.org/W2119283772","https://openalex.org/W1548320777","https://openalex.org/W4206704743","https://openalex.org/W436931041","https://openalex.org/W2098918699","https://openalex.org/W2019128690","https://openalex.org/W1495847109","https://openalex.org/W2390817143","https://openalex.org/W2058475249"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"give":[4],"a":[5,10,77,89,117],"global":[6],"convergence":[7],"analysis":[8],"of":[9,13,39,62,70,76,85,91],"basic":[11,54],"version":[12],"an":[14,104],"SQP":[15],"algorithm":[16,55,72],"described":[17],"in":[18],"[P.":[19],"T.":[20],"Boggs,":[21],"A.":[22],"J.":[23,26,30],"Kearsley,":[24],"and":[25,47,88],"W.":[27],"Tolle,":[28],"SIAM":[29],"Optim.,":[31],"9":[32],"(1999),":[33],"pp.":[34],"755--778]":[35],"for":[36],"the":[37,53,58,71,74,83,86],"solution":[38],"large-scale":[40],"nonlinear":[41],"inequality-constrained":[42],"optimization":[43],"problems.":[44],"Several":[45],"procedures":[46],"options":[48],"have":[49],"been":[50],"added":[51],"to":[52,56,81,99,115],"improve":[57],"practical":[59],"performance;":[60],"some":[61],"these":[63],"are":[64,96],"also":[65,102],"analyzed.":[66],"The":[67],"important":[68],"features":[69],"include":[73],"use":[75],"constrained":[78],"merit":[79,93],"function":[80],"assess":[82],"progress":[84],"iterates":[87],"sequence":[90],"approximate":[92],"functions":[94],"that":[95,110],"less":[97],"expensive":[98],"evaluate.":[100],"It":[101],"employs":[103],"interior":[105],"point":[106],"quadratic":[107],"programming":[108],"solver":[109],"can":[111],"be":[112],"terminated":[113],"early":[114],"produce":[116],"truncated":[118],"step.":[119]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}