{"id":"W2393392126","doi":"","title":"Convergence Analysis of General Decomposition Algorithm for Solving General Constrained Variational Inequality Problems","year":2006,"lang":"en","type":"article","venue":"Mathematica Applicata","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Variational inequality; Augmented Lagrangian method; Mathematics; Convergence (economics); Duality (order theory); Lagrangian; Decomposition; Lagrangian relaxation; Applied mathematics; Mathematical optimization; Decomposition method (queueing theory); Pure mathematics; Discrete mathematics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004072127,0.001172805,0.001472385,0.001019961,0.0005095488,0.001103963,0.001368839,0.001568679,0.002682952],"category_scores_gemma":[0.00668685,0.000535931,0.001099657,0.0007868393,0.001119083,0.001547556,0.002186361,0.002122207,0.0004779454],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009110625,"about_ca_system_score_gemma":0.001707893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002792625,"about_ca_topic_score_gemma":0.002498514,"domain_scores_codex":[0.9988692,0.000564686,0.00004363111,0.0001516568,0.0002604422,0.0001103574],"domain_scores_gemma":[0.9982102,0.0009689134,0.0001192818,0.0001509189,0.0004405674,0.0001101931],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001917469,0.0001117654,0.001423032,0.0002249797,0.0001230579,0.0001109459,0.000151964,0.8016715,0.003256424,0.1169905,0.002489586,0.07325454],"study_design_scores_gemma":[0.000008086942,0.00001785208,0.00004805108,0.000006456014,0.000003320518,0.00001194228,0.000006563775,0.9936697,0.0001731662,0.005709792,0.0003423401,0.000002779926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008020364,0.0001952774,0.989939,0.00009980322,0.00004097674,0.00003785279,0.0000176464,0.00006876293,0.00158035],"genre_scores_gemma":[0.2701679,0.0004953088,0.7244619,0.0001857913,0.00009132081,0.0004319847,0.0002722841,0.0002092038,0.003684468],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004072127,"threshold_uncertainty_score":0.02153575,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01709813799025979,"score_gpt":0.2776029922702029,"score_spread":0.2605048542799431,"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."}}