{"id":"https://openalex.org/W2043567166","doi":"https://doi.org/10.1109/icassp.2014.6855084","title":"Generalized quadratically constrained quadratic programming for signal processing","display_name":"Generalized quadratically constrained quadratic programming for signal processing","publication_year":2014,"publication_date":"2014-05-01","ids":{"openalex":"https://openalex.org/W2043567166","doi":"https://doi.org/10.1109/icassp.2014.6855084","mag":"2043567166"},"language":"en","primary_location":{"id":"doi:10.1109/icassp.2014.6855084","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2014.6855084","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5040288359","display_name":"Arash Khabbazibasmenj","orcid":null},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Arash Khabbazibasmenj","raw_affiliation_strings":["Dept. of Electrical and Computer Engineering, University of Alberta, Edmonton, AB, Canada","Dept. of Electr. & Comput. Eng., Univ. of Alberta, Edmonton, AB, Canada#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical and Computer Engineering, University of Alberta, Edmonton, AB, Canada","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Univ. of Alberta, Edmonton, AB, Canada#TAB#","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055234860","display_name":"Sergiy A. Vorobyov","orcid":"https://orcid.org/0000-0001-7249-647X"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Sergiy A. Vorobyov","raw_affiliation_strings":["Dept. of Electrical and Computer Engineering, University of Alberta, Edmonton, AB, Canada","Dept. of Electr. & Comput. Eng., Univ. of Alberta, Edmonton, AB, Canada#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical and Computer Engineering, University of Alberta, Edmonton, AB, Canada","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Univ. of Alberta, Edmonton, AB, Canada#TAB#","institution_ids":["https://openalex.org/I154425047"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I154425047"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"7629","last_page":"7633"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T11873","display_name":"PAPR reduction in OFDM","score":0.9869999885559082,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.8773072957992554},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.8088826537132263},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.7126225233078003},{"id":"https://openalex.org/keywords/karush\u2013kuhn\u2013tucker-conditions","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","score":0.712112307548523},{"id":"https://openalex.org/keywords/second-order-cone-programming","display_name":"Second-order cone programming","score":0.6785919666290283},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6487419605255127},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5621659159660339},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5553372502326965},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.460070937871933},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4238548278808594},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3678637742996216},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.31910401582717896},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.216172456741333}],"concepts":[{"id":"https://openalex.org/C195956108","wikidata":"https://www.wikidata.org/wiki/Q7268362","display_name":"Quadratic growth","level":2,"score":0.8773072957992554},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.8088826537132263},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.7126225233078003},{"id":"https://openalex.org/C50454189","wikidata":"https://www.wikidata.org/wiki/Q2075125","display_name":"Karush\u2013Kuhn\u2013Tucker conditions","level":2,"score":0.712112307548523},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.6785919666290283},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6487419605255127},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5621659159660339},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5553372502326965},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.460070937871933},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4238548278808594},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3678637742996216},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.31910401582717896},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.216172456741333},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icassp.2014.6855084","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icassp.2014.6855084","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W75157487","https://openalex.org/W121557243","https://openalex.org/W1499399028","https://openalex.org/W1981044874","https://openalex.org/W1994660154","https://openalex.org/W1996215314","https://openalex.org/W2015883438","https://openalex.org/W2040699579","https://openalex.org/W2045148236","https://openalex.org/W2054430006","https://openalex.org/W2074978263","https://openalex.org/W2082038839","https://openalex.org/W2100573451","https://openalex.org/W2108927308","https://openalex.org/W2116674353","https://openalex.org/W2122744491","https://openalex.org/W2129780803","https://openalex.org/W2134383046","https://openalex.org/W2159081591","https://openalex.org/W2169153222","https://openalex.org/W2301746362","https://openalex.org/W2495457432","https://openalex.org/W3150183338","https://openalex.org/W4212864101","https://openalex.org/W6677538459"],"related_works":["https://openalex.org/W1878408459","https://openalex.org/W4297407962","https://openalex.org/W4378551200","https://openalex.org/W2808715032","https://openalex.org/W1496670269","https://openalex.org/W2022619808","https://openalex.org/W2112847829","https://openalex.org/W2043567166","https://openalex.org/W2074925460","https://openalex.org/W2164754346"],"abstract_inverted_index":{"In":[0],"this":[1,58,128],"paper,":[2],"we":[3,31,98],"introduce":[4],"and":[5,28,45,51],"solve":[6,109],"a":[7,100,115,163],"particular":[8],"generalization":[9,34],"of":[10,25,35,42,60,114,156],"the":[11,36,49,52,69,76,84,110,124,131,137,157],"quadratically":[12],"constrained":[13],"quadratic":[14,46],"programming":[15,73,78],"(QCQP)":[16],"problem":[17,38,79,113],"which":[18],"is":[19,120],"frequently":[20],"encountered":[21],"in":[22,48,154],"different":[23],"fields":[24],"signal":[26],"processing":[27],"communications.":[29],"Specifically,":[30],"consider":[32],"such":[33],"QCQP":[37,117],"that":[39,57,107,123],"comprises":[40],"compositions":[41],"one-dimensional":[43],"convex":[44],"functions":[47,71],"constraint":[50],"objective":[53],"functions.":[54],"We":[55],"show":[56],"class":[59],"problems":[61],"can":[62,80,108,140,151],"be":[63,81,141,152],"precisely":[64],"or":[65],"approximately":[66],"recast":[67],"as":[68,160],"difference-of-convex":[70],"(DC)":[72],"problem.":[74,118,166],"Although":[75],"DC":[77,112],"solved":[82],"through":[83],"branch-and-bound":[85],"methods,":[86],"these":[87],"methods":[88],"do":[89],"not":[90],"have":[91],"any":[92],"worst-case":[93,104],"polynomial-time":[94,105],"complexity":[95,106],"guarantees.":[96],"Therefore,":[97],"develop":[99],"new":[101,148],"approach":[102],"with":[103],"corresponding":[111],"generalized":[116],"It":[119],"analytically":[121,143],"guaranteed":[122],"point":[125],"obtained":[126],"by":[127],"method":[129,150,159],"satisfies":[130],"Karsuh-Kuhn-Tucker":[132],"(KKT)":[133],"optimality":[134,139],"conditions.":[135,146],"Furthermore,":[136],"global":[138],"proved":[142],"under":[144],"certain":[145],"The":[147],"proposed":[149],"interpreted":[153],"terms":[155],"Newton's":[158],"applied":[161],"to":[162],"non-constrained":[164],"optimization":[165]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}