A projection subgradient method for solving optimization with variational inequality constraints
From MaRDI portal
Publication:2439517
DOI10.1007/s11590-012-0573-6zbMath1316.90053OpenAlexW2078980565MaRDI QIDQ2439517
Tao Li, Yun-zhi Zou, Fu-Quan Xia
Publication date: 14 March 2014
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-012-0573-6
projection subgradient method\(\rho\)-strongly pseudomonotone mapping\(\Theta\)-pseudomonotone mapping
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Programming in abstract spaces (90C48)
Cites Work
- A projected subgradient method for solving generalized mixed variational inequalities
- Projected subgradient techniques and viscosity methods for optimization with variational inequality constraints
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
- Conditions ensuring the applicability of cutting-plane methods for solving variational inequalities
- Application Of Khobotov’s Algorithm To Variational Inequalities And Network Equilibrium Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item