{"id":"https://openalex.org/W4392156338","doi":"https://doi.org/10.1007/s10589-024-00564-w","title":"Convergence of successive linear programming algorithms for noisy functions","display_name":"Convergence of successive linear programming algorithms for noisy functions","publication_year":2024,"publication_date":"2024-02-26","ids":{"openalex":"https://openalex.org/W4392156338","doi":"https://doi.org/10.1007/s10589-024-00564-w"},"language":"en","primary_location":{"id":"doi:10.1007/s10589-024-00564-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-024-00564-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10589-024-00564-w.pdf","source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10589-024-00564-w.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032282695","display_name":"Christoph Hansknecht","orcid":"https://orcid.org/0000-0003-3948-9344"},"institutions":[{"id":"https://openalex.org/I94509681","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66","country_code":"DE","type":"education","lineage":["https://openalex.org/I94509681"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Christoph Hansknecht","raw_affiliation_strings":["Institute for Mathematical Optimization, TU\u00a0Braunschweig, Braunschweig, Germany"],"raw_orcid":"https://orcid.org/0000-0003-3948-9344","affiliations":[{"raw_affiliation_string":"Institute for Mathematical Optimization, TU\u00a0Braunschweig, Braunschweig, Germany","institution_ids":["https://openalex.org/I94509681"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053623605","display_name":"Christian Kirches","orcid":"https://orcid.org/0000-0002-3441-8822"},"institutions":[{"id":"https://openalex.org/I94509681","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66","country_code":"DE","type":"education","lineage":["https://openalex.org/I94509681"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christian Kirches","raw_affiliation_strings":["Institute for Mathematical Optimization, TU\u00a0Braunschweig, Braunschweig, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Mathematical Optimization, TU\u00a0Braunschweig, Braunschweig, Germany","institution_ids":["https://openalex.org/I94509681"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060056524","display_name":"Paul Manns","orcid":"https://orcid.org/0000-0003-0654-6613"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Paul Manns","raw_affiliation_strings":["Chair of Numerical Analysis and Optimization, TU\u00a0Dortmund\u00a0University, Dortmund, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Chair of Numerical Analysis and Optimization, TU\u00a0Dortmund\u00a0University, Dortmund, Germany","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5032282695"],"corresponding_institution_ids":["https://openalex.org/I94509681"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.3583,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.49792207,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"88","issue":"2","first_page":"567","last_page":"601"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998999834060669,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998999834060669,"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.9991000294685364,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9987999796867371,"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/mathematics","display_name":"Mathematics","score":0.674541175365448},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.668626070022583},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6221603155136108},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5189206600189209},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5084961652755737},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4836064875125885},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.46302950382232666},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4285510182380676}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.674541175365448},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.668626070022583},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6221603155136108},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5189206600189209},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5084961652755737},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4836064875125885},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.46302950382232666},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4285510182380676},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","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/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10589-024-00564-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-024-00564-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10589-024-00564-w.pdf","source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},{"id":"pmh:oai:econstor.eu:10419/315241","is_oa":true,"landing_page_url":"https://hdl.handle.net/10419/315241","pdf_url":"https://www.econstor.eu/bitstream/10419/315241/1/10589_2024_Article_564.pdf","source":{"id":"https://openalex.org/S4306401696","display_name":"Econstor (Econstor)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"doc-type:article"},{"id":"pmh:oai:RePEc:spr:coopap:v:88:y:2024:i:2:d:10.1007_s10589-024-00564-w","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10589-024-00564-w","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s10589-024-00564-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-024-00564-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10589-024-00564-w.pdf","source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Optimization and Applications","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322958","display_name":"Technische Universit\u00e4t Braunschweig","ror":"https://ror.org/010nsgg66"}],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4392156338.pdf"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W180478659","https://openalex.org/W1892869851","https://openalex.org/W1985514811","https://openalex.org/W2001828104","https://openalex.org/W2004357692","https://openalex.org/W2010315761","https://openalex.org/W2030161963","https://openalex.org/W2057565823","https://openalex.org/W2075894130","https://openalex.org/W2092679899","https://openalex.org/W2122587727","https://openalex.org/W2123871098","https://openalex.org/W2135046866","https://openalex.org/W2163319674","https://openalex.org/W2164452299","https://openalex.org/W2413459596","https://openalex.org/W2502655619","https://openalex.org/W2894719012","https://openalex.org/W2963477800","https://openalex.org/W2963956318","https://openalex.org/W2978807476","https://openalex.org/W2999729425","https://openalex.org/W3003257820","https://openalex.org/W3028651114","https://openalex.org/W3035965352","https://openalex.org/W3099878876","https://openalex.org/W4225873238","https://openalex.org/W4249513058","https://openalex.org/W4292363360","https://openalex.org/W4301014524","https://openalex.org/W4315703116","https://openalex.org/W4360829331","https://openalex.org/W4385382141"],"related_works":["https://openalex.org/W3103325625","https://openalex.org/W1486898455","https://openalex.org/W2041905724","https://openalex.org/W4311726894","https://openalex.org/W2991463004","https://openalex.org/W2088588293","https://openalex.org/W2949122357","https://openalex.org/W3090727460","https://openalex.org/W4387701909","https://openalex.org/W2006211888"],"abstract_inverted_index":{"Abstract":[0],"Gradient-based":[1],"methods":[2],"have":[3,44],"been":[4],"highly":[5],"successful":[6],"for":[7,49,62,118,156,180],"solving":[8],"a":[9,47,56,73,77,132,136,196],"variety":[10],"of":[11,55,58,69,72,79,131,183,191,198,205],"both":[12],"unconstrained":[13,51,119],"and":[14,32,42,82,142,175],"constrained":[15,164],"nonlinear":[16],"optimization":[17,120,165],"problems.":[18],"In":[19],"real-world":[20],"applications,":[21],"such":[22],"as":[23,128],"optimal":[24],"control":[25],"or":[26,163],"machine":[27],"learning,":[28],"the":[29,59,70,96,129,140,152,173,184,189,192,199,206],"necessary":[30],"function":[31,134],"derivative":[33],"information":[34],"may":[35,145],"be":[36,126,146],"corrupted":[37,147],"by":[38,53,148],"noise,":[39],"however.":[40],"Sun":[41],"Nocedal":[43,83],"recently":[45],"proposed":[46],"remedy":[48],"smooth":[50,137],"problems":[52,121],"means":[54],"stabilization":[57,185],"acceptance":[60,200],"criterion":[61,201],"computed":[63],"iterates,":[64],"which":[65],"leads":[66],"to":[67,76,95,154,177],"convergence":[68],"iterates":[71],"trust-region":[74],"method":[75],"region":[78,194],"criticality":[80],"(Sun":[81],"in":[84,104,160],"Math":[85,105],"Program":[86,106],"66:1\u201328,":[87],"2023.":[88],"https://doi.org/10.1007/s10107-023-01941-9":[89],").":[90],"We":[91,167],"extend":[92],"their":[93],"analysis":[94],"successive":[97],"linear":[98],"programming":[99],"algorithm":[100],"(Byrd":[101],"et":[102],"al.":[103],"100(1):27\u201348,":[107],"2003.":[108],"https://doi.org/10.1007/s10107-003-0485-4":[109],",":[110],"SIAM":[111],"J":[112],"Optim":[113],"16(2):471\u2013489,":[114],"2005.":[115],"https://doi.org/10.1137/S1052623403426532":[116],")":[117],"with":[122,135,195],"objectives":[123],"that":[124,171,187],"can":[125],"characterized":[127],"composition":[130],"polyhedral":[133],"function,":[138],"where":[139],"latter":[141],"its":[143],"gradient":[144],"noise.":[149],"This":[150],"gives":[151],"flexibility":[153],"cover,":[155],"example,":[157],"(sub)problems":[158],"arising":[159],"image":[161],"reconstruction":[162],"algorithms.":[166],"provide":[168],"computational":[169],"examples":[170],"illustrate":[172],"findings":[174],"point":[176],"possible":[178],"strategies":[179],"practical":[181],"determination":[182],"parameter":[186],"balances":[188],"size":[190],"critical":[193],"relaxation":[197],"(or":[202],"descent":[203],"property)":[204],"algorithm.":[207]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-12-22T23:10:17.713674","created_date":"2025-10-10T00:00:00"}