{"id":"W4400408820","doi":"10.3390/a17070303","title":"On Implementing a Two-Step Interior Point Method for Solving Linear Programs","year":2024,"lang":"en","type":"article","venue":"Algorithms","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Interior point method; Point (geometry); Algorithm; Mathematical optimization; Mathematics; Dual (grammatical number); Regular polygon; Linear programming; Computer science; Inverse; Value (mathematics); Applied mathematics; Geometry; Statistics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001603019,0.0002816772,0.0003490622,0.0002619421,0.0002230325,0.0002596462,0.000292599,0.00008404044,0.0002532047],"category_scores_gemma":[0.0008606274,0.0002480871,0.0002239196,0.0004774335,0.00004347798,0.0002574676,0.0002306017,0.0003603719,0.00007931178],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001798374,"about_ca_system_score_gemma":0.00008854373,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002062032,"about_ca_topic_score_gemma":0.00001741358,"domain_scores_codex":[0.9975151,0.00007880102,0.0005515125,0.0006124317,0.0004577968,0.000784371],"domain_scores_gemma":[0.997583,0.001525997,0.00009952073,0.0004027248,0.0002421213,0.0001466521],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003681171,0.000120373,0.000002838615,0.0004605044,0.0001970372,0.00006177224,0.0009047478,0.0002627269,0.0005389594,0.04574,0.002095277,0.9495789],"study_design_scores_gemma":[0.0007552308,0.0003043349,3.101938e-7,0.0003012097,0.00004330822,0.00004150918,0.0004279974,0.9290216,0.002375914,0.04816856,0.01827388,0.0002861608],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002198016,0.0001326706,0.9956432,0.0005637202,0.0004220541,0.001457518,0.00004188834,0.0005790296,0.0009400949],"genre_scores_gemma":[0.0008940012,0.00001373256,0.9947888,0.0001132241,0.000474173,0.0005980305,0.00005205796,0.0001529123,0.002913032],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9492928,"threshold_uncertainty_score":0.9999971,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07593134455603959,"score_gpt":0.4562627486292649,"score_spread":0.3803314040732253,"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."}}