{"id":"https://openalex.org/W2472752992","doi":"https://doi.org/10.1080/03610918.2015.1030414","title":"Computing A-optimal and E-optimal designs for regression models via semidefinite programming","display_name":"Computing A-optimal and E-optimal designs for regression models via semidefinite programming","publication_year":2015,"publication_date":"2015-05-15","ids":{"openalex":"https://openalex.org/W2472752992","doi":"https://doi.org/10.1080/03610918.2015.1030414","mag":"2472752992"},"language":"en","primary_location":{"id":"doi:10.1080/03610918.2015.1030414","is_oa":false,"landing_page_url":"https://doi.org/10.1080/03610918.2015.1030414","pdf_url":null,"source":{"id":"https://openalex.org/S153329750","display_name":"Communications in Statistics - Simulation and Computation","issn_l":"0361-0918","issn":["0361-0918","1532-4141"],"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":"Communications in Statistics - Simulation and Computation","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/A5067148719","display_name":"Jane J. Ye","orcid":"https://orcid.org/0000-0002-5954-4737"},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Jane J. Ye","raw_affiliation_strings":["Department of Mathematics and Statistics, University of Victoria, Victoria, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, University of Victoria, Victoria, Canada","institution_ids":["https://openalex.org/I212119943"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079856225","display_name":"Julie Zhou","orcid":"https://orcid.org/0000-0002-4876-4080"},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Julie Zhou","raw_affiliation_strings":["Department of Mathematics and Statistics, University of Victoria, Victoria, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, University of Victoria, Victoria, Canada","institution_ids":["https://openalex.org/I212119943"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084803967","display_name":"Wenjie Zhou","orcid":"https://orcid.org/0000-0002-0766-012X"},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Wenjie Zhou","raw_affiliation_strings":["Department of Mathematics and Statistics, University of Victoria, Victoria, Canada"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, University of Victoria, Victoria, Canada","institution_ids":["https://openalex.org/I212119943"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5079856225"],"corresponding_institution_ids":["https://openalex.org/I212119943"],"apc_list":null,"apc_paid":null,"fwci":1.6024,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.86368468,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"46","issue":"3","first_page":"2011","last_page":"2024"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11798","display_name":"Optimal Experimental Design Methods","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11798","display_name":"Optimal Experimental Design Methods","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9990000128746033,"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.9972000122070312,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite programming","score":0.8781046867370605},{"id":"https://openalex.org/keywords/optimal-design","display_name":"Optimal design","score":0.6856576204299927},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6759160757064819},{"id":"https://openalex.org/keywords/matlab","display_name":"MATLAB","score":0.6204873323440552},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5101957321166992},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4933144152164459},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.468656450510025},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.46797922253608704},{"id":"https://openalex.org/keywords/semidefinite-embedding","display_name":"Semidefinite embedding","score":0.46383652091026306},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.44658946990966797},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.1023835837841034},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.07260867953300476}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.8781046867370605},{"id":"https://openalex.org/C186394612","wikidata":"https://www.wikidata.org/wiki/Q7098942","display_name":"Optimal design","level":2,"score":0.6856576204299927},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6759160757064819},{"id":"https://openalex.org/C2780365114","wikidata":"https://www.wikidata.org/wiki/Q169478","display_name":"MATLAB","level":2,"score":0.6204873323440552},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5101957321166992},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4933144152164459},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.468656450510025},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.46797922253608704},{"id":"https://openalex.org/C206818286","wikidata":"https://www.wikidata.org/wiki/Q7449403","display_name":"Semidefinite embedding","level":4,"score":0.46383652091026306},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.44658946990966797},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.1023835837841034},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.07260867953300476},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","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},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/03610918.2015.1030414","is_oa":false,"landing_page_url":"https://doi.org/10.1080/03610918.2015.1030414","pdf_url":null,"source":{"id":"https://openalex.org/S153329750","display_name":"Communications in Statistics - Simulation and Computation","issn_l":"0361-0918","issn":["0361-0918","1532-4141"],"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":"Communications in Statistics - Simulation and Computation","raw_type":"journal-article"},{"id":"pmh:oai:dspace.library.uvic.ca:1828/7382","is_oa":false,"landing_page_url":"http://hdl.handle.net/1828/7382","pdf_url":null,"source":{"id":"https://openalex.org/S4306401509","display_name":"UVic\u2019s Research and Learning Repository (University of Victoria)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I212119943","host_organization_name":"University of Victoria","host_organization_lineage":["https://openalex.org/I212119943"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Postprint"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1530434326","https://openalex.org/W1967073510","https://openalex.org/W1969816587","https://openalex.org/W1970608820","https://openalex.org/W1974521626","https://openalex.org/W1996395235","https://openalex.org/W2029591913","https://openalex.org/W2069704975","https://openalex.org/W2103862327","https://openalex.org/W2113210417","https://openalex.org/W2144578442","https://openalex.org/W2156195892","https://openalex.org/W2170721105","https://openalex.org/W2296319761","https://openalex.org/W2483479423","https://openalex.org/W2610857016","https://openalex.org/W2912522929","https://openalex.org/W3103871524","https://openalex.org/W3122956596","https://openalex.org/W4300031234"],"related_works":["https://openalex.org/W2385886188","https://openalex.org/W2288891047","https://openalex.org/W2524928742","https://openalex.org/W2362452378","https://openalex.org/W2353517195","https://openalex.org/W3166939022","https://openalex.org/W1727084346","https://openalex.org/W2544939111","https://openalex.org/W2386048074","https://openalex.org/W2572095861"],"abstract_inverted_index":{"In":[0,31,77],"semidefinite":[1],"programming":[2],"(SDP),":[3],"we":[4,34],"minimize":[5],"a":[6,12,98],"linear":[7,13,68],"objective":[8],"function":[9],"subject":[10],"to":[11,27,39,59],"matrix":[14],"being":[15],"positive":[16],"semidefinite.":[17],"A":[18],"powerful":[19],"program,":[20],"SeDuMi,":[21],"has":[22],"been":[23],"developed":[24],"in":[25,36,105,112],"MATLAB":[26,125],"solve":[28,50],"SDP":[29,47,114],"problems.":[30],"this":[32],"article,":[33],"show":[35],"detail":[37],"how":[38],"formulate":[40],"A-optimal":[41,62],"and":[42,49,63,69,97,116,123],"E-optimal":[43,64],"design":[44,75,83,95],"problems":[45,48,115],"as":[46],"them":[51],"by":[52,118],"SeDuMi.":[53,119],"This":[54],"technique":[55],"can":[56,108],"be":[57,109],"used":[58],"construct":[60],"approximate":[61],"designs":[65,91,107],"for":[66,88],"all":[67],"nonlinear":[70],"regression":[71],"models":[72],"with":[73],"discrete":[74,82],"spaces.":[76],"addition,":[78],"the":[79,106,113],"results":[80],"on":[81,92],"spaces":[84],"provide":[85],"useful":[86],"guidance":[87],"finding":[89],"optimal":[90],"any":[93],"continuous":[94],"space,":[96],"convergence":[99],"result":[100],"is":[101],"derived.":[102],"Moreover,":[103],"restrictions":[104],"easily":[110],"incorporated":[111],"solved":[117],"Several":[120],"representative":[121],"examples":[122],"one":[124],"program":[126],"are":[127],"given.":[128]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}