{"id":"W2110344857","doi":"10.1287/ijoc.1090.0323","title":"Feasibility and Constraint Analysis of Sets of Linear Matrix Inequalities","year":2009,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Inequality; Mathematical optimization; Matrix (chemical analysis); Constraint (computer-aided design); Linear programming; Linear inequality; Algorithm; Computer science","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":[],"consensus_categories":[],"category_scores_codex":[0.001205448,0.0001008292,0.0004366934,0.0004704914,0.00009124156,0.00002620005,0.0001244492,0.00005031035,0.00004006144],"category_scores_gemma":[0.001098767,0.00007736307,0.0001266828,0.0005533246,0.00009652112,0.0001453642,0.000043335,0.0002723799,4.798433e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005663529,"about_ca_system_score_gemma":0.00006527655,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002295862,"about_ca_topic_score_gemma":8.602673e-7,"domain_scores_codex":[0.9984038,0.0000496634,0.0008610954,0.00008629842,0.000425542,0.000173532],"domain_scores_gemma":[0.9980451,0.0006291374,0.0006293602,0.0001600582,0.0004451183,0.00009118055],"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.0004078174,0.0006822082,0.02821306,0.0004712094,0.001727236,0.00004035826,0.01245029,0.6246954,0.0003302597,0.08220267,0.00009067979,0.2486888],"study_design_scores_gemma":[0.001467271,0.000561879,0.01260048,0.0002486266,0.0001904707,0.00008389054,0.002243307,0.9443959,0.001115453,0.03682974,0.00003029554,0.0002326808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8055472,0.00004673901,0.1936487,0.00007214276,0.00002565981,0.0001026384,0.00001268205,0.00001584726,0.0005284288],"genre_scores_gemma":[0.8481216,0.00002852779,0.1517666,0.00003519657,0.0000215598,8.663665e-8,0.000002020498,0.000004459869,0.0000199107],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3197005,"threshold_uncertainty_score":0.3154774,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09771958865612318,"score_gpt":0.431514757271499,"score_spread":0.3337951686153758,"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."}}