{"id":"W2621127975","doi":"","title":"A Primal-Dual Regularized Interior-Point Method for Semidefinite Programming","year":2012,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; McGill University","funders":"","keywords":"Interior point method; Semidefinite programming; Mathematics; Mathematical optimization; Linear programming; Robustness (evolution); Quadratic programming; Dual (grammatical number); Regular polygon; Factorization; Regularization (linguistics); Convex optimization; Sequence (biology); Quadratic equation; Rank (graph theory); Applied mathematics; Algorithm; Computer science; Combinatorics; Artificial intelligence","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.003145294,0.0004719965,0.000660539,0.0005304732,0.0003349319,0.0002046351,0.0004718166,0.0003774963,0.0001006132],"category_scores_gemma":[0.003462505,0.000462341,0.000325397,0.0007128238,0.0001114849,0.0007436221,0.0004072045,0.0005777982,0.00001606194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007188211,"about_ca_system_score_gemma":0.0002043434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002697369,"about_ca_topic_score_gemma":0.0001331362,"domain_scores_codex":[0.9961275,0.0003319388,0.0008495944,0.0005333597,0.0005796139,0.001577999],"domain_scores_gemma":[0.9964246,0.001162404,0.0004181512,0.001016357,0.0004031049,0.000575415],"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.001362093,0.00192337,0.004512397,0.00101418,0.0005895881,0.00005139543,0.00481466,0.001616863,0.04929999,0.5689708,0.01140913,0.3544356],"study_design_scores_gemma":[0.00524001,0.0007263122,0.000667362,0.0003670481,0.0002944081,0.0007288448,0.001496055,0.7427214,0.08841664,0.1057458,0.05136008,0.002236026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001993096,0.0004034454,0.9911491,0.001824808,0.0001523136,0.002927927,0.00006055671,0.001134296,0.0003544826],"genre_scores_gemma":[0.009379464,0.0000475222,0.9834143,0.0006401602,0.0003241374,0.003385687,0.00005633118,0.0002125288,0.002539874],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7411046,"threshold_uncertainty_score":0.9997829,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03673722428571607,"score_gpt":0.3438302092704082,"score_spread":0.3070929849846921,"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."}}