{"id":"W2949973360","doi":"10.48550/arxiv.1107.5290","title":"A numerical method for variational problems with convexity constraints","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Convexity; Variational inequality; Mathematics; Constraint (computer-aided design); Convex analysis; Regular polygon; Mathematical optimization; Convex optimization; Conic optimization; Variational analysis; Applied mathematics; Proper convex function; Optimization problem; Cone (formal languages); Convex cone; Algorithm; Geometry","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005102963,0.0003315811,0.0004897634,0.0001992728,0.000155947,0.00003853812,0.0005450467,0.0003343187,0.0006417779],"category_scores_gemma":[0.0003917188,0.0003339769,0.0001657284,0.0003363723,0.0002904187,0.0001494958,0.0003443934,0.0006218257,0.00002465847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002401555,"about_ca_system_score_gemma":0.0005274746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000401995,"about_ca_topic_score_gemma":0.0000123,"domain_scores_codex":[0.9980505,0.0002089004,0.0002652314,0.0009084127,0.0001620076,0.0004050006],"domain_scores_gemma":[0.9971691,0.0008782975,0.0003826935,0.0006155499,0.0007416013,0.0002127345],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002462979,0.0003143369,0.0002684641,0.0004276405,0.0003742748,0.00004665181,0.0003042763,0.3421625,0.000003990302,0.6552106,0.000236847,0.000404178],"study_design_scores_gemma":[0.0009872053,0.00007626023,0.00003400118,0.00006523333,0.0001004177,0.000008094908,0.0000537001,0.5282304,0.00004295526,0.4699674,0.0001333663,0.0003010053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003451542,0.000005684431,0.9931405,0.00005548838,0.0001010099,0.001483758,0.0001385285,0.0001731404,0.004556689],"genre_scores_gemma":[0.1296624,0.00001941084,0.8671411,0.00004382018,0.00006871968,0.00002555644,0.00009238778,0.00006994477,0.002876631],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1860679,"threshold_uncertainty_score":0.9999112,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2214860799207179,"score_gpt":0.2897211908661678,"score_spread":0.06823511094544987,"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."}}