{"id":"W2314050188","doi":"10.2514/6.2005-128","title":"Boundary Search and Simplex Decomposition Method for MDO Problems with a Convex or Convex-like State Parameter Region","year":2005,"lang":"en","type":"article","venue":"43rd AIAA Aerospace Sciences Meeting and Exhibit","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; National Aeronautics and Space Administration","keywords":"Simplex; Regular polygon; Boundary (topology); Decomposition; Convex optimization; State (computer science); Mathematical optimization; Convex combination; Convex analysis; Convex polytope; Mathematics; Computer science; Combinatorics; Algorithm; Mathematical analysis; Geometry","routes":{"ca_aff":true,"ca_fund":true,"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.001644395,0.0002009167,0.0002449703,0.0001664562,0.0009476914,0.0008838353,0.0002582922,0.00005529854,0.000003336068],"category_scores_gemma":[0.00006346986,0.0001477608,0.00003571805,0.0006290197,0.0003163296,0.0008881516,0.0001426837,0.0001192517,0.000002869955],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003528046,"about_ca_system_score_gemma":0.0002241021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007652632,"about_ca_topic_score_gemma":0.0001556339,"domain_scores_codex":[0.9979538,0.0001541644,0.0002557895,0.0007626232,0.0004215262,0.0004520347],"domain_scores_gemma":[0.9987087,0.0006245102,0.0001256118,0.0001813678,0.0001857324,0.0001740866],"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.000659395,0.0003120808,0.006331048,0.000594379,0.0001243718,0.00002659447,0.0191867,0.1897199,0.03212629,0.01330965,0.003764127,0.7338455],"study_design_scores_gemma":[0.001296998,0.001337026,0.001345117,0.0001834946,0.00002030171,0.0002494242,0.0003290252,0.9690968,0.01116499,0.00229935,0.01220866,0.0004688541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3816452,0.0003203388,0.6133609,0.003962434,0.00008601663,0.0004044162,0.000003126505,0.00008109006,0.0001364413],"genre_scores_gemma":[0.5596282,0.00007105715,0.438833,0.0007375101,0.00008560679,0.00003919957,0.000005941542,0.000008937473,0.0005904972],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7793769,"threshold_uncertainty_score":0.8522844,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0347431999813916,"score_gpt":0.317276033599676,"score_spread":0.2825328336182845,"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."}}