乐胖代购免代理版

{"id":"https://openalex.org/W2000923338","doi":"https://doi.org/10.1007/s12532-011-0033-9","title":"Globally solving nonconvex quadratic programming problems via completely positive programming","display_name":"Globally solving nonconvex quadratic programming problems via completely positive programming","publication_year":2011,"publication_date":"2011-11-16","ids":{"openalex":"https://openalex.org/W2000923338","doi":"https://doi.org/10.1007/s12532-011-0033-9","mag":"2000923338"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1007/s12532-011-0033-9","pdf_url":null,"source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2957","issn":["1867-2957","1867-2949"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319965","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Springer Nature","Springer Science+Business Media"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5019122349","display_name":"Jieqiu Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I1282105669","display_name":"Argonne National Laboratory","ror":"https://ror.org/05gvnxz63","country_code":"US","type":"facility","lineage":["https://openalex.org/I1282105669","https://openalex.org/I1330989302","https://openalex.org/I39565521","https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jieqiu Chen","raw_affiliation_strings":["argonne national laboratory"],"affiliations":[{"raw_affiliation_string":"argonne national laboratory","institution_ids":["https://openalex.org/I1282105669"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002663715","display_name":"Samuel Burer","orcid":"https://orcid.org/0000-0001-5886-458X"},"institutions":[{"id":"https://openalex.org/I126307644","display_name":"University of Iowa","ror":"https://ror.org/036jqmy94","country_code":"US","type":"education","lineage":["https://openalex.org/I126307644"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Samuel Burer","raw_affiliation_strings":["University of Iowa, ."],"affiliations":[{"raw_affiliation_string":"University of Iowa, .","institution_ids":["https://openalex.org/I126307644"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2390,"currency":"EUR","value_usd":3090,"provenance":"doaj"},"apc_paid":null,"fwci":7.648,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":109,"citation_normalized_percentile":{"value":0.972973,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":98},"biblio":{"volume":"4","issue":"1","first_page":"33","last_page":"52"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9996,"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"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9996,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9758,"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/T10142","display_name":"Formal Methods in Verification","score":0.967,"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/karush\u2013kuhn\u2013tucker-conditions","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","score":0.8849201},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.66142756},{"id":"https://openalex.org/keywords/semidefinite-programming","display_name":"Semidefinite Programming","score":0.6229628},{"id":"https://openalex.org/keywords/active-set-method","display_name":"Active set method","score":0.6167555},{"id":"https://openalex.org/keywords/second-order-cone-programming","display_name":"Second-order cone programming","score":0.56962776},{"id":"https://openalex.org/keywords/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.41050333}],"concepts":[{"id":"https://openalex.org/C50454189","wikidata":"https://www.wikidata.org/wiki/Q2075125","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","level":2,"score":0.8849201},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.7511866},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.66142756},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6269217},{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.6229628},{"id":"https://openalex.org/C195064452","wikidata":"https://www.wikidata.org/wiki/Q2823740","display_name":"Active set method","level":4,"score":0.6167555},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5817081},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.56962776},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5097427},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.5061974},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.48589844},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42096475},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.41050333},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.351167},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35087568},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.2490181},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.10931572},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.07536614},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"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":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1007/s12532-011-0033-9","pdf_url":null,"source":{"id":"https://openalex.org/S173077093","display_name":"Mathematical Programming Computation","issn_l":"1867-2957","issn":["1867-2957","1867-2949"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319965","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Springer Nature","Springer Science+Business Media"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":23,"referenced_works":["https://openalex.org/W1571070457","https://openalex.org/W1812813109","https://openalex.org/W1981648990","https://openalex.org/W2000156923","https://openalex.org/W2000642309","https://openalex.org/W2001741445","https://openalex.org/W2007218093","https://openalex.org/W2021674665","https://openalex.org/W2025308368","https://openalex.org/W2031494345","https://openalex.org/W2033798957","https://openalex.org/W2035088317","https://openalex.org/W2038611554","https://openalex.org/W2078600458","https://openalex.org/W2080419468","https://openalex.org/W2085137170","https://openalex.org/W2102588682","https://openalex.org/W2106264302","https://openalex.org/W2149454052","https://openalex.org/W2169053534","https://openalex.org/W3029645440","https://openalex.org/W4292175028","https://openalex.org/W4293775970"],"related_works":["https://openalex.org/W4378551200","https://openalex.org/W4313119266","https://openalex.org/W4250818594","https://openalex.org/W4206704743","https://openalex.org/W3020857762","https://openalex.org/W2357193936","https://openalex.org/W2164807043","https://openalex.org/W2164754346","https://openalex.org/W1985181089","https://openalex.org/W1523347364"],"abstract_inverted_index":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2000923338","counts_by_year":[{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":15},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":15},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2024-12-13T13:43:46.772466","created_date":"2016-06-24"}