{"id":"W25085825","doi":"10.1023/a:1008328726430","title":"A Decomposition Method for Global and Local Quadratic Minimization","year":2000,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Maxima and minima; Mathematics; Dimension (graph theory); Mathematical optimization; Decomposition; Linear programming; Decomposition method (queueing theory); Quadratic programming; Quadratic equation; Applied mathematics; Combinatorics; Discrete mathematics; Mathematical analysis","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.001116716,0.001213543,0.001120527,0.0009338457,0.000528402,0.0007550518,0.001102322,0.001252427,0.006358317],"category_scores_gemma":[0.00260244,0.0007144269,0.00147594,0.0009253518,0.0007992191,0.001405625,0.00202554,0.003046425,0.002354178],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003364286,"about_ca_system_score_gemma":0.0007162436,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001274613,"about_ca_topic_score_gemma":0.001934932,"domain_scores_codex":[0.9995222,0.000170324,0.00002713087,0.00007166338,0.0001697629,0.00003889202],"domain_scores_gemma":[0.9991522,0.0004073068,0.00003734509,0.0001153697,0.000212891,0.000074878],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002780332,0.0002389997,0.0004123838,0.0005011567,0.0001327367,0.000162789,0.000195003,0.1606315,0.03028876,0.2261578,0.01989644,0.5611044],"study_design_scores_gemma":[0.00002934551,0.00006514821,0.0001242105,0.00003369308,0.00003315674,0.00009353719,0.00002267039,0.92824,0.002475859,0.05777379,0.01108847,0.00002009708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009174716,0.000121706,0.9977609,0.00004030395,0.00007465567,0.00001188031,0.00002326939,0.00006173321,0.0009880582],"genre_scores_gemma":[0.02670532,0.0003257681,0.9662796,0.00009889894,0.0001120944,0.0001149156,0.0001473122,0.0003706834,0.00584533],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006358317,"threshold_uncertainty_score":0.02127069,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02473843642493805,"score_gpt":0.4079432596196537,"score_spread":0.3832048231947157,"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."}}