Article ID: | iaor20115125 |
Volume: | 149 |
Issue: | 3 |
Start Page Number: | 528 |
End Page Number: | 539 |
Publication Date: | Jun 2011 |
Journal: | Journal of Optimization Theory and Applications |
Authors: | Haeser Gabriel, Schuverdt Laura |
Keywords: | programming: convex |
In this work, we introduce a necessary sequential Approximate‐Karush‐Kuhn‐Tucker (AKKT) condition for a point to be a solution of a continuous variational inequality, and we prove its relation with the Approximate Gradient Projection condition (AGP) of Gárciga‐Otero and Svaiter. We also prove that a slight variation of the AKKT condition is sufficient for a convex problem, either for variational inequalities or optimization. Sequential necessary conditions are more suitable to iterative methods than usual punctual conditions relying on constraint qualifications. The AKKT property holds at a solution independently of the fulfillment of a constraint qualification, but when a weak one holds, we can guarantee the validity of the KKT conditions.