{"id":"https://openalex.org/W1998720717","doi":"https://doi.org/10.1137/08071524x","title":"A Line Search Multigrid Method for Large-Scale Nonlinear Optimization","display_name":"A Line Search Multigrid Method for Large-Scale Nonlinear Optimization","publication_year":2009,"publication_date":"2009-12-02","ids":{"openalex":"https://openalex.org/W1998720717","doi":"https://doi.org/10.1137/08071524x","mag":"1998720717"},"language":"en","primary_location":{"id":"doi:10.1137/08071524x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/08071524x","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/A5006127137","display_name":"Zaiwen Wen","orcid":"https://orcid.org/0000-0003-1762-0671"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Zaiwen Wen","raw_affiliation_strings":["zw2109@columbia.edu and goldfarb@columbia.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"zw2109@columbia.edu and goldfarb@columbia.edu#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5027297328","display_name":"Donald Goldfarb","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Donald Goldfarb","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5006127137"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4182,"has_fulltext":false,"cited_by_count":40,"citation_normalized_percentile":{"value":0.81151096,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"20","issue":"3","first_page":"1478","last_page":"1503"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10339","display_name":"Advanced Numerical Methods in Computational Mathematics","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10339","display_name":"Advanced Numerical Methods in Computational Mathematics","score":0.9997000098228455,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9983000159263611,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9976000189781189,"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/line-search","display_name":"Line search","score":0.9180015325546265},{"id":"https://openalex.org/keywords/multigrid-method","display_name":"Multigrid method","score":0.7626444101333618},{"id":"https://openalex.org/keywords/broyden\u2013fletcher\u2013goldfarb\u2013shanno-algorithm","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","score":0.7024585008621216},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.682772696018219},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6715875267982483},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6414653062820435},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5377281904220581},{"id":"https://openalex.org/keywords/descent","display_name":"Descent (aeronautics)","score":0.5235416889190674},{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.5183618664741516},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.5052784085273743},{"id":"https://openalex.org/keywords/descent-direction","display_name":"Descent direction","score":0.5040478110313416},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.45595669746398926},{"id":"https://openalex.org/keywords/quasi-newton-method","display_name":"Quasi-Newton method","score":0.4502696990966797},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41324591636657715},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4115650951862335},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.35115134716033936},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3120603561401367},{"id":"https://openalex.org/keywords/newtons-method","display_name":"Newton's method","score":0.3117390275001526},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.2019001841545105},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.1220371425151825}],"concepts":[{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.9180015325546265},{"id":"https://openalex.org/C137119250","wikidata":"https://www.wikidata.org/wiki/Q1413101","display_name":"Multigrid method","level":3,"score":0.7626444101333618},{"id":"https://openalex.org/C132721684","wikidata":"https://www.wikidata.org/wiki/Q2877013","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","level":3,"score":0.7024585008621216},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.682772696018219},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6715875267982483},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6414653062820435},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5377281904220581},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.5235416889190674},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.5183618664741516},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.5052784085273743},{"id":"https://openalex.org/C116149140","wikidata":"https://www.wikidata.org/wiki/Q2070951","display_name":"Descent direction","level":4,"score":0.5040478110313416},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.45595669746398926},{"id":"https://openalex.org/C114954040","wikidata":"https://www.wikidata.org/wiki/Q1476018","display_name":"Quasi-Newton method","level":4,"score":0.4502696990966797},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41324591636657715},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4115650951862335},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.35115134716033936},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3120603561401367},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.3117390275001526},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.2019001841545105},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.1220371425151825},{"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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","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/C93779851","wikidata":"https://www.wikidata.org/wiki/Q271977","display_name":"Partial differential equation","level":2,"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/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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","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/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/08071524x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/08071524x","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.212.147","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.212.147","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.columbia.edu/~zw2109/paper/MultigridNonConvexUnc1.pdf","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":31,"referenced_works":["https://openalex.org/W90568776","https://openalex.org/W230200314","https://openalex.org/W1516754946","https://openalex.org/W1530872699","https://openalex.org/W1547688086","https://openalex.org/W1572639095","https://openalex.org/W1579057532","https://openalex.org/W1970659509","https://openalex.org/W1976222070","https://openalex.org/W1976792725","https://openalex.org/W1984648213","https://openalex.org/W2003106321","https://openalex.org/W2006907844","https://openalex.org/W2038253697","https://openalex.org/W2039625138","https://openalex.org/W2049974290","https://openalex.org/W2058839679","https://openalex.org/W2068484625","https://openalex.org/W2068586469","https://openalex.org/W2077008103","https://openalex.org/W2085522030","https://openalex.org/W2105862333","https://openalex.org/W2115178538","https://openalex.org/W2134847890","https://openalex.org/W2139081976","https://openalex.org/W2151317657","https://openalex.org/W2296319761","https://openalex.org/W2471988522","https://openalex.org/W3029645440","https://openalex.org/W4233732544","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4293559771","https://openalex.org/W2092087339","https://openalex.org/W2768763952","https://openalex.org/W2615612939","https://openalex.org/W1993453088","https://openalex.org/W2067207573","https://openalex.org/W2010088179","https://openalex.org/W2761098424","https://openalex.org/W2563719283","https://openalex.org/W2949437822"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,27,36,45,53,66,87],"line":[3,55,105],"search":[4,56,106],"multigrid":[5,107],"method":[6,80,92],"for":[7],"solving":[8],"discretized":[9],"versions":[10],"of":[11],"general":[12],"unconstrained":[13],"infinite-dimensional":[14],"optimization":[15],"problems.":[16],"At":[17],"each":[18,21],"iteration":[19],"on":[20,31,77],"level,":[22],"the":[23,32,58,78,95],"algorithm":[24],"computes":[25],"either":[26],"\u201cdirect":[28,96],"search\u201d":[29,38,60,97],"direction":[30,39,61],"current":[33],"level":[34,42],"or":[35],"\u201crecursive":[37,59],"from":[40],"coarser":[41],"models.":[43],"Introducing":[44],"new":[46],"condition":[47],"that":[48,103],"must":[49],"be":[50,65],"satisfied":[51],"by":[52],"backtracking":[54],"procedure,":[57],"is":[62,71,109],"guaranteed":[63],"to":[64,93],"descent":[67],"direction.":[68],"Global":[69],"convergence":[70],"proved":[72],"under":[73],"fairly":[74],"minimal":[75],"requirements":[76],"minimization":[79],"used":[81],"at":[82],"all":[83],"grid":[84],"levels.":[85],"Using":[86],"limited":[88],"memory":[89],"BFGS":[90],"quasi-Newton":[91],"produce":[94],"direction,":[98],"preliminary":[99],"numerical":[100],"experiments":[101],"show":[102],"our":[104],"approach":[108],"promising.":[110]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}