{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003364642,0.0001901332,0.0002825677,0.0002117351,0.0006715052,0.0003465608,0.0003242248,0.00008803368,0.000004897655],"category_scores_gemma":[0.002640286,0.0001250063,0.0001270847,0.0003785504,0.0001095809,0.0001260596,0.00008805726,0.0007565719,0.000008759758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003564928,"about_ca_system_score_gemma":0.0002873852,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003289088,"about_ca_topic_score_gemma":0.000008071106,"domain_scores_codex":[0.997787,0.00006335428,0.0008518789,0.0001687653,0.00047416,0.0006548529],"domain_scores_gemma":[0.9968442,0.001990541,0.0004734263,0.0001880578,0.0003547305,0.0001489931],"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.000296463,0.0003151009,0.00023904,0.0001360328,0.0001050948,0.0001036632,0.001966136,0.2079942,0.00003898534,0.09159964,0.00008476693,0.6971209],"study_design_scores_gemma":[0.005985667,0.0004943135,0.00004671626,0.0007434143,0.00001155781,0.001266915,0.002476512,0.7734799,0.001223409,0.2115727,0.002315822,0.0003830788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03017402,0.00002432519,0.9662474,0.001273863,0.0002522395,0.0009893476,0.000004031336,0.00007405778,0.0009606694],"genre_scores_gemma":[0.01542339,0.000012757,0.9841545,0.0001319788,0.0001612234,0.00001235014,0.000003046126,0.00003531369,0.00006550954],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6967378,"threshold_uncertainty_score":0.5164743,"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."}}