{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001647343,0.0009196089,0.001129623,0.0006030529,0.0009454465,0.001004325,0.001469717,0.001141672,0.005782886],"category_scores_gemma":[0.00397144,0.0005163309,0.0005911663,0.0009830217,0.0009133318,0.0013338,0.001679185,0.002169607,0.001601113],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004510003,"about_ca_system_score_gemma":0.001029473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003599539,"about_ca_topic_score_gemma":0.004360995,"domain_scores_codex":[0.999325,0.0002575829,0.00002562631,0.0000585743,0.0002734227,0.00005978691],"domain_scores_gemma":[0.9991633,0.0003726352,0.00003918948,0.000138869,0.0002448451,0.00004114973],"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.0003927441,0.0002574052,0.0005477981,0.000193993,0.000048468,0.0001066731,0.0001964427,0.5582108,0.008008554,0.1044054,0.005999732,0.321632],"study_design_scores_gemma":[0.00002367819,0.0000275489,0.00003244132,0.000008724744,0.000004496264,0.00001725532,0.00001158262,0.9873077,0.001383116,0.009405501,0.001772692,0.000005165731],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004728652,0.00005141807,0.9913799,0.00007696392,0.00004698263,0.00003660281,0.00001350398,0.0003639069,0.003302027],"genre_scores_gemma":[0.08223605,0.0001019741,0.9137229,0.00009546362,0.00003080988,0.0001351567,0.00007347453,0.0002420419,0.003362083],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005782886,"threshold_uncertainty_score":0.01934564,"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."}}