{"id":"https://openalex.org/W2099299739","doi":"https://doi.org/10.1080/10556780500130525","title":"Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization","display_name":"Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization","publication_year":2006,"publication_date":"2006-06-27","ids":{"openalex":"https://openalex.org/W2099299739","doi":"https://doi.org/10.1080/10556780500130525","mag":"2099299739"},"language":"en","primary_location":{"id":"doi:10.1080/10556780500130525","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780500130525","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/A5021432838","display_name":"R. Baker Kearfott","orcid":"https://orcid.org/0000-0002-3449-098X"},"institutions":[{"id":"https://openalex.org/I79516672","display_name":"University of Louisiana at Lafayette","ror":"https://ror.org/01x8rc503","country_code":"US","type":"education","lineage":["https://openalex.org/I2799628689","https://openalex.org/I79516672"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"R. Baker Kearfott","raw_affiliation_strings":["Department of Mathematics, University of Louisiana, U.L. Box 4-1010, Lafayette, LA, 70504-1010, USA","Department of Mathematics , University of Louisiana , U.L. Box 4-1010, Lafayette, LA, 70504-1010, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Louisiana, U.L. Box 4-1010, Lafayette, LA, 70504-1010, USA","institution_ids":["https://openalex.org/I79516672"]},{"raw_affiliation_string":"Department of Mathematics , University of Louisiana , U.L. Box 4-1010, Lafayette, LA, 70504-1010, USA","institution_ids":["https://openalex.org/I79516672"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5021432838"],"corresponding_institution_ids":["https://openalex.org/I79516672"],"apc_list":null,"apc_paid":null,"fwci":2.9136,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.9098816,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"21","issue":"5","first_page":"715","last_page":"731"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.9995999932289124,"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.9995999932289124,"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.9993000030517578,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9948999881744385,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.4450850188732147},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4283919632434845},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39954233169555664},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.38491690158843994},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33831748366355896}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4450850188732147},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4283919632434845},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39954233169555664},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.38491690158843994},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33831748366355896}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/10556780500130525","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780500130525","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.139.6116","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.139.6116","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://interval.louisiana.edu/preprints/validated_global_optimization_search_comparisons.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.7900000214576721}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W10227180","https://openalex.org/W114465074","https://openalex.org/W173148493","https://openalex.org/W1479875173","https://openalex.org/W1540822980","https://openalex.org/W1966164803","https://openalex.org/W1988622494","https://openalex.org/W2056572040","https://openalex.org/W2081148668","https://openalex.org/W2110763874","https://openalex.org/W2129480103","https://openalex.org/W2133520239","https://openalex.org/W2146424631","https://openalex.org/W2159427065","https://openalex.org/W2167206762","https://openalex.org/W2249956314","https://openalex.org/W2317988884","https://openalex.org/W2592813450","https://openalex.org/W2883109957","https://openalex.org/W2894871027","https://openalex.org/W2911911537","https://openalex.org/W3106807711","https://openalex.org/W3138103376","https://openalex.org/W4210953350","https://openalex.org/W4230131919","https://openalex.org/W4238030832","https://openalex.org/W4247032301","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2042127053"],"abstract_inverted_index":{"Both":[0],"theory":[1],"and":[2,96],"implementations":[3],"in":[4,11,35,62,110],"deterministic":[5],"global":[6,91,112],"optimization":[7,92],"have":[8,19],"advanced":[9],"significantly":[10],"the":[12,21,30,125],"past":[13],"decade.":[14],"Two":[15],"schools":[16],"of":[17,43,73,76,107,124],"thought":[18],"developed:":[20],"first":[22],"employs":[23,32],"various":[24],"bounding":[25],"techniques":[26,88],"without":[27,56],"validation,":[28,57],"while":[29],"second":[31],"different":[33],"techniques,":[34],"a":[36,63,70,74],"way":[37],"that":[38,103],"always":[39],"rigorously":[40],"takes":[41],"account":[42],"roundoff":[44],"error":[45],"(i.e.":[46],"with":[47,86],"validation).":[48],"However,":[49],"convex":[50,77],"relaxations,":[51],"until":[52],"very":[53],"recently":[54],"used":[55],"can":[58],"be":[59],"implemented":[60],"efficiently":[61],"validated":[64,71,90,111],"context.":[65],"Here,":[66],"we":[67],"empirically":[68],"compare":[69],"implementation":[72],"variant":[75],"relaxations":[78,80,105],"(linear":[79],"applied":[81],"to":[82,120],"each":[83],"intermediate":[84],"operation)":[85],"traditional":[87],"from":[89],"(interval":[93],"constraint":[94],"propagation":[95],"interval":[97],"Newton":[98],"methods).":[99],"Experimental":[100],"results":[101],"show":[102],"linear":[104],"are":[106],"significant":[108],"value":[109],"optimization,":[113],"although":[114],"further":[115],"exploration":[116],"will":[117],"probably":[118],"lead":[119],"more":[121],"effective":[122],"inclusion":[123],"technology.":[126]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}