{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002282011,0.00154924,0.001491999,0.0004894874,0.0004528506,0.001497572,0.00095215,0.001515283,0.002336452],"category_scores_gemma":[0.004029599,0.0006416903,0.0009087736,0.0008648261,0.001200215,0.001105929,0.00117222,0.002642887,0.0002746039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001314479,"about_ca_system_score_gemma":0.001929767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008768352,"about_ca_topic_score_gemma":0.004863305,"domain_scores_codex":[0.9990351,0.0003944738,0.00003497894,0.0002107889,0.0002074829,0.0001171502],"domain_scores_gemma":[0.9969208,0.00232064,0.0002859157,0.0001010576,0.000289686,0.00008182391],"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.00002893126,0.00001800879,0.00009797098,0.00007479071,0.00001428471,0.00003882901,0.00002623456,0.989463,0.0004555489,0.005738794,0.0002439052,0.003799771],"study_design_scores_gemma":[0.000003340281,0.00001232756,0.00001440506,0.000002973164,0.000001765753,0.000004443308,0.000004316885,0.9983682,0.00009981776,0.001414452,0.00007242883,0.000001548823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01023495,0.0002480385,0.9869161,0.0002033972,0.00002555858,0.00003572873,0.00007560692,0.000106185,0.002154421],"genre_scores_gemma":[0.793162,0.0007440794,0.1998494,0.0001907365,0.00008617707,0.0004700666,0.0004012727,0.0001493865,0.004946928],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008768352,"threshold_uncertainty_score":0.0174346,"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."}}