{"id":"https://openalex.org/W1992351292","doi":"https://doi.org/10.1080/10556789508805630","title":"An Interval Algorithm for Bound Constrained Global Optimization","display_name":"An Interval Algorithm for Bound Constrained Global Optimization","publication_year":1995,"publication_date":"1995-01-01","ids":{"openalex":"https://openalex.org/W1992351292","doi":"https://doi.org/10.1080/10556789508805630","mag":"1992351292"},"language":"en","primary_location":{"id":"doi:10.1080/10556789508805630","doi":"https://doi.org/10.1080/10556789508805630","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556789508805630","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,"listed_in":["anvur-scientific","cwts-core","dongbi-b","jufo-1","norway-1","poland-70","russia-white-list-1"],"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"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"},"volume":null,"type":"article","is_traditional":true,"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/A5023285500","display_name":"Michael A. Wolfe","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I16835326","display_name":"University of St Andrews","ror":"https://ror.org/02wn5qz54","country_code":"GB","type":"education","lineage":["https://openalex.org/I16835326"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"M.A. Wolfe","raw_affiliation_strings":["School of Mathematical and Computational Sciences Mathematical Institute, University of St Andrews, North Haugh St Andrews, UK, Fife KY16 9SS, Scotland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematical and Computational Sciences Mathematical Institute, University of St Andrews, North Haugh St Andrews, UK, Fife KY16 9SS, Scotland","institution_ids":["https://openalex.org/I16835326"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5023285500"],"corresponding_institution_ids":["https://openalex.org/I16835326"],"apc_list":null,"apc_paid":null,"fwci":0.468,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.51233366,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":"6","issue":"2","first_page":"145","last_page":"159"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.7163000106811523,"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.7163000106811523,"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.27880001068115234,"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.0012000000569969416,"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.7409999966621399},{"id":"https://openalex.org/keywords/bound-constrained-optimization","display_name":"bound-constrained optimization","score":0.8730000257492065},{"id":"https://openalex.org/keywords/interval-arithmetic","display_name":"interval arithmetic","score":0.828000009059906},{"id":"https://openalex.org/keywords/convex-domains","display_name":"convex domains","score":0.5139999985694885},{"id":"https://openalex.org/keywords/twice-continuously-differentiable-functions","display_name":"twice continuously differentiable functions","score":0.7749999761581421}],"concepts":[{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.760210394859314},{"id":"https://openalex.org/C2778241615","wikidata":"https://www.wikidata.org/wiki/Q83303","display_name":"Fortran","level":2,"score":0.6533200740814209},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6518813371658325},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5495577454566956},{"id":"https://openalex.org/C191252586","wikidata":"https://www.wikidata.org/wiki/Q1671453","display_name":"Interval arithmetic","level":3,"score":0.5352756381034851},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.5196834206581116},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5194486975669861},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5124602913856506},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5119239091873169},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.48163333535194397},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44324856996536255},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.40036603808403015},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3742431402206421},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33983296155929565},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32537633180618286},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1242033839225769},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.12379458546638489},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"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":1,"locations":[{"id":"doi:10.1080/10556789508805630","doi":"https://doi.org/10.1080/10556789508805630","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556789508805630","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,"listed_in":["anvur-scientific","cwts-core","dongbi-b","jufo-1","norway-1","poland-70","russia-white-list-1"],"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"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":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W17230929","https://openalex.org/W124176502","https://openalex.org/W1483874187","https://openalex.org/W1492781725","https://openalex.org/W1963764014","https://openalex.org/W1966833256","https://openalex.org/W1979801620","https://openalex.org/W2000389939","https://openalex.org/W2006121197","https://openalex.org/W2007007407","https://openalex.org/W2012879099","https://openalex.org/W2056370246","https://openalex.org/W2060924166","https://openalex.org/W2067648572","https://openalex.org/W2079115388","https://openalex.org/W2125642377","https://openalex.org/W2272795305","https://openalex.org/W2741239927","https://openalex.org/W3146520007","https://openalex.org/W4210916633","https://openalex.org/W4234587084","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2618446916","https://openalex.org/W1840817003","https://openalex.org/W1997552505","https://openalex.org/W2346492432","https://openalex.org/W2084538587","https://openalex.org/W2246758158","https://openalex.org/W2041233562","https://openalex.org/W141207782","https://openalex.org/W2751820042","https://openalex.org/W7100498255"],"abstract_inverted_index":{"An":[0],"interval":[1],"algorithm":[2],"BOXMIN":[3,43],"which":[4],"determines":[5],"computationally":[6],"rigorous":[7],"bounds":[8],"on":[9],"the":[10,19,53,56],"global":[11],"minimizers":[12],"of":[13,55],"functions":[14],"f:R":[15],"n":[16,31],"\u2192R":[17],"1in":[18],"set":[20,36],"is":[21,24,32],"described.":[22],"It":[23],"assumed":[25],"that":[26,42],"f\u2208C":[27],"2is":[28],"where":[29],"D\u2286R":[30],"an":[33],"open":[34],"convex":[35],"containing":[37],"X.":[38],"Computational":[39],"experience":[40],"indicates":[41],"always":[44],"succeeds":[45],"with":[46,52],"a":[47,62],"reasonable":[48],"computational":[49],"cost":[50],"commensurate":[51],"difficulty":[54],"problem.":[57],"Numerical":[58],"results":[59],"obtained":[60],"from":[61],"Fortran":[63],"90":[64],"implementation":[65],"are":[66],"presented":[67]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-10-30T12:39:25.321706","created_date":"2016-06-24T00:00:00"}