{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007447847,0.0002298978,0.0004910941,0.0001598376,0.0001131499,0.00001467698,0.0002622603,0.0003217567,0.0008416475],"category_scores_gemma":[0.004084161,0.0002117436,0.0001632124,0.0001498311,0.0001363479,0.00009357835,0.00002827822,0.000250471,0.0000158508],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001047373,"about_ca_system_score_gemma":0.0002949006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001118265,"about_ca_topic_score_gemma":0.0001341736,"domain_scores_codex":[0.9981895,0.00006548699,0.0006457181,0.0003976184,0.0004282246,0.0002734584],"domain_scores_gemma":[0.9970564,0.000726643,0.0004246481,0.0004953641,0.00120776,0.00008915933],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.006174077,0.005890875,0.0008659847,0.05125644,0.002491448,0.00002429649,0.04083158,0.0005314103,0.007809885,0.4131737,0.05690709,0.4140432],"study_design_scores_gemma":[0.00637108,0.00120699,0.0004146197,0.001754622,0.0004020141,0.00001532181,0.0138517,0.09998191,0.0666958,0.8043874,0.002742138,0.002176437],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04500544,0.00005676733,0.8752277,0.00005957078,0.0007996589,0.004673414,0.0005727846,0.0002799194,0.07332473],"genre_scores_gemma":[0.006604923,0.00001695257,0.97097,0.00001447734,0.0001226641,0.00007931417,0.001178842,0.00009397385,0.02091879],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4118668,"threshold_uncertainty_score":0.921545,"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."}}