{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008683636,0.0007565201,0.0008670068,0.001040723,0.0004582513,0.001210797,0.001489173,0.001192633,0.005303223],"category_scores_gemma":[0.002324246,0.0005157829,0.0006652035,0.0008026926,0.0008984897,0.00108623,0.001243254,0.002281482,0.001104717],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007075897,"about_ca_system_score_gemma":0.0008945151,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007287421,"about_ca_topic_score_gemma":0.0009902677,"domain_scores_codex":[0.9996498,0.00009037603,0.00000973487,0.00004471937,0.000187874,0.00001749246],"domain_scores_gemma":[0.9993906,0.0003360365,0.00003242569,0.00004917068,0.0001621719,0.00002957919],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001653186,0.0001299247,0.0002400163,0.0003839478,0.00006150023,0.0001394885,0.0001739086,0.1820862,0.01526574,0.4834664,0.02154805,0.2963396],"study_design_scores_gemma":[0.00002113683,0.0000322445,0.00009360417,0.00003241964,0.00001320193,0.0001052912,0.00001442275,0.9174803,0.002686202,0.06784217,0.0116627,0.00001623825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001317325,0.0002000008,0.9931796,0.00008436491,0.00006763277,0.00002927426,0.00002734397,0.00008555147,0.005008863],"genre_scores_gemma":[0.04380968,0.0004588192,0.9431854,0.000179903,0.0001302385,0.0001984259,0.0001546596,0.0002476988,0.01163502],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005303223,"threshold_uncertainty_score":0.01774108,"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."}}