{"id":"https://openalex.org/W2167137033","doi":"https://doi.org/10.1137/s1052623403428208","title":"A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization","display_name":"A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2167137033","doi":"https://doi.org/10.1137/s1052623403428208","mag":"2167137033"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623403428208","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623403428208","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/A5101893795","display_name":"Hongchao Zhang","orcid":"https://orcid.org/0000-0003-2518-6975"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Hongchao Zhang","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5002362913","display_name":"William W. Hager","orcid":"https://orcid.org/0000-0003-3132-7017"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"William W. Hager","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101893795"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.5236,"has_fulltext":false,"cited_by_count":613,"citation_normalized_percentile":{"value":0.96189024,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":"14","issue":"4","first_page":"1043","last_page":"1056"},"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.9950000047683716,"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/T12661","display_name":"Iterative Methods for Nonlinear Equations","score":0.9916999936103821,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/line-search","display_name":"Line search","score":0.9334249496459961},{"id":"https://openalex.org/keywords/broyden\u2013fletcher\u2013goldfarb\u2013shanno-algorithm","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","score":0.8722905516624451},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7526891827583313},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.73971027135849},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6260467171669006},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5768254995346069},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5605846047401428},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.5070896148681641},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.4699528217315674},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.45845550298690796},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.45353931188583374},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.443628191947937},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17945921421051025},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.10425999760627747}],"concepts":[{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.9334249496459961},{"id":"https://openalex.org/C132721684","wikidata":"https://www.wikidata.org/wiki/Q2877013","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","level":3,"score":0.8722905516624451},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7526891827583313},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.73971027135849},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6260467171669006},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5768254995346069},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5605846047401428},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.5070896148681641},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4699528217315674},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.45845550298690796},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.45353931188583374},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.443628191947937},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17945921421051025},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10425999760627747},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"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/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s1052623403428208","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623403428208","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1546266651","https://openalex.org/W1967942590","https://openalex.org/W1968553199","https://openalex.org/W1973734200","https://openalex.org/W1982067912","https://openalex.org/W1993650230","https://openalex.org/W2012341322","https://openalex.org/W2012766316","https://openalex.org/W2022090011","https://openalex.org/W2043430160","https://openalex.org/W2051434435","https://openalex.org/W2051669046","https://openalex.org/W2053983905","https://openalex.org/W2056603712","https://openalex.org/W2076605490","https://openalex.org/W2118700449","https://openalex.org/W3214846105"],"related_works":["https://openalex.org/W2360946740","https://openalex.org/W2349203978","https://openalex.org/W2587634790","https://openalex.org/W2376916475","https://openalex.org/W3078710903","https://openalex.org/W2960088919","https://openalex.org/W3194711412","https://openalex.org/W2050511877","https://openalex.org/W2560766380","https://openalex.org/W2167137033"],"abstract_inverted_index":{"A":[0],"new":[1,80],"nonmonotone":[2,27,81,100],"line":[3,82],"search":[4,83],"algorithm":[5,84],"is":[6],"proposed":[7],"and":[8,32,59,70,88],"analyzed.":[9],"In":[10],"our":[11],"scheme,":[12],"we":[13],"require":[14],"that":[15,43],"an":[16],"average":[17],"of":[18,29,46],"the":[19,25,67,71,76,79,95,98],"successive":[20],"function":[21,48,87],"values":[22,49],"decreases,":[23],"while":[24],"traditional":[26,99],"approach":[28],"Grippo,":[30],"Lampariello,":[31],"Lucidi":[33],"[SIAM":[34],"J.":[35],"Numer.":[36],"Anal.,":[37],"23":[38],"(1986),":[39],"pp.":[40],"707--716]":[41],"requires":[42],"a":[44],"maximum":[45],"recent":[47],"decreases.":[50],"We":[51],"prove":[52],"global":[53],"convergence":[54,61],"for":[55,62],"nonconvex,":[56],"smooth":[57],"functions,":[58],"R-linear":[60],"strongly":[63],"convex":[64],"functions.":[65],"For":[66],"L-BFGS":[68],"method":[69],"unconstrained":[72],"optimization":[73],"problems":[74],"in":[75],"CUTE":[77],"library,":[78],"used":[85],"fewer":[86],"gradient":[89],"evaluations,":[90],"on":[91],"average,":[92],"than":[93],"either":[94],"monotone":[96],"or":[97],"scheme.":[101]},"counts_by_year":[{"year":2026,"cited_by_count":10},{"year":2025,"cited_by_count":45},{"year":2024,"cited_by_count":33},{"year":2023,"cited_by_count":49},{"year":2022,"cited_by_count":42},{"year":2021,"cited_by_count":43},{"year":2020,"cited_by_count":36},{"year":2019,"cited_by_count":34},{"year":2018,"cited_by_count":30},{"year":2017,"cited_by_count":47},{"year":2016,"cited_by_count":38},{"year":2015,"cited_by_count":48},{"year":2014,"cited_by_count":29},{"year":2013,"cited_by_count":43},{"year":2012,"cited_by_count":21}],"updated_date":"2026-03-29T08:15:47.926485","created_date":"2025-10-10T00:00:00"}