A projected gradient method with nonmonotonic backtracking technique for solving convex constrained monotone variational inequality problem

DOI10.1007/s11766-008-1887-0zbMath1183.90428OpenAlexW2087326226MaRDI QIDQ1032811

Yun-Juan Wang, De-Tong Zhu

Publication date: 11 November 2009

Published in: Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11766-008-1887-0

zbMATH Keywords

variational inequalityline searchtrust regionprojected gradient

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical methods in optimal control (49M99)

Cites Work

• Unnamed Item
• Unnamed Item
• Convergence properties of trust region methods for linear and convex constraints
• A note on a globally convergent Newton method for solving monotone variational inequalities
• Test examples for nonlinear programming codes
• Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
• Handbook of test problems in local and global optimization
• A globally convergent Newton method for solving strongly monotone variational inequalities
• Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
• Computing stationary points

This page was built for publication: A projected gradient method with nonmonotonic backtracking technique for solving convex constrained monotone variational inequality problem