{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004998717,0.0001731809,0.000339696,0.00005767019,0.0001388343,0.00009505205,0.0001436259,0.0001332957,0.0002003205],"category_scores_gemma":[0.0004453015,0.0001609439,0.0001058546,0.0005054194,0.00006310657,0.0005847186,0.00002034015,0.00009332052,0.000002133916],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004508712,"about_ca_system_score_gemma":0.000136941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003625667,"about_ca_topic_score_gemma":0.000007253391,"domain_scores_codex":[0.998232,0.0001781214,0.000734293,0.0001915408,0.0004287209,0.0002353093],"domain_scores_gemma":[0.9982778,0.0002430576,0.000425589,0.0001293274,0.0007535449,0.0001706951],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004044728,0.0001502599,0.0001768869,0.00005236842,0.00005688653,0.00000539772,0.00004970567,0.9201676,0.000004948588,0.008662635,0.000886592,0.0693823],"study_design_scores_gemma":[0.001877694,0.0003330955,0.0001527625,0.00006643486,0.0001015792,0.00033288,0.00009211994,0.9576825,0.00003413662,0.03877767,0.0003937352,0.0001554022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001490382,0.0001490063,0.9964002,0.0006430813,0.0001055372,0.0004137981,0.0000339581,0.00003178976,0.0007322144],"genre_scores_gemma":[0.01050901,0.0001837187,0.988913,0.0001283619,0.0001187043,0.00001015634,0.00002108755,0.00001883653,0.0000971071],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.06922691,"threshold_uncertainty_score":0.6563104,"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."}}