{"id":"W2033477411","doi":"10.1007/s12532-012-0035-2","title":"A primal–dual regularized interior-point method for convex quadratic programs","year":2012,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":79,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; University of British Columbia","funders":"","keywords":"Interior point method; Regularization (linguistics); Mathematics; Theory of computation; Quadratic programming; Mathematical optimization; Regular polygon; Rank (graph theory); Linear programming; Applied mathematics; Quadratic equation; Convex optimization; Dual (grammatical number); Algorithm; Computer science; Combinatorics; Artificial intelligence; 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"],"consensus_categories":[],"category_scores_codex":[0.002594527,0.0003547596,0.0006601395,0.0001882527,0.0002721062,0.0002410334,0.0002122011,0.0001835067,0.0001010796],"category_scores_gemma":[0.002643682,0.0003134595,0.000227899,0.000461097,0.0001551593,0.0004788875,0.0001501294,0.0002847281,0.00007183749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001962738,"about_ca_system_score_gemma":0.00006338169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001863629,"about_ca_topic_score_gemma":9.289905e-7,"domain_scores_codex":[0.9967003,0.000310319,0.0009704152,0.0004221429,0.0006755339,0.0009212752],"domain_scores_gemma":[0.9968646,0.001620623,0.0003694081,0.0003604587,0.0004530569,0.000331896],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002048951,0.002142065,0.00004797123,0.003050341,0.0002615548,0.000005675303,0.008425599,0.0002644344,0.0006582281,0.358044,0.0004931227,0.6264021],"study_design_scores_gemma":[0.00147139,0.0003241865,0.000005993871,0.0001917892,0.0001100802,0.00007356144,0.0008541739,0.5836284,0.000610851,0.4113083,0.001007793,0.0004134533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002009174,0.00003591812,0.9925333,0.0004090253,0.0001736288,0.003891138,0.000003409795,0.0005866286,0.0003577556],"genre_scores_gemma":[0.04447594,8.329831e-7,0.9534963,0.00005201012,0.0002146022,0.001185344,0.00007797664,0.0001131575,0.0003837745],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6259887,"threshold_uncertainty_score":0.9999318,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09562827335959624,"score_gpt":0.4280854122017906,"score_spread":0.3324571388421944,"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."}}