{"id":"https://openalex.org/W2080650614","doi":"https://doi.org/10.1109/icnc.2010.5584651","title":"A Branch and Bound algorithm for solving nonconvex minimization problem based on reducing duality gap","display_name":"A Branch and Bound algorithm for solving nonconvex minimization problem based on reducing duality gap","publication_year":2010,"publication_date":"2010-08-01","ids":{"openalex":"https://openalex.org/W2080650614","doi":"https://doi.org/10.1109/icnc.2010.5584651","mag":"2080650614"},"language":"en","primary_location":{"id":"doi:10.1109/icnc.2010.5584651","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2010.5584651","pdf_url":null,"source":{"id":"https://openalex.org/S4363608012","display_name":"2010 Sixth International Conference on Natural Computation","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Sixth International Conference on Natural Computation","raw_type":"proceedings-article"},"type":"conference-paper","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/A5063460872","display_name":"Tingsong Du","orcid":"https://orcid.org/0000-0002-6072-1788"},"institutions":[{"id":"https://openalex.org/I161350542","display_name":"China Three Gorges University","ror":"https://ror.org/0419nfc77","country_code":"CN","type":"education","lineage":["https://openalex.org/I161350542"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Tingsong Du","raw_affiliation_strings":["Institute of Nonlinear and Complex Systems Science College, China Three Gorges University, Yichang, China","Institute of Nonlinear and Complex Systems, Science College, China Three Gorges University, Yichang 443002, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Nonlinear and Complex Systems Science College, China Three Gorges University, Yichang, China","institution_ids":["https://openalex.org/I161350542"]},{"raw_affiliation_string":"Institute of Nonlinear and Complex Systems, Science College, China Three Gorges University, Yichang 443002, China","institution_ids":["https://openalex.org/I161350542"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108618227","display_name":"Jingli Yang","orcid":null},"institutions":[{"id":"https://openalex.org/I161350542","display_name":"China Three Gorges University","ror":"https://ror.org/0419nfc77","country_code":"CN","type":"education","lineage":["https://openalex.org/I161350542"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jingli Yang","raw_affiliation_strings":["Institute of Nonlinear and Complex Systems Science College, China Three Gorges University, Yichang, China","Institute of Nonlinear and Complex Systems, Science College, China Three Gorges University, Yichang 443002, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Nonlinear and Complex Systems Science College, China Three Gorges University, Yichang, China","institution_ids":["https://openalex.org/I161350542"]},{"raw_affiliation_string":"Institute of Nonlinear and Complex Systems, Science College, China Three Gorges University, Yichang 443002, China","institution_ids":["https://openalex.org/I161350542"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I161350542"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.22753368,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"21","issue":null,"first_page":"3098","last_page":"3101"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11220","display_name":"Water Systems and Optimization","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11220","display_name":"Water Systems and Optimization","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural Engineering"},"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9907000064849854,"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/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.9848999977111816,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/duality-gap","display_name":"Duality gap","score":0.8904268741607666},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.6884045600891113},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.6809161305427551},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.6082634925842285},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5798867344856262},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.562833845615387},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5586435198783875},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.5223878026008606},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5203432440757751},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4918677806854248},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.48418405652046204},{"id":"https://openalex.org/keywords/strong-duality","display_name":"Strong duality","score":0.4134008288383484},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.350685179233551},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.2559243440628052},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.15270644426345825}],"concepts":[{"id":"https://openalex.org/C5274546","wikidata":"https://www.wikidata.org/wiki/Q5310264","display_name":"Duality gap","level":3,"score":0.8904268741607666},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.6884045600891113},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.6809161305427551},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.6082634925842285},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5798867344856262},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.562833845615387},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5586435198783875},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.5223878026008606},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5203432440757751},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4918677806854248},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.48418405652046204},{"id":"https://openalex.org/C163863214","wikidata":"https://www.wikidata.org/wiki/Q7624553","display_name":"Strong duality","level":3,"score":0.4134008288383484},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.350685179233551},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2559243440628052},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.15270644426345825},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnc.2010.5584651","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnc.2010.5584651","pdf_url":null,"source":{"id":"https://openalex.org/S4363608012","display_name":"2010 Sixth International Conference on Natural Computation","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 Sixth International Conference on Natural Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W2011703887","https://openalex.org/W2041928877","https://openalex.org/W2070226140","https://openalex.org/W2124412708","https://openalex.org/W2127611252","https://openalex.org/W2348892228","https://openalex.org/W2367160163","https://openalex.org/W2388663018","https://openalex.org/W4211092921","https://openalex.org/W4255179616"],"related_works":["https://openalex.org/W4220928172","https://openalex.org/W2725387418","https://openalex.org/W2201555914","https://openalex.org/W2593555778","https://openalex.org/W2614523486","https://openalex.org/W2080941243","https://openalex.org/W2136200239","https://openalex.org/W2056178476","https://openalex.org/W3213165575","https://openalex.org/W1687657632"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"derive":[4],"a":[5,19,35,47,61],"general":[6],"principle":[7,30],"demonstrating":[8],"that":[9],"partitioning":[10],"the":[11,14,52],"feasible":[12],"set,":[13],"duality":[15],"gap,":[16],"existing":[17],"between":[18],"nonconvex":[20],"program":[21],"and":[22,37,46,60],"its":[23],"lagrangian":[24],"dual,":[25],"can":[26,31],"be":[27,32],"reduced.":[28],"The":[29,56],"implemented":[33],"in":[34],"Branch":[36],"Bound":[38],"algorithm":[39,57,71],"which":[40],"computes":[41],"an":[42,67],"approximate":[43],"global":[44,53],"solution":[45],"corresponding":[48],"lower":[49],"bound":[50],"on":[51],"optimal":[54],"value.":[55],"involves":[58],"decomposition":[59],"local":[62],"search.":[63],"Numerical":[64],"results":[65],"with":[66],"example":[68],"for":[69],"applying":[70],"are":[72],"given.":[73]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}