{"id":"W4231414503","doi":"10.22215/etd/2018-12694","title":"Reaching Feasibility Quickly for Sets of Linear Constraints","year":2018,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Linear programming; Acceleration; Mathematical optimization; Set (abstract data type); Computer science; Linear system; Interior point method; Linear-fractional programming; Point (geometry); Feasible region; Projection (relational algebra); Computation; Algorithm; Mathematics","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.001986416,0.001373532,0.001078524,0.0008707859,0.001045343,0.002526079,0.001102343,0.001185824,0.01361329],"category_scores_gemma":[0.01322439,0.0010689,0.001820426,0.001037031,0.001854756,0.003749011,0.004325622,0.0053915,0.002079542],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009526346,"about_ca_system_score_gemma":0.00180655,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001767811,"about_ca_topic_score_gemma":0.001704033,"domain_scores_codex":[0.9979146,0.0005478014,0.0001115007,0.0004502738,0.0007128845,0.0002629443],"domain_scores_gemma":[0.9941608,0.004717595,0.0002145747,0.0003075183,0.0004981409,0.0001013029],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002704627,0.0001782763,0.0005853118,0.00101089,0.00009946268,0.0005039339,0.00132317,0.3113151,0.01744343,0.4990717,0.008266821,0.1599314],"study_design_scores_gemma":[0.00007126206,0.0001441143,0.0001963668,0.0001677754,0.00004283607,0.0001619062,0.0002682445,0.615177,0.01051892,0.3567391,0.01647674,0.0000357284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01616279,0.0002684699,0.9685835,0.0003358138,0.00004901225,0.0001918675,0.00006481511,0.000366862,0.01397693],"genre_scores_gemma":[0.154259,0.0007190518,0.8301885,0.000239525,0.000081161,0.0006834224,0.0004690292,0.000427076,0.01293328],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01361329,"threshold_uncertainty_score":0.04554099,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1325991003851215,"score_gpt":0.4696475423946224,"score_spread":0.3370484420095009,"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."}}