{"id":"W310879469","doi":"10.1007/978-1-4613-0279-7_24","title":"An Analytic Center Self-Concordant Cut Method for the Convex Feasibility Problem","year":2001,"lang":"en","type":"book-chapter","venue":"Nonconvex optimization and its applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University; Concordia University","funders":"","keywords":"Mathematics; Center (category theory); Regular polygon; Set (abstract data type); Convex analysis; Combinatorics; Convex set; Convex optimization; Discrete mathematics; Mathematical optimization; Computer science; Geometry","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","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000855309,0.0005534742,0.0006706346,0.0002427045,0.0006945633,0.0001988732,0.000585016,0.0004468101,0.001040055],"category_scores_gemma":[0.0001346869,0.0004506466,0.0002001453,0.0002348094,0.0001533543,0.000309554,0.0001269051,0.0005112094,0.00003377331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002530927,"about_ca_system_score_gemma":0.0002704496,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003704554,"about_ca_topic_score_gemma":0.00002224937,"domain_scores_codex":[0.9970157,0.00009439892,0.0009266672,0.001032464,0.0004994108,0.0004313322],"domain_scores_gemma":[0.9950762,0.001382344,0.0006549542,0.001173178,0.001398928,0.0003143807],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009742162,0.0006905766,0.00002083265,0.0007055875,0.0005834588,0.000002255927,0.0006436109,0.08438703,0.00001678089,0.8930953,0.003304717,0.0164525],"study_design_scores_gemma":[0.001090704,0.0001021052,0.000001062451,0.00004322961,0.000302959,0.00002510815,0.00008877175,0.7962425,0.00002552722,0.04599235,0.1556032,0.000482551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[4.669896e-7,0.0002951814,0.9369568,0.0009479135,0.00005539333,0.007308297,0.0003820927,0.0003135602,0.05374029],"genre_scores_gemma":[0.00006690541,0.003443066,0.885698,0.0004976367,0.0003717579,0.002226952,0.0007596167,0.0002556032,0.1066805],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8471029,"threshold_uncertainty_score":0.9998731,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07041449983146163,"score_gpt":0.3974612581906012,"score_spread":0.3270467583591395,"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."}}