{"id":"https://openalex.org/W2710596724","doi":"https://doi.org/10.1080/10556788.2017.1332618","title":"A matrix-free line-search algorithm for nonconvex optimization","display_name":"A matrix-free line-search algorithm for nonconvex optimization","publication_year":2017,"publication_date":"2017-06-21","ids":{"openalex":"https://openalex.org/W2710596724","doi":"https://doi.org/10.1080/10556788.2017.1332618","mag":"2710596724"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2017.1332618","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2017.1332618","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","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/A5101452490","display_name":"Wendy Zhou","orcid":"https://orcid.org/0000-0001-8226-375X"},"institutions":[{"id":"https://openalex.org/I122754148","display_name":"SAS Institute (United States)","ror":"https://ror.org/01093z329","country_code":"US","type":"company","lineage":["https://openalex.org/I122754148"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"W. Zhou","raw_affiliation_strings":["SAS Institute, Cary, NC, USA"],"affiliations":[{"raw_affiliation_string":"SAS Institute, Cary, NC, USA","institution_ids":["https://openalex.org/I122754148"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003778121","display_name":"Ioannis Akrotirianakis","orcid":null},"institutions":[{"id":"https://openalex.org/I122754148","display_name":"SAS Institute (United States)","ror":"https://ror.org/01093z329","country_code":"US","type":"company","lineage":["https://openalex.org/I122754148"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"I.G. Akrotirianakis","raw_affiliation_strings":["SAS Institute, Cary, NC, USA"],"affiliations":[{"raw_affiliation_string":"SAS Institute, Cary, NC, USA","institution_ids":["https://openalex.org/I122754148"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036869039","display_name":"S. Yektamaram","orcid":null},"institutions":[{"id":"https://openalex.org/I186143895","display_name":"Lehigh University","ror":"https://ror.org/012afjb06","country_code":"US","type":"education","lineage":["https://openalex.org/I186143895"]},{"id":"https://openalex.org/I122754148","display_name":"SAS Institute (United States)","ror":"https://ror.org/01093z329","country_code":"US","type":"company","lineage":["https://openalex.org/I122754148"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Yektamaram","raw_affiliation_strings":["Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, PA, USA","SAS Institute, Cary, NC, USA"],"affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, Lehigh University, Bethlehem, PA, USA","institution_ids":["https://openalex.org/I186143895"]},{"raw_affiliation_string":"SAS Institute, Cary, NC, USA","institution_ids":["https://openalex.org/I122754148"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079196169","display_name":"Joshua Griffin","orcid":"https://orcid.org/0000-0002-6738-0154"},"institutions":[{"id":"https://openalex.org/I122754148","display_name":"SAS Institute (United States)","ror":"https://ror.org/01093z329","country_code":"US","type":"company","lineage":["https://openalex.org/I122754148"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J.D. Griffin","raw_affiliation_strings":["SAS Institute, Cary, NC, USA"],"affiliations":[{"raw_affiliation_string":"SAS Institute, Cary, NC, USA","institution_ids":["https://openalex.org/I122754148"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5101452490"],"corresponding_institution_ids":["https://openalex.org/I122754148"],"apc_list":null,"apc_paid":null,"fwci":2.1271,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.86561265,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"34","issue":"1","first_page":"1","last_page":"24"},"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9991999864578247,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9977999925613403,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5606694221496582},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5459921956062317},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.5143519639968872},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.45737719535827637},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4263729155063629},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3850218951702118},{"id":"https://openalex.org/keywords/materials-science","display_name":"Materials science","score":0.1041351854801178}],"concepts":[{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5606694221496582},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5459921956062317},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.5143519639968872},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45737719535827637},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4263729155063629},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3850218951702118},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.1041351854801178},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556788.2017.1332618","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2017.1332618","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","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":35,"referenced_works":["https://openalex.org/W5734836","https://openalex.org/W71081281","https://openalex.org/W147998453","https://openalex.org/W196761320","https://openalex.org/W291003596","https://openalex.org/W1408639475","https://openalex.org/W1559779211","https://openalex.org/W1586056472","https://openalex.org/W1965278079","https://openalex.org/W1968553199","https://openalex.org/W1974888421","https://openalex.org/W1989427372","https://openalex.org/W2000389939","https://openalex.org/W2005660297","https://openalex.org/W2006903949","https://openalex.org/W2026079992","https://openalex.org/W2058885431","https://openalex.org/W2063690908","https://openalex.org/W2065000345","https://openalex.org/W2066516623","https://openalex.org/W2075194837","https://openalex.org/W2080851285","https://openalex.org/W2130984546","https://openalex.org/W2149454052","https://openalex.org/W2153978753","https://openalex.org/W2154589350","https://openalex.org/W2403040875","https://openalex.org/W2502655619","https://openalex.org/W2526664560","https://openalex.org/W3027959458","https://openalex.org/W3029645440","https://openalex.org/W3173138228","https://openalex.org/W4212997115","https://openalex.org/W4285719527","https://openalex.org/W4293775970"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2042127053","https://openalex.org/W2142036596","https://openalex.org/W2072657027"],"abstract_inverted_index":{"In":[0],"this":[1,78,102],"paper,":[2],"we":[3],"have":[4],"developed":[5],"a":[6,84],"new":[7,15],"algorithm":[8,16,52,134,169],"for":[9,56,87],"solving":[10,57],"nonconvex":[11,60,90],"large-scale":[12,59,88],"problems.":[13,130],"The":[14,67],"performs":[17],"explicit":[18,45],"matrix":[19],"modifications":[20,25],"adaptively,":[21],"mimicing":[22],"the":[23,33,51,71,75,81,99,110,125,132,138,141,153,157,167],"implicit":[24],"used":[26],"by":[27,152],"trust-region":[28,38],"methods.":[29],"Thus,":[30],"it":[31],"shares":[32],"equivalent":[34],"theoretical":[35],"strength":[36],"of":[37,77,83,101,109,113,128,143],"approaches,":[39],"without":[40],"needing":[41],"to":[42,124,136,166],"accommodate":[43],"an":[44],"step-size":[46],"constraint.":[47],"We":[48],"show":[49],"that":[50],"is":[53],"well":[54],"suited":[55],"very":[58],"problems":[61,73,96],"whenever":[62],"Hessian-vector":[63],"products":[64],"are":[65],"available.":[66],"numerical":[68],"results":[69],"on":[70],"CUTEr":[72],"demonstrate":[74],"effectiveness":[76],"approach":[79,159],"in":[80,94],"context":[82],"line-search":[85],"method":[86],"unconstrained":[89],"optimization.":[91],"Moreover,":[92,156],"applications":[93],"deep-learning":[95,129],"further":[97],"illustrate":[98],"usefulness":[100],"algorithm.":[103],"It":[104],"does":[105],"not":[106],"share":[107],"any":[108],"prohibitive":[111],"traits":[112],"popular":[114],"matrix-free":[115],"algorithms":[116],"such":[117],"as":[118],"truncated":[119],"conjugate":[120],"gradient":[121],"(CG)":[122],"due":[123],"difficult":[126],"nature":[127],"Thus":[131],"proposed":[133,158],"serves":[135],"bridge":[137],"gap":[139],"between":[140],"needs":[142],"data-mining":[144],"community":[145],"and":[146,174],"existing":[147],"state-of-the-art":[148],"approaches":[149],"embraced":[150],"foremost":[151],"optimization":[154],"community.":[155],"can":[160],"be":[161],"realized":[162],"with":[163,171],"minimal":[164],"modification":[165],"CG":[168],"itself":[170],"negligible":[172],"storage":[173],"computational":[175],"overhead.":[176]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}