{"id":"https://openalex.org/W987269561","doi":null,"title":"Global optimization over linear constraint non-convex programming problem","display_name":"Global optimization over linear constraint non-convex programming problem","alternate_titles":[],"publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W987269561","mag":"987269561"},"language":"en","primary_location":{"id":"mag:2377580555","doi":null,"is_oa":false,"landing_page_url":"https://oversea.cnki.net/kcms/detail/detail.aspx?dbcode=CJFD&filename=HGDY200506011","pdf_url":null,"source":{"id":"https://openalex.org/S4306545598","display_name":"\u54c8\u5c14\u6ee8\u5de5\u4e1a\u5927\u5b66\u5b66\u62a5\uff1a\u82f1\u6587\u7248","issn_l":"1005-9113","issn":["1005-9113"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["poland-20","russia-white-list-4"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"\u54c8\u5c14\u6ee8\u5de5\u4e1a\u5927\u5b66\u5b66\u62a5(\u82f1\u6587\u7248)","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W987269561"],"child_works_count":0,"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/A5045422805","display_name":"\u5f20\u8d35\u519b","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"\u5f20\u8d35\u519b","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079604529","display_name":"\u5434\u60d5\u534e","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"\u5434\u60d5\u534e","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057714800","display_name":"\u53f6\u84c9","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"\u53f6\u84c9","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5010929901","display_name":"\u6768\u6d77\u6e05","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"\u6768\u6d77\u6e05","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":"12","issue":"6","first_page":"650","last_page":"655"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9907000064849854,"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.9907000064849854,"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"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.006899999920278788,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.0006000000284984708,"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.9959999918937683},{"id":"https://openalex.org/keywords/linear-constraints","display_name":"linear constraints","score":0.9490000009536743},{"id":"https://openalex.org/keywords/steady-state-genetic-algorithm","display_name":"steady-state genetic algorithm","score":0.8989999890327454},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"convex analysis","score":0.6349999904632568},{"id":"https://openalex.org/keywords/problem-transformation","display_name":"problem transformation","score":0.3529999852180481},{"id":"https://openalex.org/keywords/population-diversity","display_name":"population diversity","score":0.7360000014305115}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7428343892097473},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.647266685962677},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5579866766929626},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5364347696304321},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5354015827178955},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.49781250953674316},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.4639994502067566},{"id":"https://openalex.org/C201829737","wikidata":"https://www.wikidata.org/wiki/Q2022760","display_name":"Linear matrix inequality","level":2,"score":0.44846755266189575},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.44546735286712646},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.439736545085907},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.4332144260406494},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.41772839426994324},{"id":"https://openalex.org/C50862404","wikidata":"https://www.wikidata.org/wiki/Q3075259","display_name":"Proper convex function","level":5,"score":0.4106995165348053},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32995378971099854},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"mag:2377580555","doi":null,"is_oa":false,"landing_page_url":"https://oversea.cnki.net/kcms/detail/detail.aspx?dbcode=CJFD&filename=HGDY200506011","pdf_url":null,"source":{"id":"https://openalex.org/S4306545598","display_name":"\u54c8\u5c14\u6ee8\u5de5\u4e1a\u5927\u5b66\u5b66\u62a5\uff1a\u82f1\u6587\u7248","issn_l":"1005-9113","issn":["1005-9113"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["poland-20","russia-white-list-4"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"\u54c8\u5c14\u6ee8\u5de5\u4e1a\u5927\u5b66\u5b66\u62a5(\u82f1\u6587\u7248)","raw_type":null},{"id":"mag:987269561","doi":null,"is_oa":false,"landing_page_url":"http://www.cqvip.com/QK/86045X/200506/20953163.html","pdf_url":null,"source":{"id":"https://openalex.org/S4306545598","display_name":"\u54c8\u5c14\u6ee8\u5de5\u4e1a\u5927\u5b66\u5b66\u62a5\uff1a\u82f1\u6587\u7248","issn_l":"1005-9113","issn":["1005-9113"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["poland-20","russia-white-list-4"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"\u54c8\u5c14\u6ee8\u5de5\u4e1a\u5927\u5b66\u5b66\u62a5\uff1a\u82f1\u6587\u7248","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":0,"referenced_works":[],"related_works":["https://openalex.org/W2381724227","https://openalex.org/W2078738758","https://openalex.org/W2079980777","https://openalex.org/W2379561210","https://openalex.org/W2393594433","https://openalex.org/W2829035005","https://openalex.org/W2349016073","https://openalex.org/W1915799532","https://openalex.org/W2351627116","https://openalex.org/W3015748062"],"abstract_inverted_index":{"A":[0],"improving":[1],"Steady":[2],"State":[3],"Genetic":[4],"Algorithm":[5],"for":[6,49],"global":[7,113],"optimization":[8],"over":[9],"linear":[10,89],"constraint":[11,90],"non-convex":[12],"programmin":[13],"g":[14],"problem":[15,24,75],"is":[16,43,46,63,76,81],"presented.":[17],"By":[18],"convex":[19,38,60],"analyzing,":[20],"the":[21,35,71,112],"primal":[22],"optimal":[23],"can":[25,104,110],"be":[26],"converted":[27],"to":[28,51,84],"an":[29,106],"equivalent":[30],"problem,":[31],"in":[32,66,88],"which":[33],"only":[34,99],"information":[36],"of":[37,40,73,115],"extremes":[39,87],"feasible":[41],"space":[42],"included,":[44],"and":[45,78,109],"more":[47],"easy":[48],"GAs":[50],"solve.":[52],"For":[53],"avoiding":[54],"invalid":[55],"genetic":[56],"operators,":[57],"a":[58,69,79],"redesigned":[59],"crossover":[61],"operator":[62],"also":[64,82,103],"performed":[65],"evolving.":[67],"As":[68],"integrality,":[70],"quality":[72],"two":[74],"proven,":[77],"method":[80],"given":[83],"get":[85,111],"all":[86],"space.":[91],"Simulation":[92],"result":[93],"show":[94],"that":[95],"new":[96],"algorithm":[97],"not":[98],"converges":[100],"faster,":[101],"but":[102],"maintain":[105],"diversity":[107],"population,":[108],"optimum":[114],"test":[116],"problem.":[117]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W987269561","counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
