{"id":"https://openalex.org/W7123357583","doi":"https://doi.org/10.1109/cdc57313.2025.11312321","title":"A polynomial-based QCQP solver for encrypted optimization","display_name":"A polynomial-based QCQP solver for encrypted optimization","publication_year":2025,"publication_date":"2025-12-09","ids":{"openalex":"https://openalex.org/W7123357583","doi":"https://doi.org/10.1109/cdc57313.2025.11312321"},"language":null,"primary_location":{"id":"doi:10.1109/cdc57313.2025.11312321","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc57313.2025.11312321","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 64th Conference on Decision and Control (CDC)","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/A5090922214","display_name":"Sebastian Schlor","orcid":"https://orcid.org/0000-0002-8022-472X"},"institutions":[{"id":"https://openalex.org/I100066346","display_name":"University of Stuttgart","ror":"https://ror.org/04vnq7t77","country_code":"DE","type":"education","lineage":["https://openalex.org/I100066346"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sebastian Schlor","raw_affiliation_strings":["University of Stuttgart, Institute for Systems Theory and Automatic Control,Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Stuttgart, Institute for Systems Theory and Automatic Control,Germany","institution_ids":["https://openalex.org/I100066346"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088084632","display_name":"Andrea M. Iannelli","orcid":null},"institutions":[{"id":"https://openalex.org/I100066346","display_name":"University of Stuttgart","ror":"https://ror.org/04vnq7t77","country_code":"DE","type":"education","lineage":["https://openalex.org/I100066346"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Andrea Iannelli","raw_affiliation_strings":["University of Stuttgart, Institute for Systems Theory and Automatic Control,Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Stuttgart, Institute for Systems Theory and Automatic Control,Germany","institution_ids":["https://openalex.org/I100066346"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5009631434","display_name":"J. D. Kim","orcid":"https://orcid.org/0000-0002-7843-7996"},"institutions":[{"id":"https://openalex.org/I118373667","display_name":"Seoul National University of Science and Technology","ror":"https://ror.org/00chfja07","country_code":"KR","type":"education","lineage":["https://openalex.org/I118373667"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Junsoo Kim","raw_affiliation_strings":["Seoul National University of Science and Technology,Department of Electrical and Information Engineering,South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Seoul National University of Science and Technology,Department of Electrical and Information Engineering,South Korea","institution_ids":["https://openalex.org/I118373667"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005533127","display_name":"Shim Hj","orcid":null},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Hyungbo Shim","raw_affiliation_strings":["Seoul National University, ASRI,Department of Electrical and Computer Engineering,South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Seoul National University, ASRI,Department of Electrical and Computer Engineering,South Korea","institution_ids":["https://openalex.org/I139264467"]}]},{"author_position":"last","author":{"id":null,"display_name":"Frank Allg\u00f6wer","orcid":null},"institutions":[{"id":"https://openalex.org/I100066346","display_name":"University of Stuttgart","ror":"https://ror.org/04vnq7t77","country_code":"DE","type":"education","lineage":["https://openalex.org/I100066346"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Frank Allg\u00f6wer","raw_affiliation_strings":["University of Stuttgart, Institute for Systems Theory and Automatic Control,Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Stuttgart, Institute for Systems Theory and Automatic Control,Germany","institution_ids":["https://openalex.org/I100066346"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"7885","last_page":"7891"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.5202999711036682,"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.5202999711036682,"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/T10237","display_name":"Cryptography and Data Security","score":0.15760000050067902,"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/T10951","display_name":"Cryptographic Implementations and Security","score":0.04879999905824661,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.6226000189781189},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5649999976158142},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.5200999975204468},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.4871000051498413},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4731000065803528},{"id":"https://openalex.org/keywords/homomorphic-encryption","display_name":"Homomorphic encryption","score":0.4422999918460846},{"id":"https://openalex.org/keywords/encryption","display_name":"Encryption","score":0.43959999084472656},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.4325000047683716},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.4099999964237213},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.40450000762939453}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6626999974250793},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.6226000189781189},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6216999888420105},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5649999976158142},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.5200999975204468},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.4871000051498413},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4731000065803528},{"id":"https://openalex.org/C158338273","wikidata":"https://www.wikidata.org/wiki/Q2154943","display_name":"Homomorphic encryption","level":3,"score":0.4422999918460846},{"id":"https://openalex.org/C148730421","wikidata":"https://www.wikidata.org/wiki/Q141090","display_name":"Encryption","level":2,"score":0.43959999084472656},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.4325000047683716},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.4099999964237213},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.40450000762939453},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.39910000562667847},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3955000042915344},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3903000056743622},{"id":"https://openalex.org/C195064452","wikidata":"https://www.wikidata.org/wiki/Q2823740","display_name":"Active set method","level":4,"score":0.36239999532699585},{"id":"https://openalex.org/C195956108","wikidata":"https://www.wikidata.org/wiki/Q7268362","display_name":"Quadratic growth","level":2,"score":0.3571999967098236},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.3553999960422516},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.35510000586509705},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.34610000252723694},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33340001106262207},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.3172999918460846},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.3149000108242035},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.30550000071525574},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.29760000109672546},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.2955999970436096},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.2953999936580658},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.29269999265670776},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.28459998965263367},{"id":"https://openalex.org/C166437778","wikidata":"https://www.wikidata.org/wiki/Q50695","display_name":"Quadratic function","level":3,"score":0.28130000829696655},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.2806999981403351},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.27230000495910645},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.26750001311302185},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.25360000133514404}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc57313.2025.11312321","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc57313.2025.11312321","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 64th Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320671","display_name":"National Research Foundation","ror":"https://ror.org/05s0g1g46"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W2069671092","https://openalex.org/W2124541940","https://openalex.org/W2149603017","https://openalex.org/W2570972465","https://openalex.org/W2768174108","https://openalex.org/W2774167780","https://openalex.org/W2782729493","https://openalex.org/W2901156341","https://openalex.org/W2963426216","https://openalex.org/W2968124130","https://openalex.org/W2989605743","https://openalex.org/W2990280959","https://openalex.org/W2990644065","https://openalex.org/W3040353046","https://openalex.org/W3120640883","https://openalex.org/W3153465910","https://openalex.org/W4210468234","https://openalex.org/W4254106911","https://openalex.org/W4386543362","https://openalex.org/W4391020521","https://openalex.org/W4396753584","https://openalex.org/W4407949245"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"present":[4],"a":[5,10,52,84,115,134],"novel":[6],"method":[7,110,152],"for":[8],"solving":[9,26],"class":[11],"of":[12,42,54,58,70,86,103,117,136,164],"quadratically":[13],"constrained":[14,27,49,105],"quadratic":[15],"optimization":[16,28,50,88],"problems":[17,29,89],"using":[18],"only":[19],"additions":[20],"and":[21,98,140,167],"multiplications.":[22],"This":[23],"approach":[24],"enables":[25],"on":[30,155],"private":[31],"data":[32],"since":[33],"the":[34,40,48,68,71,75,79,95,101,104,124,130,137,141,148,151,161,168],"operations":[35],"involved":[36],"are":[37,64],"compatible":[38],"with":[39,120],"capabilities":[41],"homomorphic":[43],"encryption":[44],"schemes.":[45],"To":[46],"solve":[47],"problem,":[51,139,159],"sequence":[53,85,116],"polynomial":[55],"penalty":[56,76],"functions":[57],"increasing":[59],"degree":[60],"is":[61,111,127,144,153,171],"introduced,":[62],"which":[63],"sufficiently":[65],"steep":[66],"at":[67],"boundary":[69],"feasible":[72,142],"set.":[73],"Adding":[74],"function":[77,82],"to":[78,100,113,133],"original":[80,138],"cost":[81],"creates":[83],"unconstrained":[87],"whose":[90],"minimizer":[91,102,135],"always":[92],"lies":[93],"in":[94],"admissible":[96],"set":[97,143],"converges":[99,132],"problem.":[106],"A":[107],"gradient":[108],"descent":[109],"used":[112],"generate":[114],"iterates":[118],"associated":[119],"these":[121],"problems.":[122],"For":[123],"algorithm,":[125],"it":[126],"shown":[128],"that":[129],"iterate":[131],"positively":[145],"invariant":[146],"under":[147],"iteration.":[149],"Finally,":[150],"demonstrated":[154],"an":[156],"illustrative":[157],"cryptographic":[158],"finding":[160],"smaller":[162],"value":[163],"two":[165],"numbers,":[166],"encrypted":[169],"implementability":[170],"discussed.":[172]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2026-01-14T00:00:00"}