{"id":"https://openalex.org/W2004000050","doi":"https://doi.org/10.4304/jnw.5.12.1458-1466","title":"Blindman-Walking Optimization Method","display_name":"Blindman-Walking Optimization Method","publication_year":2010,"publication_date":"2010-12-01","ids":{"openalex":"https://openalex.org/W2004000050","doi":"https://doi.org/10.4304/jnw.5.12.1458-1466","mag":"2004000050"},"language":"en","primary_location":{"id":"doi:10.4304/jnw.5.12.1458-1466","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jnw.5.12.1458-1466","pdf_url":null,"source":{"id":"https://openalex.org/S189188848","display_name":"Journal of Networks","issn_l":"1796-2056","issn":["1796-2056"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Networks","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/A5100701327","display_name":"Chunming Li","orcid":"https://orcid.org/0000-0002-4159-7048"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Chunming Li","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100701327"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.08896093,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"5","issue":"12","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9157000184059143,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9157000184059143,"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/computer-science","display_name":"Computer science","score":0.9201459884643555}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.9201459884643555}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4304/jnw.5.12.1458-1466","is_oa":false,"landing_page_url":"https://doi.org/10.4304/jnw.5.12.1458-1466","pdf_url":null,"source":{"id":"https://openalex.org/S189188848","display_name":"Journal of Networks","issn_l":"1796-2056","issn":["1796-2056"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318660","host_organization_name":"Academy Publisher","host_organization_lineage":["https://openalex.org/P4310318660"],"host_organization_lineage_names":["Academy Publisher"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.41999998688697815,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2350741829","https://openalex.org/W2130043461","https://openalex.org/W2530322880"],"abstract_inverted_index":{"Optimization":[0],"methods":[1],"are":[2,184],"all":[3],"implemented":[4],"with":[5,102,244],"the":[6,10,17,22,35,48,60,73,75,95,111,120,126,133,146,151,165,182,196,200,206,213,217,225,231,240,249,255,264,270,276],"hypothesis":[7],"of":[8,13,37,94,135,168,181,190,203,210,215,227,234,242,251,257,260,266,272],"unknowing":[9],"mathematic":[11],"express":[12],"objective":[14,106,277],"objection.":[15],"Using":[16],"human":[18],"analogy":[19],"innovative":[20,149,166,172],"method,":[21,154,239,269],"one-dimension":[23],"blind-walking":[24],"optimal":[25],"method":[26,39,96,113,122,131,147,157,161,214,253],"is":[27,52,64,123],"proposed":[28,112,121,130],"in":[29],"this":[30,38,169],"paper.":[31],"The":[32,85,115,129,178],"theory":[33],"and":[34,46,91,158,208,224,254],"algorithm":[36,189,274],"includes":[40],"halving,":[41],"doubling,":[42],"reversing":[43],"probing":[44],"step":[45,202],"verifying":[47],"applicability":[49,76],"condition.":[50],"Double-step":[51],"available":[53,65],"to":[54,59,66,71,221],"make":[55],"current":[56,81],"point":[57,82,236],"moving":[58],"extremum":[61,198,247],"point.":[62],"Half-step":[63],"accelerate":[67],"convergence.":[68],"In":[69],"order":[70],"improve":[72],"optimization,":[74],"condition":[77],"decides":[78],"whether":[79],"update":[80],"or":[83,104],"not.":[84],"operation":[86],"process,":[87],"algorithmic":[88],"flow":[89],"chart":[90],"characteristic":[92],"analysis":[93,226,241],"were":[97,108,162],"given.":[98],"Two":[99],"optimization":[100,229,258,268],"problems":[101],"unimodal":[103],"multimodal":[105],"function":[107,238,278],"solved":[109],"by":[110],"respectively.":[114],"simulation":[116],"result":[117],"shows":[118],"that":[119],"better":[124],"than":[125],"ordinary":[127],"method.":[128],"has":[132],"merit":[134],"rapid":[136],"convergence,":[137],"little":[138],"calculation":[139],"capacity,":[140],"wide":[141],"applicable":[142],"range,":[143],"etc.":[144,280],"Taking":[145,164],"as":[148,171,187],"kernel,":[150,173],"random":[152],"research":[153],"feasible":[155],"direction":[156],"complex":[159,218],"shape":[160,219],"improved.":[163],"content":[167],"paper":[170],"a":[174],"monograph":[175,183],"was":[176],"published.":[177],"other":[179],"innovations":[180],"listed,":[185],"such":[186],"applied":[188],"Karush-Kuhn-Tucker":[191],"(KKT)":[192],"qualifications":[193],"on":[194],"judging":[195],"restriction":[197],"point,":[199,248],"design":[201],"computing":[204],"software,":[205],"complementarity":[207],"derivation":[209],"Powell":[211],"criterion,":[212],"keeping":[216],"not":[220],"deduce":[222],"dimension":[223],"gradual":[228],"characteristic,":[230],"reinforced":[232],"wall":[233],"inner":[235],"punish":[237],"problem":[243],"constrained":[245],"monstrosity":[246],"improvement":[250],"Newton":[252],"validation":[256],"idea":[259],"blind":[261],"walking":[262],"repeatedly,":[263],"explanation":[265],"later-day":[267],"conformity":[271],"seeking":[273],"needing":[275],"derivation,":[279]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}