{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002045682,0.001076211,0.0018059,0.0007545344,0.0005982835,0.001152967,0.001953959,0.00193656,0.006875933],"category_scores_gemma":[0.003852877,0.0008132763,0.001159287,0.0007958148,0.001120039,0.001129228,0.002319866,0.003071892,0.001702664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005819777,"about_ca_system_score_gemma":0.001634848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001728837,"about_ca_topic_score_gemma":0.001703093,"domain_scores_codex":[0.999235,0.0003535913,0.00002708311,0.00008982849,0.0002522575,0.00004218697],"domain_scores_gemma":[0.9991133,0.0004305991,0.00004902866,0.00008597284,0.0002478535,0.00007317828],"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.0002554488,0.0003154348,0.0003170259,0.0004454388,0.0001049038,0.0001497619,0.0001571441,0.6974571,0.007610157,0.1123079,0.008498156,0.1723814],"study_design_scores_gemma":[0.00001769354,0.00002193728,0.0000187637,0.000009360253,0.000005131966,0.00001386399,0.000004469159,0.9916319,0.0003665757,0.00648827,0.001416779,0.000005179922],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001261765,0.00007208517,0.9972016,0.00007453551,0.00006470824,0.00003193234,0.00001770171,0.00007759794,0.00119811],"genre_scores_gemma":[0.05999633,0.0001734029,0.9343708,0.000127952,0.0001311864,0.0002854409,0.0001327563,0.0002601372,0.004521925],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006875933,"threshold_uncertainty_score":0.02300227,"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."}}