{"id":"W4376148934","doi":"10.1017/s0962492922000113","title":"Linear optimization over homogeneous matrix cones","year":2023,"lang":"en","type":"article","venue":"Acta Numerica","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Office of Naval Research; Simons Institute for the Theory of Computing, University of California Berkeley; National Science Foundation","keywords":"Mathematics; Dual cone and polar cone; Conic optimization; Cone (formal languages); Convex cone; Second-order cone programming; Matrix (chemical analysis); Cholesky decomposition; Homogeneous function; Combinatorics; Convex optimization; Regular polygon; Homogeneous; Geometry; Algorithm; Convex analysis; Physics","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001644015,0.0001520749,0.0002150336,0.0001962352,0.0001477245,0.00004056729,0.0002386014,0.00008449524,0.001272767],"category_scores_gemma":[0.000771565,0.0001507666,0.00006497588,0.001151595,0.00006269803,0.0001772216,0.0001381865,0.000143823,0.0004483442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005990635,"about_ca_system_score_gemma":0.00005163369,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007690624,"about_ca_topic_score_gemma":7.950528e-7,"domain_scores_codex":[0.9986045,0.00006169559,0.0002696087,0.0002778848,0.0004116019,0.0003746808],"domain_scores_gemma":[0.9987819,0.0004267232,0.0001112295,0.0004100443,0.0001584418,0.0001117051],"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.00009777312,0.0003016451,0.0003449226,0.0001899018,0.0001728622,0.0001631774,0.0008651857,0.9081239,0.001881645,0.00354555,0.0742853,0.01002813],"study_design_scores_gemma":[0.0004957362,0.00005850771,0.0000536463,0.00001557622,0.00001619079,0.00001632491,0.0001122721,0.9731928,0.000603094,0.004081464,0.0210755,0.0002789093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007007109,0.00007774656,0.9829556,0.001739665,0.0003748206,0.0007788313,0.00006189342,0.001663939,0.005340344],"genre_scores_gemma":[0.06124776,0.0008395847,0.9117964,0.0002051663,0.0003318131,0.000120399,0.0001890451,0.0002107294,0.02505911],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.07115927,"threshold_uncertainty_score":0.9996402,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04798404328696928,"score_gpt":0.3949699077849262,"score_spread":0.3469858644979569,"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."}}