{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00100253,0.0002860677,0.0005503048,0.000106162,0.0002385087,0.0001494473,0.0002320683,0.0001232981,0.0003863254],"category_scores_gemma":[0.00201505,0.0001715902,0.00008710234,0.0002082617,0.0002778554,0.0002026685,0.0001319893,0.0001367044,0.00002655768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008189345,"about_ca_system_score_gemma":0.00006869569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006897086,"about_ca_topic_score_gemma":0.00001742593,"domain_scores_codex":[0.9977649,0.0001129738,0.0005058868,0.0004686632,0.0004931022,0.0006544621],"domain_scores_gemma":[0.9952734,0.003644354,0.0001731231,0.000404818,0.0002677842,0.0002365563],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002109666,0.0004876335,0.00005055996,0.001322033,0.0001984817,0.00001030193,0.0006970474,0.000008991032,0.001395908,0.4816242,0.0002653472,0.5137285],"study_design_scores_gemma":[0.003343964,0.0004150762,0.000009517919,0.0003695532,0.0001045502,0.00009350951,0.0001631946,0.0747885,0.002111548,0.9091142,0.009032388,0.0004539516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004314515,0.00001336025,0.9955583,0.001050325,0.00002362547,0.001687851,0.0000157689,0.0002633854,0.0009559781],"genre_scores_gemma":[0.01475369,0.000003723262,0.9832174,0.0000595903,0.0001071476,0.0005638541,0.000006024205,0.00009522614,0.001193401],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5132746,"threshold_uncertainty_score":0.6997246,"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."}}