{"id":"https://openalex.org/W4388701443","doi":"https://doi.org/10.1080/10556788.2023.2263618","title":"A hybrid direct search and projected simplex gradient method for convex constrained minimization","display_name":"A hybrid direct search and projected simplex gradient method for convex constrained minimization","publication_year":2023,"publication_date":"2023-11-15","ids":{"openalex":"https://openalex.org/W4388701443","doi":"https://doi.org/10.1080/10556788.2023.2263618"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2023.2263618","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2023.2263618","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/A5018058104","display_name":"A. L. Cust\u00f3dio","orcid":"https://orcid.org/0000-0003-0890-7398"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"A. L. Cust\u00f3dio","raw_affiliation_strings":["Center for Mathematics and Applications (NOVA Math), NOVA FCT and Department of Mathematics, NOVA FCT, Caparica, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for Mathematics and Applications (NOVA Math), NOVA FCT and Department of Mathematics, NOVA FCT, Caparica, Portugal","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024832933","display_name":"Evelin H. M. Krulikovski","orcid":"https://orcid.org/0000-0002-3374-9232"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"E. H. M. Krulikovski","raw_affiliation_strings":["Center for Mathematics and Applications (NOVA Math), NOVA FCT, Caparica, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for Mathematics and Applications (NOVA Math), NOVA FCT, Caparica, Portugal","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049891878","display_name":"Marcos Raydan","orcid":"https://orcid.org/0000-0003-0417-7981"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. Raydan","raw_affiliation_strings":["Center for Mathematics and Applications (NOVA Math), NOVA FCT, Caparica, Portugal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for Mathematics and Applications (NOVA Math), NOVA FCT, Caparica, Portugal","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5018058104"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1421,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.75356161,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"39","issue":"3","first_page":"534","last_page":"568"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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.9965999722480774,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9818000197410583,"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/proximal-gradient-methods","display_name":"Proximal Gradient Methods","score":0.6248384714126587},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.6144803166389465},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6069362759590149},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.5987549424171448},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5922811031341553},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.5394289493560791},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.5282285213470459},{"id":"https://openalex.org/keywords/convex-combination","display_name":"Convex combination","score":0.47715967893600464},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4636439383029938},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.44799771904945374},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.44556182622909546},{"id":"https://openalex.org/keywords/proper-convex-function","display_name":"Proper convex function","score":0.44330620765686035},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.42202839255332947},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3534125089645386},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.19896793365478516},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.14124736189842224},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.055253803730010986}],"concepts":[{"id":"https://openalex.org/C10494615","wikidata":"https://www.wikidata.org/wiki/Q17086765","display_name":"Proximal Gradient Methods","level":4,"score":0.6248384714126587},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.6144803166389465},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6069362759590149},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.5987549424171448},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5922811031341553},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.5394289493560791},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.5282285213470459},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.47715967893600464},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4636439383029938},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.44799771904945374},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.44556182622909546},{"id":"https://openalex.org/C50862404","wikidata":"https://www.wikidata.org/wiki/Q3075259","display_name":"Proper convex function","level":5,"score":0.44330620765686035},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.42202839255332947},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3534125089645386},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.19896793365478516},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.14124736189842224},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.055253803730010986},{"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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556788.2023.2263618","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2023.2263618","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":[{"display_name":"Partnerships for the goals","id":"https://metadata.un.org/sdg/17","score":0.5099999904632568}],"awards":[{"id":"https://openalex.org/G8921366140","display_name":null,"funder_award_id":"PTDC/MAT-APL/28400/2017","funder_id":"https://openalex.org/F4320334779","funder_display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia"}],"funders":[{"id":"https://openalex.org/F4320334779","display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","ror":"https://ror.org/00snfqn58"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W181733065","https://openalex.org/W1536329667","https://openalex.org/W1548898283","https://openalex.org/W1973734200","https://openalex.org/W1978100686","https://openalex.org/W1982087768","https://openalex.org/W1990599485","https://openalex.org/W1994895518","https://openalex.org/W1995832922","https://openalex.org/W1998855065","https://openalex.org/W2000218110","https://openalex.org/W2014337138","https://openalex.org/W2015439219","https://openalex.org/W2016670346","https://openalex.org/W2019742812","https://openalex.org/W2022451981","https://openalex.org/W2024948279","https://openalex.org/W2026977976","https://openalex.org/W2036255495","https://openalex.org/W2043492240","https://openalex.org/W2044155535","https://openalex.org/W2044778841","https://openalex.org/W2050096287","https://openalex.org/W2052143039","https://openalex.org/W2054875385","https://openalex.org/W2057830724","https://openalex.org/W2076605490","https://openalex.org/W2078857595","https://openalex.org/W2084186221","https://openalex.org/W2085137170","https://openalex.org/W2091849172","https://openalex.org/W2094268929","https://openalex.org/W2096266380","https://openalex.org/W2102790339","https://openalex.org/W2123224804","https://openalex.org/W2124548165","https://openalex.org/W2143104984","https://openalex.org/W2162737890","https://openalex.org/W2166308223","https://openalex.org/W2312715465","https://openalex.org/W2775085189","https://openalex.org/W2904549226","https://openalex.org/W3201961312","https://openalex.org/W4244070551","https://openalex.org/W4251968008","https://openalex.org/W4401457302"],"related_works":["https://openalex.org/W3125179639","https://openalex.org/W2079260672","https://openalex.org/W2026600343","https://openalex.org/W2382784175","https://openalex.org/W3777771","https://openalex.org/W2090262570","https://openalex.org/W1601341493","https://openalex.org/W4382519084","https://openalex.org/W2461425024","https://openalex.org/W4214969932"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,25,66,77,81,96,153,165],"new":[3],"Derivative-free":[4],"Optimization":[5],"(DFO)":[6],"approach":[7,51,169],"for":[8,170],"solving":[9],"convex":[10,30,41,90,111,172],"constrained":[11,173],"minimization":[12],"problems.":[13],"The":[14],"feasible":[15,91,103],"set":[16,92,104],"is":[17,43,93,99,105,119,164],"assumed":[18],"to":[19,47,130,139],"be":[20],"the":[21,34,73,85,89,102,106,141,144,161],"non-empty":[22],"intersection":[23,107],"of":[24,28,38,108,143],"finite":[26],"collection":[27],"closed":[29],"sets,":[31,113],"such":[32],"that":[33,55,160],"projection":[35,98,117],"onto":[36],"each":[37],"these":[39],"individual":[40],"sets":[42],"simple":[44,112],"and":[45,65,167],"inexpensive":[46],"compute.":[48],"Our":[49,157],"iterative":[50],"alternates":[52],"between":[53],"steps":[54],"use":[56],"Directional":[57],"Direct":[58],"Search":[59],"(DDS),":[60],"considering":[61],"adequate":[62],"poll":[63],"directions,":[64],"Spectral":[67],"Projected":[68],"Gradient":[69],"(SPG)":[70],"method,":[71],"replacing":[72],"real":[74],"gradient":[75],"by":[76,149],"simplex":[78],"gradient,":[79],"under":[80,125],"DFO":[82,131],"approach.":[83],"In":[84],"SPG":[86],"steps,":[87],"if":[88],"simple,":[94],"then":[95,114],"direct":[97],"computed.":[100],"If":[101],"finitely":[109],"many":[110],"Dykstra's":[115],"alternating":[116],"method":[118],"applied.":[120],"Convergence":[121],"properties":[122],"are":[123,137],"established":[124],"standard":[126],"assumptions":[127],"usually":[128],"associated":[129],"methods.":[132],"Some":[133],"preliminary":[134],"numerical":[135],"experiments":[136],"reported":[138],"illustrate":[140],"performance":[142],"proposed":[145],"algorithm,":[146],"in":[147],"particular":[148],"comparing":[150],"it":[151],"with":[152],"classical":[154],"DDS":[155],"method.":[156],"results":[158],"indicate":[159],"hybrid":[162],"algorithm":[163],"robust":[166],"effective":[168],"derivative-free":[171],"optimization.":[174]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2024,"cited_by_count":1}],"updated_date":"2026-06-15T08:34:33.830935","created_date":"2025-10-10T00:00:00"}