{"id":"W2559883687","doi":"10.1007/s10107-016-1095-2","title":"A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables","year":2016,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":55,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Office of the Secretary of Defense; Air Force Office of Scientific Research; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Semidefinite programming; Bounded function; Quadratically constrained quadratic program; Mathematical optimization; Quadratic growth; Quadratic programming; Hermitian matrix; Rank (graph theory); Feasible region; Second-order cone programming; Trust region; Constraint (computer-aided design); Convex optimization; Regular polygon; Algorithm; Combinatorics; Computer science","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001156788,0.0009260689,0.001266848,0.0006241198,0.0004856694,0.001139453,0.001327663,0.001851209,0.007971744],"category_scores_gemma":[0.002256212,0.0005418904,0.0007476755,0.0009352468,0.0007844599,0.001095489,0.001679891,0.002048513,0.0008446428],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000692546,"about_ca_system_score_gemma":0.00166104,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003191205,"about_ca_topic_score_gemma":0.003796482,"domain_scores_codex":[0.9997109,0.0001010754,0.00001084556,0.00003718843,0.0001140847,0.0000259091],"domain_scores_gemma":[0.9992119,0.0004697334,0.00003681539,0.00003914761,0.0001881829,0.00005419977],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001635027,0.0001054491,0.0002347005,0.000348671,0.00006301174,0.0001310965,0.00008086533,0.7698966,0.004163825,0.1009257,0.01063819,0.1132483],"study_design_scores_gemma":[0.000008760125,0.00001260869,0.00001486926,0.000008983983,0.000004041424,0.000009471646,0.000004589196,0.9928365,0.0001525909,0.005986508,0.0009578782,0.000003156241],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001480859,0.0001930138,0.9949222,0.0001667163,0.00007443432,0.00003228441,0.0000438253,0.00006297856,0.003023595],"genre_scores_gemma":[0.1202794,0.0007058608,0.8672884,0.0004075528,0.0002229358,0.0004197641,0.0002801649,0.0002818059,0.01011418],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007971744,"threshold_uncertainty_score":0.02666813,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07666032763318521,"score_gpt":0.3906559550134406,"score_spread":0.3139956273802554,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}