{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001514432,0.001097403,0.001025719,0.0006968131,0.0004238359,0.0008775665,0.001580984,0.001020198,0.004680016],"category_scores_gemma":[0.003171278,0.0005418874,0.0008635219,0.0007664188,0.0007011517,0.001054785,0.001342655,0.002629859,0.001868762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003868039,"about_ca_system_score_gemma":0.001377804,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002126629,"about_ca_topic_score_gemma":0.002372416,"domain_scores_codex":[0.9989606,0.0003908929,0.00003415151,0.00009217874,0.0004580193,0.00006415468],"domain_scores_gemma":[0.9989091,0.0006245158,0.00006573032,0.0001265452,0.0002323064,0.00004174179],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002440216,0.0003773388,0.0006807172,0.0005104184,0.00008439839,0.000204162,0.0001577434,0.6312546,0.01709433,0.04249002,0.004634293,0.302268],"study_design_scores_gemma":[0.00003670581,0.00006280452,0.00006284659,0.00002404355,0.000006415911,0.00005461461,0.00001016183,0.9895271,0.002788572,0.003826933,0.003589011,0.00001078545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001842636,0.00007581691,0.9959144,0.00003763877,0.00002540706,0.00004870437,0.00001290555,0.0004423781,0.001600069],"genre_scores_gemma":[0.0328158,0.0001329008,0.9643966,0.0000598159,0.00002107511,0.0002190518,0.00007966349,0.0001978684,0.002077178],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004680016,"threshold_uncertainty_score":0.01565617,"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."}}