{"id":"W1980450998","doi":"10.1007/s10107-002-0349-3","title":"On implementing a primal-dual interior-point method for conic quadratic optimization","year":2003,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":664,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Interior point method; Conic section; Conic optimization; Quadratic equation; Mathematics; Quadratic programming; Mathematical optimization; Dual (grammatical number); Quadratic unconstrained binary optimization; Optimization problem; Extension (predicate logic); Algorithm; Computer science; Convex optimization; 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":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002623479,0.0003263585,0.0005258485,0.0001821098,0.000330141,0.0002258598,0.0001981624,0.0001252366,0.0009750154],"category_scores_gemma":[0.009862697,0.0002876878,0.0001909774,0.0003807051,0.00008004856,0.0002154226,0.00009735654,0.000280267,0.00003969335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001972795,"about_ca_system_score_gemma":0.00008399964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.467291e-7,"about_ca_topic_score_gemma":0.000001691176,"domain_scores_codex":[0.9968729,0.0002757161,0.0009211889,0.0005104379,0.0005358256,0.0008839234],"domain_scores_gemma":[0.9956991,0.003062261,0.0002977216,0.0004594033,0.0002914919,0.0001900442],"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.00004935411,0.0004465581,0.000002622029,0.0009043054,0.00010024,0.000007095843,0.00104694,0.006106818,0.0001422867,0.9629189,0.000211545,0.02806336],"study_design_scores_gemma":[0.001302806,0.0003399625,1.003146e-7,0.0001889427,0.0000648549,0.00003823508,0.0009470081,0.570731,0.002146063,0.4224487,0.001435737,0.0003565649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003155732,0.00001597285,0.9935948,0.0001994984,0.00005851876,0.002490191,0.000006099114,0.0002685842,0.003050805],"genre_scores_gemma":[0.006132347,0.000001909328,0.9921215,0.00008715472,0.00004111009,0.0008436703,0.00001759741,0.0001141634,0.0006406112],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5646242,"threshold_uncertainty_score":0.9999575,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06817259144325699,"score_gpt":0.4259764846376932,"score_spread":0.3578038931944362,"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."}}