{"id":"https://openalex.org/W3046470293","doi":"https://doi.org/10.1145/3377929.3398185","title":"A modified covariance matrix adaptation evolution strategy for real-world constrained optimization problems","display_name":"A modified covariance matrix adaptation evolution strategy for real-world constrained optimization problems","publication_year":2020,"publication_date":"2020-07-08","ids":{"openalex":"https://openalex.org/W3046470293","doi":"https://doi.org/10.1145/3377929.3398185","mag":"3046470293"},"language":"en","primary_location":{"id":"doi:10.1145/3377929.3398185","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3377929.3398185","pdf_url":"https://dl.acm.org/action/downloadSupplement?doi=10.1145%2F3377929.3398185&file=p11_przewozniczek_suppl.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/action/downloadSupplement?doi=10.1145%2F3377929.3398185&file=p11_przewozniczek_suppl.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100602997","display_name":"Abhishek Kumar","orcid":"https://orcid.org/0000-0002-8783-5128"},"institutions":[{"id":"https://openalex.org/I91357014","display_name":"Banaras Hindu University","ror":"https://ror.org/04cdn2797","country_code":"IN","type":"education","lineage":["https://openalex.org/I91357014"]},{"id":"https://openalex.org/I56404289","display_name":"Indian Institute of Technology BHU","ror":"https://ror.org/01kh5gc44","country_code":"IN","type":"education","lineage":["https://openalex.org/I56404289"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Abhishek Kumar","raw_affiliation_strings":["Indian Institute of Technology (BHU), Varanasi, India"],"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology (BHU), Varanasi, India","institution_ids":["https://openalex.org/I56404289","https://openalex.org/I91357014"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000078546","display_name":"Swagatam Das","orcid":"https://orcid.org/0000-0001-6843-4508"},"institutions":[{"id":"https://openalex.org/I6498739","display_name":"Indian Statistical Institute","ror":"https://ror.org/00q2w1j53","country_code":"IN","type":"education","lineage":["https://openalex.org/I6498739"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Swagatam Das","raw_affiliation_strings":["Indian Statistical Institute, Kolkata, India"],"affiliations":[{"raw_affiliation_string":"Indian Statistical Institute, Kolkata, India","institution_ids":["https://openalex.org/I6498739"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090445830","display_name":"Ivan Zelinka","orcid":"https://orcid.org/0000-0002-3858-7340"},"institutions":[{"id":"https://openalex.org/I142208455","display_name":"VSB - Technical University of Ostrava","ror":"https://ror.org/05x8mcb75","country_code":"CZ","type":"education","lineage":["https://openalex.org/I142208455"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Ivan Zelinka","raw_affiliation_strings":["Technical University of Ostrava, Ostrava-Poruba, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Technical University of Ostrava, Ostrava-Poruba, Czech Republic","institution_ids":["https://openalex.org/I142208455"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100602997"],"corresponding_institution_ids":["https://openalex.org/I56404289","https://openalex.org/I91357014"],"apc_list":null,"apc_paid":null,"fwci":3.9768,"has_fulltext":true,"cited_by_count":56,"citation_normalized_percentile":{"value":0.94758834,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"11","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9997000098228455,"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.9997000098228455,"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.9955000281333923,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9847999811172485,"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/cma-es","display_name":"CMA-ES","score":0.8509219884872437},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7285948395729065},{"id":"https://openalex.org/keywords/hessian-matrix","display_name":"Hessian matrix","score":0.7137911915779114},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5232811570167542},{"id":"https://openalex.org/keywords/linear-matrix-inequality","display_name":"Linear matrix inequality","score":0.4875321090221405},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48442867398262024},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.47004833817481995},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.4672529399394989},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.46095991134643555},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4570167362689972},{"id":"https://openalex.org/keywords/continuous-optimization","display_name":"Continuous optimization","score":0.4377378225326538},{"id":"https://openalex.org/keywords/evolution-strategy","display_name":"Evolution strategy","score":0.42391514778137207},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3961482346057892},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3925844728946686},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.22868123650550842},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.2272954285144806},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.1861034333705902},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.11344215273857117}],"concepts":[{"id":"https://openalex.org/C205555498","wikidata":"https://www.wikidata.org/wiki/Q505588","display_name":"CMA-ES","level":4,"score":0.8509219884872437},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7285948395729065},{"id":"https://openalex.org/C203616005","wikidata":"https://www.wikidata.org/wiki/Q620495","display_name":"Hessian matrix","level":2,"score":0.7137911915779114},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5232811570167542},{"id":"https://openalex.org/C201829737","wikidata":"https://www.wikidata.org/wiki/Q2022760","display_name":"Linear matrix inequality","level":2,"score":0.4875321090221405},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48442867398262024},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.47004833817481995},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.4672529399394989},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.46095991134643555},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4570167362689972},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.4377378225326538},{"id":"https://openalex.org/C207002847","wikidata":"https://www.wikidata.org/wiki/Q2912857","display_name":"Evolution strategy","level":3,"score":0.42391514778137207},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3961482346057892},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3925844728946686},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.22868123650550842},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.2272954285144806},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.1861034333705902},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.11344215273857117},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3377929.3398185","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3377929.3398185","pdf_url":"https://dl.acm.org/action/downloadSupplement?doi=10.1145%2F3377929.3398185&file=p11_przewozniczek_suppl.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3377929.3398185","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3377929.3398185","pdf_url":"https://dl.acm.org/action/downloadSupplement?doi=10.1145%2F3377929.3398185&file=p11_przewozniczek_suppl.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3046470293.pdf","grobid_xml":"https://content.openalex.org/works/W3046470293.grobid-xml"},"referenced_works_count":2,"referenced_works":["https://openalex.org/W2896508930","https://openalex.org/W3015290284"],"related_works":["https://openalex.org/W2807129720","https://openalex.org/W4297788869","https://openalex.org/W2053451340","https://openalex.org/W2272252676","https://openalex.org/W2970789884","https://openalex.org/W2918510433","https://openalex.org/W2810095338","https://openalex.org/W2896508930","https://openalex.org/W2399010267","https://openalex.org/W4206639779"],"abstract_inverted_index":{"Most":[0],"of":[1,29,45,105,114,122,135],"the":[2,30,43,72,80,103,106,120,123],"real-world":[3,115],"black-box":[4,63],"optimization":[5,64,116],"problems":[6,65,117],"are":[7],"associated":[8],"with":[9,37],"multiple":[10],"non-linear":[11],"as":[12,14,54],"well":[13],"non-convex":[15],"constraints,":[16],"making":[17],"them":[18],"difficult":[19],"to":[20,41,71,79,101],"solve.":[21],"In":[22],"this":[23],"work,":[24],"we":[25],"introduce":[26],"a":[27,55,68,98,112],"variant":[28],"Covariance":[31],"Matrix":[32],"Adaptation":[33],"Evolution":[34],"Strategy":[35],"(CMA-ES)":[36],"linear":[38],"timing":[39],"complexity":[40],"adopt":[42],"constraints":[44],"Constrained":[46],"Optimization":[47],"Problems":[48],"(COPs).":[49],"CMA-ES":[50],"is":[51,126],"already":[52],"well-known":[53],"powerful":[56],"algorithm":[57,92,125],"for":[58],"solving":[59],"continuous,":[60],"non-convex,":[61],"and":[62,97,138],"by":[66,84],"fitting":[67],"second-order":[69],"model":[70],"underlying":[73],"objective":[74],"function":[75],"(similar":[76],"in":[77,87,133],"spirit,":[78],"Hessian":[81],"approximation":[82],"used":[83],"Quasi-Newton":[85],"methods":[86],"mathematical":[88],"programming).":[89],"The":[90,108],"proposed":[91,124],"utilizes":[93],"an":[94],"e-constraint-based":[95],"ranking":[96],"repair":[99],"method":[100],"handle":[102],"violation":[104],"constraints.":[107],"experimental":[109],"results":[110],"on":[111],"group":[113],"show":[118],"that":[119],"performance":[121],"better":[127],"than":[128],"several":[129],"other":[130],"state-of-the-art":[131],"algorithms":[132],"terms":[134],"constraint":[136],"handling":[137],"robustness.":[139]},"counts_by_year":[{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":18},{"year":2023,"cited_by_count":17},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":7}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}