{"id":"W2024962211","doi":"10.1007/s10589-005-3064-1","title":"The Complexity of Self-Regular Proximity Based Infeasible IPMs","year":2005,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Windsor; McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Interior point method; Path (computing); Function (biology); Simple (philosophy); Mathematical optimization; Dual (grammatical number); Point (geometry); Current (fluid); Combinatorics; Algorithm; Discrete mathematics; 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.0002903695,0.0001207338,0.0001456268,0.00009082152,0.0005216419,0.00005999165,0.0001908995,0.00005203601,0.00008216714],"category_scores_gemma":[0.0001297197,0.000101477,0.00004426386,0.000473806,0.0004121849,0.000191884,0.00006072326,0.0001052096,0.000007224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000570028,"about_ca_system_score_gemma":0.0001441291,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000152989,"about_ca_topic_score_gemma":0.000004628093,"domain_scores_codex":[0.9987855,0.0000763253,0.0004061665,0.0002164577,0.0003573279,0.0001582267],"domain_scores_gemma":[0.9981633,0.0006179117,0.0002207025,0.0002587339,0.0006475943,0.00009170674],"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.000004680235,0.0001356611,0.00004324309,0.00001863209,0.00001267537,2.76427e-8,0.00003007552,0.6449955,0.000003316285,0.3515838,0.0001454542,0.00302688],"study_design_scores_gemma":[0.0004616775,0.0000136976,0.0001426242,0.000006563184,0.00001343054,0.000002190996,0.00002824612,0.8971881,0.00009786845,0.09728588,0.004664136,0.00009560871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001021736,0.00008051207,0.9949466,0.003024763,0.00001039512,0.0008581003,0.00003167812,0.000121178,0.0008246123],"genre_scores_gemma":[0.03903772,0.00004897149,0.960195,0.0001266734,0.0000594064,0.000260585,0.0001268887,0.0000209954,0.0001237716],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2542979,"threshold_uncertainty_score":0.4138114,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05987156577406685,"score_gpt":0.3493560188353936,"score_spread":0.2894844530613268,"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."}}