{"id":"https://openalex.org/W2035815925","doi":"https://doi.org/10.1137/s105262349427577x","title":"Cost Approximation: A Unified Framework of Descent Algorithms for Nonlinear Programs","display_name":"Cost Approximation: A Unified Framework of Descent Algorithms for Nonlinear Programs","publication_year":1998,"publication_date":"1998-05-01","ids":{"openalex":"https://openalex.org/W2035815925","doi":"https://doi.org/10.1137/s105262349427577x","mag":"2035815925"},"language":"en","primary_location":{"id":"doi:10.1137/s105262349427577x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s105262349427577x","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/A5008055628","display_name":"Michael Patriksson","orcid":"https://orcid.org/0000-0001-7675-7454"},"institutions":[{"id":"https://openalex.org/I66862912","display_name":"Chalmers University of Technology","ror":"https://ror.org/040wg7k59","country_code":"SE","type":"education","lineage":["https://openalex.org/I66862912"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Michael Patriksson","raw_affiliation_strings":["Chalmers University of Technology;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Chalmers University of Technology;","institution_ids":["https://openalex.org/I66862912"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5008055628"],"corresponding_institution_ids":["https://openalex.org/I66862912"],"apc_list":null,"apc_paid":null,"fwci":2.0078,"has_fulltext":false,"cited_by_count":40,"citation_normalized_percentile":{"value":0.86153699,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"8","issue":"2","first_page":"561","last_page":"582"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9995999932289124,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9994000196456909,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.986299991607666,"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/generality","display_name":"Generality","score":0.6729118824005127},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6582619547843933},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6560826301574707},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6284552812576294},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6195203065872192},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.6014106869697571},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.5643568634986877},{"id":"https://openalex.org/keywords/descent-direction","display_name":"Descent direction","score":0.549027681350708},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.5037135481834412},{"id":"https://openalex.org/keywords/descent","display_name":"Descent (aeronautics)","score":0.49024516344070435},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.45023971796035767},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.44718655943870544},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4457799792289734},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.44469499588012695},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32782799005508423},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.3136361241340637},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06930005550384521}],"concepts":[{"id":"https://openalex.org/C2780767217","wikidata":"https://www.wikidata.org/wiki/Q5532421","display_name":"Generality","level":2,"score":0.6729118824005127},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6582619547843933},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6560826301574707},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6284552812576294},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6195203065872192},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6014106869697571},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.5643568634986877},{"id":"https://openalex.org/C116149140","wikidata":"https://www.wikidata.org/wiki/Q2070951","display_name":"Descent direction","level":4,"score":0.549027681350708},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.5037135481834412},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.49024516344070435},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.45023971796035767},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.44718655943870544},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4457799792289734},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.44469499588012695},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32782799005508423},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.3136361241340637},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06930005550384521},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","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/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"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/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","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/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/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}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1137/s105262349427577x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s105262349427577x","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.47.7775","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.7775","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.chalmers.se/~mipat/./LATEX/SIAMopt.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.49.8266","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.49.8266","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.md.chalmers.se/~mipat/./LATEX/SIAMOsub.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.54.4284","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.4284","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.liu.se/~mipat/./LATEX/SIAMOsub.ps.Z","raw_type":"text"},{"id":"pmh:oai:publications.lib.chalmers.se:141629","is_oa":false,"landing_page_url":"http://publications.lib.chalmers.se/publication/141629-cost-approximation-a-unified-framework-of-descent-algorithms-for-nonlinear-programs","pdf_url":null,"source":{"id":"https://openalex.org/S4377196470","display_name":"Chalmers Publication Library (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text.Article.Journal.PeerReviewed"},{"id":"pmh:oai:research.chalmers.se:141629","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/141629","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.6200000047683716}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":47,"referenced_works":["https://openalex.org/W189222774","https://openalex.org/W585015008","https://openalex.org/W593475726","https://openalex.org/W1494436834","https://openalex.org/W1528330203","https://openalex.org/W1568288633","https://openalex.org/W1582617215","https://openalex.org/W1965159235","https://openalex.org/W1969811075","https://openalex.org/W1977777650","https://openalex.org/W1981042292","https://openalex.org/W1987635542","https://openalex.org/W1996981733","https://openalex.org/W2000151369","https://openalex.org/W2013243898","https://openalex.org/W2015263936","https://openalex.org/W2024970792","https://openalex.org/W2026265548","https://openalex.org/W2027593960","https://openalex.org/W2029020144","https://openalex.org/W2035197209","https://openalex.org/W2038497950","https://openalex.org/W2038614136","https://openalex.org/W2040006905","https://openalex.org/W2042261731","https://openalex.org/W2047620357","https://openalex.org/W2048742402","https://openalex.org/W2052725501","https://openalex.org/W2053386824","https://openalex.org/W2058532290","https://openalex.org/W2064417161","https://openalex.org/W2073584813","https://openalex.org/W2078458933","https://openalex.org/W2085315287","https://openalex.org/W2090963365","https://openalex.org/W2116174279","https://openalex.org/W2132677982","https://openalex.org/W2135168902","https://openalex.org/W2158503783","https://openalex.org/W2162800436","https://openalex.org/W2167897175","https://openalex.org/W2171305414","https://openalex.org/W2266946488","https://openalex.org/W2543381247","https://openalex.org/W2582171088","https://openalex.org/W3035984219","https://openalex.org/W4232082450"],"related_works":["https://openalex.org/W2015288657","https://openalex.org/W39176023","https://openalex.org/W1985812215","https://openalex.org/W2098072525","https://openalex.org/W9059077","https://openalex.org/W2111200844","https://openalex.org/W4389767465","https://openalex.org/W2054621035","https://openalex.org/W2381266720","https://openalex.org/W2046515352"],"abstract_inverted_index":{"This":[0,9],"paper":[1],"describes":[2],"and":[3,18,31,108],"analyzes":[4],"the":[5,46,50,68,82,89,96,102,109,113,132,135],"cost":[6,70],"approximation":[7],"algorithm.":[8],"class":[10],"of":[11,25,45,67,91,101,112,134],"iterative":[12,74],"descent":[13],"algorithms":[14,26],"for":[15,35,95,117],"nonlinear":[16],"programs":[17],"variational":[19],"inequalities":[20],"places":[21],"a":[22,28,33,77,92],"large":[23],"number":[24],"within":[27],"common":[29,43],"framework":[30,51,103],"provides":[32],"means":[34],"analyzing":[36],"relationships":[37],"among":[38],"seemingly":[39],"unrelated":[40],"methods.":[41],"A":[42],"property":[44],"methods":[47],"included":[48],"in":[49,72,81,85],"is":[52,79,104],"that":[53],"their":[54],"subproblems":[55],"may":[56],"be":[57],"characterized":[58],"by":[59],"monotone":[60],"mappings,":[61],"which":[62],"replace":[63],"an":[64,73],"additive":[65],"part":[66],"original":[69,97],"mapping":[71],"manner;":[75],"alternately,":[76],"step":[78],"taken":[80],"direction":[83],"obtained":[84],"order":[86],"to":[87,119,127,138],"reduce":[88],"value":[90],"merit":[93],"function":[94],"problem.":[98],"The":[99,122],"generality":[100],"illustrated":[105],"through":[106],"examples,":[107],"convergence":[110,123],"characteristics":[111],"algorithm":[114],"are":[115,125],"analyzed":[116],"applications":[118],"nondifferentiable":[120],"optimization.":[121],"results":[124],"applied":[126],"some":[128],"example":[129],"methods,":[130],"demonstrating":[131],"strength":[133],"analysis":[136],"compared":[137],"existing":[139],"results.":[140]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-27T14:10:00.468798","created_date":"2025-10-10T00:00:00"}