{"id":"W2037284017","doi":"10.1287/moor.1040.0116","title":"An Interior Point Cutting Plane Method for the Convex Feasibility Problem with Second-Order Cone Inequalities","year":2005,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University; Université de Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Cutting-plane method; Mathematics; Interior point method; Ball (mathematics); Regular polygon; Dual cone and polar cone; Cone (formal languages); Convex set; Second-order cone programming; Center (category theory); Plane (geometry); Convex optimization; Feasible region; Point (geometry); Mathematical optimization; Mathematical analysis; Algorithm; Geometry; Integer programming","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.001538069,0.001320709,0.001312706,0.001068919,0.0005643823,0.001060422,0.001501168,0.001153512,0.003922391],"category_scores_gemma":[0.002606924,0.00065161,0.001214872,0.00121841,0.0009071062,0.00118474,0.001314559,0.003311059,0.0008476752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007997776,"about_ca_system_score_gemma":0.001735928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002950808,"about_ca_topic_score_gemma":0.00187553,"domain_scores_codex":[0.999228,0.0002346042,0.0000242993,0.00009580418,0.0003428427,0.00007451083],"domain_scores_gemma":[0.9992226,0.0004521418,0.00007709127,0.00006541846,0.0001485392,0.00003418987],"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.0001595391,0.0001827094,0.0004244293,0.0002763646,0.00006668514,0.0001831169,0.0001693567,0.5610737,0.008509182,0.15512,0.006458318,0.2673766],"study_design_scores_gemma":[0.00002625534,0.00003986279,0.00004879482,0.00001254446,0.00000812182,0.00004613386,0.00001124292,0.9821845,0.001038905,0.01415432,0.002422747,0.000006502298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009650841,0.0000469251,0.9982994,0.00003004409,0.00001087814,0.00002308478,0.00001155988,0.00005671346,0.000556409],"genre_scores_gemma":[0.0452825,0.0001745438,0.9527442,0.00004595199,0.0000501021,0.000213881,0.00009725225,0.0000942105,0.001297375],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003922391,"threshold_uncertainty_score":0.01312172,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1986081145333806,"score_gpt":0.4984818102359596,"score_spread":0.299873695702579,"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."}}