Skip to main content

Advertisement

Log in

New Condition Characterizing the Solutions of Variational Inequality Problems

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

This paper is devoted to the study of a new necessary condition in variational inequality problems: approximated gradient projection (AGP). A feasible point satisfies such condition if it is the limit of a sequence of the approximated solutions of approximations of the variational problem. This condition comes from optimization where the error in the approximated solution is measured by the projected gradient onto the approximated feasible set, which is obtained from a linearization of the constraints with slack variables to make the current point feasible.

We state the AGP condition for variational inequality problems and show that it is necessary for a point being a solution even without constraint qualifications (e.g., Abadie’s). Moreover, the AGP condition is sufficient in convex variational inequalities. Sufficiency also holds for variational inequalities involving maximal monotone operators subject to the boundedness of the vectors in the image of the operator (playing the role of the gradients). Since AGP is a condition verified by a sequence, it is particularly interesting for iterative methods.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Martínez, J.M.: Two-phase model algorithm with global convergence for nonlinear programming. J. Optim. Theory Appl. 96(2), 397–436 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  2. Martínez, J.M., Pilotta, E.A.: Inexact-restoration algorithm for constrained optimization. J. Optim. Theory Appl. 104(1), 135–163 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  3. Martínez, J.M., Svaiter, B.F.: A practical optimality condition without constraint qualifications for nonlinear programming. J. Optim. Theory Appl. 118(1), 117–133 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  4. Facchinei, F., Pang, J.-S.: Finite-Dimensional Variational Inequalities and Complementarity Problems. Springer Series in Operations Research, vol. I. Springer, New York (2003)

    Google Scholar 

  5. Gwinner, J.: On the penalty method for constrained variational inequalities. In: Optimization: Theory and Algorithms, Confolant, 1981. Lecture Notes in Pure and Applied Mathematics, vol. 86, pp. 197–211. Dekker, New York (1983)

    Google Scholar 

  6. Rockafellar, R.T.: Local boundedness of nonlinear, monotone operators. Mich. Math. J. 16, 397–407 (1969)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to R. Gárciga Otero.

Additional information

Communicated by G. Di Pillo.

Research of R. Gárciga Otero was partially supported by CNPq, FAPERJ/Cientistas do Nosso Estado, and PRONEX Optimization.

Research of B.F. Svaiter was partially supported by CNPq Grants 300755/2005-8 and 475647/2006-8 and by PRONEX Optimization.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Otero, R.G., Svaiter, B.F. New Condition Characterizing the Solutions of Variational Inequality Problems. J Optim Theory Appl 137, 89–98 (2008). https://doi.org/10.1007/s10957-007-9320-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10957-007-9320-z

Keywords

Navigation