{"id":"https://openalex.org/W265139451","doi":null,"title":"An Efficient Limited Memory Interval Algorithm for Global Optimization","display_name":"An Efficient Limited Memory Interval Algorithm for Global Optimization","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W265139451","mag":"265139451"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.149.2248","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.149.2248","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.iaeng.org/publication/IMECS2009/IMECS2009_pp2032-2037.pdf","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5044169548","display_name":"Min Sun","orcid":"https://orcid.org/0000-0002-2632-1393","observed_orcids":["https://orcid.org/0000-0002-2632-1393"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Min Sun","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-2632-1393","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5044169548"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.5791000127792358,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.5791000127792358,"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.40529999136924744,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.006800000090152025,"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/global-optimization","display_name":"global optimization","score":0.972000002861023},{"id":"https://openalex.org/keywords/interval-algorithm","display_name":"interval algorithm","score":0.6779999732971191},{"id":"https://openalex.org/keywords/limited-memory","display_name":"limited memory","score":0.7649999856948853},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"constrained optimization","score":0.9210000038146973},{"id":"https://openalex.org/keywords/memory-capacity","display_name":"memory capacity","score":0.48399999737739563},{"id":"https://openalex.org/keywords/algorithmic-efficiency","display_name":"algorithm efficiency","score":0.5360000133514404},{"id":"https://openalex.org/keywords/global-optimum","display_name":"global optimum","score":0.4959999918937683}],"concepts":[{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.6916738748550415},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5528700351715088},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5527005195617676},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5491358637809753},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.5129527449607849},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.4778289794921875},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.46428313851356506},{"id":"https://openalex.org/C115051666","wikidata":"https://www.wikidata.org/wiki/Q6522493","display_name":"Ranging","level":2,"score":0.4576531648635864},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.448103129863739},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36075401306152344},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09271278977394104},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"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/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.149.2248","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.149.2248","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.iaeng.org/publication/IMECS2009/IMECS2009_pp2032-2037.pdf","raw_type":"text"},{"id":"mag:265139451","doi":null,"is_oa":false,"landing_page_url":"http://www.iaeng.org/publication/IMECS2009/IMECS2009_pp2032-2037.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1496983606","https://openalex.org/W1499399028","https://openalex.org/W1587078255","https://openalex.org/W1964993547","https://openalex.org/W1986444549","https://openalex.org/W1997600725","https://openalex.org/W2003273172","https://openalex.org/W2010864549","https://openalex.org/W2023582597","https://openalex.org/W2032070796","https://openalex.org/W2060924166","https://openalex.org/W2061910499","https://openalex.org/W2074488753","https://openalex.org/W2087695501","https://openalex.org/W2098968017","https://openalex.org/W2104670598","https://openalex.org/W2142183404","https://openalex.org/W2272795305","https://openalex.org/W3146520007","https://openalex.org/W4212899374"],"related_works":["https://openalex.org/W2032070796","https://openalex.org/W2087695501","https://openalex.org/W2079958113","https://openalex.org/W2066433902","https://openalex.org/W2346492432","https://openalex.org/W2084538587","https://openalex.org/W1964993547","https://openalex.org/W1534771352","https://openalex.org/W1583936380","https://openalex.org/W2355514381"],"abstract_inverted_index":{"Abstract\u2014This":[0],"article":[1],"presents":[2],"a":[3,14,51,62,76,82,86,91,101,113,137],"global":[4],"optimization":[5],"algorithm":[6,73,133],"of":[7,17,48,54,85,119],"the":[8,72,120],"interval":[9,115],"type":[10],"that":[11,71],"requires":[12],"only":[13,136],"limited":[15,139],"amount":[16],"memory":[18,110,121,140],"and":[19,50,106,125],"treats":[20],"standard":[21],"constraints.":[22],"It":[23,38],"is":[24],"shown":[25],"to":[26,29,59,79],"be":[27],"able":[28],"find":[30,81],"one":[31],"globally":[32,87],"optimal":[33,88],"solution":[34,89,102],"under":[35],"certain":[36],"conditions.":[37],"has":[39],"been":[40],"tested":[41],"with":[42,45],"many":[43],"examples":[44],"various":[46],"degrees":[47],"complexity":[49],"large":[52],"variety":[53],"dimensions":[55],"ranging":[56],"from":[57],"1":[58],"100":[60],"in":[61],"basic":[63],"personal":[64],"computer.":[65],"The":[66,117],"numerical":[67],"experiments":[68],"have":[69,75],"indicated":[70],"would":[74,134],"better":[77],"chance":[78],"successfully":[80],"good":[83,131],"approximation":[84],"than":[90,112],"recently":[92],"proposed":[93],"memoryless":[94],"version.":[95],"Yet,":[96],"it":[97],"still":[98],"finds":[99],"such":[100],"much":[103,108],"more":[104],"quickly":[105],"using":[107],"less":[109],"space":[111],"conventional":[114],"method.":[116],"effects":[118],"size":[122],"on":[123],"reliability":[124],"overall":[126],"efficiency":[127],"are":[128],"investigated.":[129],"A":[130],"compromised":[132],"require":[135],"very":[138],"size.":[141],"Index":[142],"Terms\u2014Constraints,":[143],"Global":[144],"optimization,":[145],"Interval":[146],"algorithm,":[147],"Limited":[148],"memory.":[149]},"counts_by_year":[],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}