{"id":"W1525133469","doi":"10.1023/a:1008787027641","title":"A Polynomial Cutting Surfaces Algorithm for the Convex Feasibility Problem Defined by Self-Concordant Inequalities","year":2000,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Applied mathematics; Mathematical economics","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.0004163059,0.0001919683,0.0002199851,0.00005873257,0.0007881886,0.0001584851,0.0002038405,0.0000727212,0.0002400155],"category_scores_gemma":[0.00009477069,0.0001618901,0.00006091543,0.0003621512,0.0001654536,0.0002106146,0.00004343046,0.0001263447,0.000008845468],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008002667,"about_ca_system_score_gemma":0.0001277966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001036724,"about_ca_topic_score_gemma":0.000001642553,"domain_scores_codex":[0.998466,0.00008855116,0.0005116804,0.0003873327,0.0002983801,0.0002481075],"domain_scores_gemma":[0.9968181,0.002224787,0.0001795041,0.0002197674,0.0004520279,0.0001058709],"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.00001661015,0.000268152,0.0000477371,0.00005212483,0.00005973436,9.698703e-8,0.0003191009,0.9321766,0.000004504298,0.00918051,0.005138058,0.05273669],"study_design_scores_gemma":[0.0009374662,0.00003399319,0.00002361109,0.000008360443,0.00003319036,0.000006335858,0.0002076241,0.9719542,0.00002128409,0.01316284,0.0134262,0.0001849047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00032205,0.0002215276,0.9947435,0.001453264,0.00001990674,0.002271612,0.0003122895,0.0002201602,0.0004356429],"genre_scores_gemma":[0.003899635,0.0001805007,0.992435,0.0002658699,0.0001038703,0.001264755,0.0004834899,0.00004101532,0.001325831],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05255179,"threshold_uncertainty_score":0.6601688,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0379339446005809,"score_gpt":0.3393269561306401,"score_spread":0.3013930115300592,"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."}}