{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001789486,0.00103731,0.002006357,0.000758571,0.0006275318,0.001238153,0.001196959,0.00220765,0.005075058],"category_scores_gemma":[0.006007402,0.001110229,0.0009698988,0.000761705,0.001107278,0.001523411,0.001898009,0.002142262,0.0006686542],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000754005,"about_ca_system_score_gemma":0.001618397,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006463983,"about_ca_topic_score_gemma":0.004773577,"domain_scores_codex":[0.999537,0.0002446758,0.00001892403,0.00004854481,0.0001043599,0.00004649714],"domain_scores_gemma":[0.9977749,0.001727686,0.000109915,0.00008603423,0.0001986535,0.0001027884],"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.00008505994,0.00003733271,0.0001663418,0.0000870452,0.00002904271,0.00002935693,0.00004451349,0.9584841,0.0006052501,0.01692103,0.000881716,0.02262915],"study_design_scores_gemma":[0.000007764449,0.000007018477,0.00001288838,0.000006577705,0.0000018376,0.000002424318,0.000003850946,0.996358,0.00007075848,0.003328036,0.0001982087,0.000002627738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004272946,0.0002369793,0.9925949,0.0001604565,0.00003789894,0.00003981931,0.00003372499,0.0001168653,0.002506374],"genre_scores_gemma":[0.2944207,0.0003700192,0.6991646,0.000183505,0.00007275709,0.0006822795,0.0002069725,0.0003239627,0.004575289],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006463983,"threshold_uncertainty_score":0.01697779,"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."}}