{"id":"W4403705855","doi":"10.23952/jnva.8.2024.6.02","title":"Semidefinite programming approximation for a matrix optimization problem over an uncertain linear system","year":2024,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Hong Kong Polytechnic University; National Natural Science Foundation of China","keywords":"Semidefinite programming; Semidefinite embedding; Linear programming; Mathematical optimization; Quadratically constrained quadratic program; Second-order cone programming; Matrix (chemical analysis); Mathematics; Optimization problem; Linear matrix inequality; Robust optimization; Computer science; Convex optimization; Quadratic programming","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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.001366109,0.00016091,0.0003586458,0.001058033,0.000184525,0.0005810802,0.0002613683,0.00009374409,0.00002683482],"category_scores_gemma":[0.00008617205,0.0001293738,0.0003645366,0.002278538,0.00001516043,0.001373433,0.00004045782,0.000123977,0.000002009313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001049083,"about_ca_system_score_gemma":0.0002177584,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001877458,"about_ca_topic_score_gemma":0.000004927175,"domain_scores_codex":[0.9980747,0.0001139978,0.0008072913,0.0003197257,0.0005265084,0.0001578293],"domain_scores_gemma":[0.998107,0.0002628809,0.0004542048,0.000165364,0.0008770767,0.0001334819],"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.00002177652,0.00009039279,0.0002711705,0.0001073155,0.00115803,0.000003951559,0.0002954463,0.8748409,0.00002407804,0.1208987,0.00002885936,0.002259454],"study_design_scores_gemma":[0.0003297451,0.0001094238,0.0002856261,0.00004204448,0.001173464,0.0000301302,0.00004965316,0.9957433,0.000006731648,0.0008173811,0.001264566,0.0001479477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000363523,0.0002215068,0.997961,0.0009735482,0.0001535285,0.0001686726,0.00004126452,0.00007165872,0.00004526954],"genre_scores_gemma":[0.04507583,0.00004108732,0.953865,0.00007053614,0.0004522076,0.00001623014,0.0002573401,0.00001332782,0.0002084693],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1209024,"threshold_uncertainty_score":0.5603369,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01608318479415679,"score_gpt":0.2949658219614598,"score_spread":0.278882637167303,"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."}}