{"id":"W2121094316","doi":"10.1287/ijoc.1030.0046","title":"The Constraint Consensus Method for Finding Approximately Feasible Points in Nonlinear Programs","year":2004,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":46,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Extreme point; Mathematical optimization; Constraint (computer-aided design); Point (geometry); Feasible region; Nonlinear programming; Nonlinear system; Mathematics; Projection (relational algebra); Computer science; Algorithm; Combinatorics","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.001216393,0.001118283,0.001172509,0.0008262419,0.000833598,0.0007555276,0.001315445,0.001225061,0.003251612],"category_scores_gemma":[0.004966429,0.0005645068,0.0006518249,0.001110192,0.001189908,0.001762748,0.001472946,0.002128964,0.0008261065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006459394,"about_ca_system_score_gemma":0.001783292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005092754,"about_ca_topic_score_gemma":0.003436959,"domain_scores_codex":[0.9990876,0.0002766143,0.00003153046,0.0001463759,0.0004096145,0.00004833206],"domain_scores_gemma":[0.9985013,0.0009088011,0.0001404834,0.0001480693,0.0002488844,0.00005250007],"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.00009048077,0.00003755421,0.0002370866,0.0001553889,0.00004871143,0.00008156308,0.00009997311,0.8208858,0.003881069,0.04547617,0.002187205,0.126819],"study_design_scores_gemma":[0.0000184369,0.00003960566,0.00004586335,0.00001004563,0.000005625866,0.00002966319,0.000009194652,0.9856793,0.001321138,0.01088851,0.001940066,0.00001249363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001231257,0.000064637,0.9977161,0.00003535765,0.00001062511,0.00002371384,0.00001001585,0.0001134331,0.0007948718],"genre_scores_gemma":[0.137868,0.0003520294,0.8581609,0.00007437592,0.00004882788,0.000354993,0.0001304667,0.0001552948,0.002855242],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005092754,"threshold_uncertainty_score":0.01087773,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1117965981494792,"score_gpt":0.4271677390108882,"score_spread":0.315371140861409,"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."}}