{"id":"https://openalex.org/W4212967432","doi":"https://doi.org/10.1080/10556788.2021.2023522","title":"A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions","display_name":"A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions","publication_year":2022,"publication_date":"2022-02-14","ids":{"openalex":"https://openalex.org/W4212967432","doi":"https://doi.org/10.1080/10556788.2021.2023522"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2021.2023522","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2021.2023522","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/A5042638754","display_name":"Morteza Maleknia","orcid":"https://orcid.org/0000-0001-8576-3119"},"institutions":[{"id":"https://openalex.org/I158248296","display_name":"Amirkabir University of Technology","ror":"https://ror.org/04gzbav43","country_code":"IR","type":"education","lineage":["https://openalex.org/I158248296"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Morteza Maleknia","raw_affiliation_strings":["Department of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic), Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic), Tehran, Iran","institution_ids":["https://openalex.org/I158248296"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079227487","display_name":"M. Shamsi","orcid":"https://orcid.org/0000-0002-3806-9316"},"institutions":[{"id":"https://openalex.org/I158248296","display_name":"Amirkabir University of Technology","ror":"https://ror.org/04gzbav43","country_code":"IR","type":"education","lineage":["https://openalex.org/I158248296"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Mostafa Shamsi","raw_affiliation_strings":["Department of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic), Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic), Tehran, Iran","institution_ids":["https://openalex.org/I158248296"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5079227487"],"corresponding_institution_ids":["https://openalex.org/I158248296"],"apc_list":null,"apc_paid":null,"fwci":0.6349,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.57945767,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":"37","issue":"4","first_page":"1415","last_page":"1446"},"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.9994000196456909,"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.9994000196456909,"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.9988999962806702,"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.9947999715805054,"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/bundle","display_name":"Bundle","score":0.7083889245986938},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.627578854560852},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5538585782051086},{"id":"https://openalex.org/keywords/piecewise","display_name":"Piecewise","score":0.5177497267723083},{"id":"https://openalex.org/keywords/merge","display_name":"Merge (version control)","score":0.512715220451355},{"id":"https://openalex.org/keywords/regularization","display_name":"Regularization (linguistics)","score":0.49027207493782043},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4873581528663635},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.45613130927085876},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44265344738960266},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4316248893737793},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.390740305185318},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3260597586631775},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.15875425934791565},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08987462520599365},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0807492733001709}],"concepts":[{"id":"https://openalex.org/C2778134712","wikidata":"https://www.wikidata.org/wiki/Q1047307","display_name":"Bundle","level":2,"score":0.7083889245986938},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.627578854560852},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5538585782051086},{"id":"https://openalex.org/C164660894","wikidata":"https://www.wikidata.org/wiki/Q2037833","display_name":"Piecewise","level":2,"score":0.5177497267723083},{"id":"https://openalex.org/C197129107","wikidata":"https://www.wikidata.org/wiki/Q1921621","display_name":"Merge (version control)","level":2,"score":0.512715220451355},{"id":"https://openalex.org/C2776135515","wikidata":"https://www.wikidata.org/wiki/Q17143721","display_name":"Regularization (linguistics)","level":2,"score":0.49027207493782043},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4873581528663635},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.45613130927085876},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44265344738960266},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4316248893737793},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.390740305185318},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3260597586631775},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.15875425934791565},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08987462520599365},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0807492733001709},{"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/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","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/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556788.2021.2023522","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2021.2023522","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W356322785","https://openalex.org/W1484982917","https://openalex.org/W1511261802","https://openalex.org/W1604627832","https://openalex.org/W1963488456","https://openalex.org/W1964755931","https://openalex.org/W2029877964","https://openalex.org/W2031244688","https://openalex.org/W2036820163","https://openalex.org/W2039110678","https://openalex.org/W2041928877","https://openalex.org/W2063670264","https://openalex.org/W2064942524","https://openalex.org/W2071634839","https://openalex.org/W2084704795","https://openalex.org/W2084788303","https://openalex.org/W2091371007","https://openalex.org/W2111841405","https://openalex.org/W2123504579","https://openalex.org/W2151568819","https://openalex.org/W2158617645","https://openalex.org/W2159686234","https://openalex.org/W2346151177","https://openalex.org/W2485305008","https://openalex.org/W2531600399","https://openalex.org/W2750084060","https://openalex.org/W2751333275","https://openalex.org/W2798773971","https://openalex.org/W2942831104","https://openalex.org/W2951060965","https://openalex.org/W2962774350","https://openalex.org/W3044790043","https://openalex.org/W3081934664","https://openalex.org/W4211092921","https://openalex.org/W4212912562","https://openalex.org/W4234811268","https://openalex.org/W4243140258","https://openalex.org/W4249667877","https://openalex.org/W4299356270","https://openalex.org/W4300448178"],"related_works":["https://openalex.org/W4234886518","https://openalex.org/W2389591058","https://openalex.org/W2486541857","https://openalex.org/W2382112581","https://openalex.org/W3124036233","https://openalex.org/W2108840191","https://openalex.org/W2759366996","https://openalex.org/W2354081742","https://openalex.org/W2372661603","https://openalex.org/W1785572788"],"abstract_inverted_index":{"This":[0],"study":[1],"aims":[2],"to":[3,15,124],"merge":[4],"the":[5,29,33,36,48,54,69,78,104,115,119,125,140,143,152,177,186],"well-established":[6],"ideas":[7],"of":[8,23,35,43,68,80,118,131,139,142,151,160,170,193],"bundle":[9,59,111,171,196],"and":[10,110,129,195],"Gradient":[11],"Sampling":[12],"(GS)":[13],"methods":[14],"develop":[16],"an":[17],"algorithm":[18],"for":[19],"locating":[20],"a":[21,24,41,63,89,158],"minimizer":[22],"nonsmooth":[25],"convex":[26],"function.":[27,71],"In":[28,145,163],"proposed":[30,120,153,187],"method,":[31],"with":[32,88,167,189],"help":[34],"GS":[37,109,127,194],"technique,":[38],"we":[39,61,173,184],"sample":[40],"number":[42],"differentiable":[44],"auxiliary":[45,81],"points":[46],"around":[47],"current":[49],"iterate.":[50],"Then,":[51],"by":[52,73,103],"applying":[53],"standard":[55],"techniques":[56,105],"used":[57,107],"in":[58,108,165],"methods,":[60,172],"construct":[62],"polyhedral":[64,84],"(piecewise":[65],"linear)":[66],"model":[67,85,100],"objective":[70],"Moreover,":[72,183],"performing":[74],"quasi-Newton":[75],"updates":[76],"on":[77],"set":[79],"points,":[82],"this":[83,98],"is":[86,101,137],"augmented":[87],"regularization":[90],"term":[91],"that":[92,176],"enjoys":[93],"second-order":[94],"information.":[95],"If":[96],"required,":[97],"initial":[99],"improved":[102],"frequently":[106],"methods.":[112,197],"We":[113],"analyse":[114],"global":[116],"convergence":[117,135],"method.":[121],"As":[122],"opposed":[123],"original":[126],"method":[128,154,188],"some":[130,190],"its":[132],"variants,":[133],"our":[134,146],"analysis":[136],"independent":[138],"size":[141],"sample.":[144],"numerical":[147],"experiments,":[148],"various":[149],"aspects":[150],"are":[155],"examined":[156],"using":[157],"variety":[159],"test":[161],"problems.":[162],"particular,":[164],"contrast":[166],"many":[168],"variants":[169,192],"will":[174],"see":[175],"user":[178],"can":[179],"supply":[180],"gradients":[181],"approximately.":[182],"compare":[185],"efficient":[191]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}