{"id":"W1999613454","doi":"10.1109/icc.2014.6884126","title":"Sequential Convex Programming for Full-Duplex Single-User MIMO systems","year":2014,"lang":"en","type":"article","venue":"","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"MIMO; Convex optimization; Mathematical optimization; Convex function; Maximization; Regular polygon; Linear matrix inequality; Computer science; Algorithm; Proper convex function; Mathematics; Matrix (chemical analysis); Convex combination; Beamforming; Telecommunications","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001582146,0.001485553,0.001212545,0.0003822467,0.0003744721,0.001165086,0.001154061,0.0008482489,0.002010597],"category_scores_gemma":[0.003083773,0.0006103003,0.0007482618,0.0008159132,0.0008933597,0.001057602,0.001001139,0.00168361,0.0003772222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001033499,"about_ca_system_score_gemma":0.001554694,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003801447,"about_ca_topic_score_gemma":0.002756036,"domain_scores_codex":[0.9990931,0.0004099426,0.0000310028,0.0001267688,0.0002479968,0.00009125692],"domain_scores_gemma":[0.9982842,0.001227819,0.00008079063,0.00007438537,0.0002743997,0.00005837718],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005066784,0.00002280627,0.0001337599,0.0000695234,0.00001925851,0.00004132117,0.00002849308,0.9635116,0.0006353807,0.01619667,0.0010258,0.01826473],"study_design_scores_gemma":[0.000003062518,0.000009786962,0.00001576959,0.000002117912,0.000001342014,0.000005697045,0.000004263295,0.9962692,0.0001672306,0.003268764,0.0002511774,0.000001576966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004046826,0.0001580371,0.9941169,0.000120845,0.00002647096,0.00002073007,0.00002949058,0.00007244902,0.001408146],"genre_scores_gemma":[0.5326371,0.001159278,0.457032,0.000321534,0.0001617358,0.0004469277,0.0003669049,0.0002271368,0.007647411],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003801447,"threshold_uncertainty_score":0.0083673,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02678979667782708,"score_gpt":0.2366313980655586,"score_spread":0.2098416013877315,"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."}}