{"id":"https://openalex.org/W2088765246","doi":"https://doi.org/10.1137/s1052623403426544","title":"Line Search Filter Methods for Nonlinear Programming: Local Convergence","display_name":"Line Search Filter Methods for Nonlinear Programming: Local Convergence","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2088765246","doi":"https://doi.org/10.1137/s1052623403426544","mag":"2088765246"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623403426544","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623403426544","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/A5112274231","display_name":"Andreas W\u00e4chter","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Andreas W\u00e4chter","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5052825722","display_name":"Lorenz T. Biegler","orcid":"https://orcid.org/0000-0003-3875-4441"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lorenz T. Biegler","raw_affiliation_strings":["Carnegie Mellon University"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5112274231"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.1921,"has_fulltext":false,"cited_by_count":196,"citation_normalized_percentile":{"value":0.9839761,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"16","issue":"1","first_page":"32","last_page":"48"},"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/T12661","display_name":"Iterative Methods for Nonlinear Equations","score":0.9976999759674072,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9914000034332275,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/line-search","display_name":"Line search","score":0.8056100606918335},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7735055685043335},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6607089638710022},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.6561700105667114},{"id":"https://openalex.org/keywords/local-convergence","display_name":"Local convergence","score":0.6405754685401917},{"id":"https://openalex.org/keywords/filter","display_name":"Filter (signal processing)","score":0.6178553700447083},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.6147863864898682},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5347902178764343},{"id":"https://openalex.org/keywords/trust-region","display_name":"Trust region","score":0.5328742861747742},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.5053830146789551},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.49465033411979675},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4780602753162384},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4256556034088135},{"id":"https://openalex.org/keywords/normal-convergence","display_name":"Normal convergence","score":0.41397055983543396},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3854873776435852},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.3458242118358612},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17816653847694397},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.10199862718582153},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.09674513339996338},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.07673650979995728}],"concepts":[{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.8056100606918335},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7735055685043335},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6607089638710022},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.6561700105667114},{"id":"https://openalex.org/C117898588","wikidata":"https://www.wikidata.org/wiki/Q6664310","display_name":"Local convergence","level":3,"score":0.6405754685401917},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.6178553700447083},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6147863864898682},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5347902178764343},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.5328742861747742},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.5053830146789551},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.49465033411979675},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4780602753162384},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4256556034088135},{"id":"https://openalex.org/C14928880","wikidata":"https://www.wikidata.org/wiki/Q1512559","display_name":"Normal convergence","level":4,"score":0.41397055983543396},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3854873776435852},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.3458242118358612},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17816653847694397},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.10199862718582153},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.09674513339996338},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.07673650979995728},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s1052623403426544","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623403426544","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W8821478","https://openalex.org/W147998453","https://openalex.org/W1976385924","https://openalex.org/W1993553082","https://openalex.org/W1997138910","https://openalex.org/W1997965167","https://openalex.org/W2048799772","https://openalex.org/W2062294426","https://openalex.org/W2075194837","https://openalex.org/W2077658674","https://openalex.org/W2085919628","https://openalex.org/W2108814972","https://openalex.org/W2141165361","https://openalex.org/W2527781137","https://openalex.org/W3029645440","https://openalex.org/W4212997115","https://openalex.org/W4293775970"],"related_works":["https://openalex.org/W2393577524","https://openalex.org/W1512804140","https://openalex.org/W2071870519","https://openalex.org/W2096616242","https://openalex.org/W2386509554","https://openalex.org/W2388030658","https://openalex.org/W833941023","https://openalex.org/W3206755693","https://openalex.org/W1971547401","https://openalex.org/W2088765246"],"abstract_inverted_index":{"A":[0,21],"line":[1],"search":[2],"method":[3,26,52],"is":[4,44,47,71],"proposed":[5,27,51],"for":[6],"nonlinear":[7],"programming":[8],"using":[9],"Fletcher":[10],"and":[11],"Leyffer's":[12],"filter":[13],"method,":[14],"which":[15],"replaces":[16],"the":[17,25,50,57],"traditional":[18],"merit":[19],"function.":[20],"simple":[22],"modification":[23],"of":[24],"in":[28],"a":[29],"companion":[30],"paper":[31],"[SIAM":[32],"J.":[33],"Optim.,":[34],"16":[35],"(2005),":[36],"pp.":[37],"1--31]":[38],"introducing":[39],"second":[40,66],"order":[41,67],"correction":[42],"steps":[43],"presented.":[45],"It":[46],"shown":[48],"that":[49,61],"does":[53],"not":[54],"suffer":[55],"from":[56],"Maratos":[58],"effect,":[59],"so":[60],"fast":[62],"local":[63,69],"convergence":[64],"to":[65],"sufficient":[68],"solutions":[70],"achieved.":[72]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":18},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":18},{"year":2013,"cited_by_count":15},{"year":2012,"cited_by_count":12}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}