{"id":"https://openalex.org/W2074925460","doi":"https://doi.org/10.1137/100793955","title":"KKT Solution and Conic Relaxation for Solving Quadratically Constrained Quadratic Programming Problems","display_name":"KKT Solution and Conic Relaxation for Solving Quadratically Constrained Quadratic Programming Problems","publication_year":2011,"publication_date":"2011-10-01","ids":{"openalex":"https://openalex.org/W2074925460","doi":"https://doi.org/10.1137/100793955","mag":"2074925460"},"language":"en","primary_location":{"id":"doi:10.1137/100793955","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100793955","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","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/A5022914600","display_name":"Cheng L\u00fc","orcid":"https://orcid.org/0000-0003-1877-7531"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Cheng Lu","raw_affiliation_strings":["c-lu06@mails.tsinghua.edu.cn and zwang@math.tsinghua.edu.cn and wxing@math.tsinghua.edu.cn#TAB#"],"affiliations":[{"raw_affiliation_string":"c-lu06@mails.tsinghua.edu.cn and zwang@math.tsinghua.edu.cn and wxing@math.tsinghua.edu.cn#TAB#","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027860626","display_name":"Shu\u2010Cherng Fang","orcid":"https://orcid.org/0000-0001-5087-3262"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shu-Cherng Fang","raw_affiliation_strings":["fang@ncsu.edu and qingweijin@gmail.com#TAB#"],"affiliations":[{"raw_affiliation_string":"fang@ncsu.edu and qingweijin@gmail.com#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011516134","display_name":"Qingwei Jin","orcid":"https://orcid.org/0000-0001-6599-8754"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Qingwei Jin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100628475","display_name":"Zhenbo Wang","orcid":"https://orcid.org/0000-0002-8979-9765"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhenbo Wang","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5023378662","display_name":"Wenxun Xing","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wenxun Xing","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5022914600"],"corresponding_institution_ids":["https://openalex.org/I99065089"],"apc_list":null,"apc_paid":null,"fwci":8.1685,"has_fulltext":false,"cited_by_count":49,"citation_normalized_percentile":{"value":0.97965952,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"21","issue":"4","first_page":"1475","last_page":"1490"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.989300012588501,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10545","display_name":"Optimization and Variational Analysis","score":0.9891999959945679,"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/quadratic-growth","display_name":"Quadratic growth","score":0.9290245771408081},{"id":"https://openalex.org/keywords/karush\u2013kuhn\u2013tucker-conditions","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","score":0.8773770928382874},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7789328694343567},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.7603158950805664},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.7480047941207886},{"id":"https://openalex.org/keywords/conic-section","display_name":"Conic section","score":0.6958630681037903},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.6811808347702026},{"id":"https://openalex.org/keywords/second-order-cone-programming","display_name":"Second-order cone programming","score":0.6272664666175842},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6227197051048279},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5407720804214478},{"id":"https://openalex.org/keywords/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.47953200340270996},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.4253343641757965},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.32511091232299805},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18156585097312927},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.1729443371295929},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.11894261837005615}],"concepts":[{"id":"https://openalex.org/C195956108","wikidata":"https://www.wikidata.org/wiki/Q7268362","display_name":"Quadratic growth","level":2,"score":0.9290245771408081},{"id":"https://openalex.org/C50454189","wikidata":"https://www.wikidata.org/wiki/Q2075125","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","level":2,"score":0.8773770928382874},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7789328694343567},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.7603158950805664},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.7480047941207886},{"id":"https://openalex.org/C108598597","wikidata":"https://www.wikidata.org/wiki/Q124255","display_name":"Conic section","level":2,"score":0.6958630681037903},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.6811808347702026},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.6272664666175842},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6227197051048279},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5407720804214478},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.47953200340270996},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.4253343641757965},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.32511091232299805},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18156585097312927},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.1729443371295929},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.11894261837005615},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/100793955","is_oa":false,"landing_page_url":"https://doi.org/10.1137/100793955","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1508674681","https://openalex.org/W1549791526","https://openalex.org/W1570765209","https://openalex.org/W1967344706","https://openalex.org/W1968745099","https://openalex.org/W1975406009","https://openalex.org/W2063676335","https://openalex.org/W2074859470","https://openalex.org/W2075781693","https://openalex.org/W2078600458","https://openalex.org/W2091480518","https://openalex.org/W2091531873","https://openalex.org/W2105235982","https://openalex.org/W2110540077","https://openalex.org/W2120146316","https://openalex.org/W2120889791","https://openalex.org/W2121785204","https://openalex.org/W2124038748","https://openalex.org/W2315328158","https://openalex.org/W2327365606","https://openalex.org/W2776367212"],"related_works":["https://openalex.org/W2951903936","https://openalex.org/W2004392729","https://openalex.org/W4298879965","https://openalex.org/W2233303476","https://openalex.org/W2492346510","https://openalex.org/W2897697015","https://openalex.org/W2169350232","https://openalex.org/W1878408459","https://openalex.org/W2566013347","https://openalex.org/W3035921962"],"abstract_inverted_index":{"To":[0],"find":[1],"a":[2,31,51],"global":[3,32],"optimal":[4],"solution":[5],"to":[6,30],"the":[7,15,40,46],"quadratically":[8,64],"constrained":[9,65],"quadratic":[10,66],"programming":[11,25,67],"problem,":[12],"we":[13,49],"explore":[14],"relationship":[16],"between":[17],"its":[18],"Lagrangian":[19],"multipliers":[20],"and":[21],"related":[22],"linear":[23],"conic":[24],"problems.":[26,68],"This":[27],"study":[28],"leads":[29],"optimality":[33],"condition":[34,44],"that":[35,54],"is":[36],"more":[37,62],"general":[38],"than":[39],"known":[41],"positive":[42],"semidefiniteness":[43],"in":[45],"literature.":[47],"Moreover,":[48],"propose":[50],"computational":[52],"scheme":[53],"provides":[55],"clues":[56],"of":[57],"designing":[58],"effective":[59],"algorithms":[60],"for":[61],"solvable":[63]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":5},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}