Modified Goldstein--Levitin--Polyak projection method for asymmetric strongly monotone variational inequalities
From MaRDI portal
Publication:5959904
DOI10.1023/A:1013048729944zbMath0998.65066OpenAlexW1561278356MaRDI QIDQ5959904
Deren Han, Bing-sheng He, Qiang Meng, Hai Yang
Publication date: 11 April 2002
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1013048729944
algorithmglobal convergencenumerical examplesmonotone variational inequalitiesGoldstein-Levitin-Polyak projection method
Numerical optimization and variational techniques (65K10) Variational inequalities (49J40) Newton-type methods (49M15)
Related Items (37)
Hybrid CQ projection algorithm with line-search process for the split feasibility problem ⋮ An improved hyperplane projection method for generalized Nash equilibrium problems with extrapolation technique ⋮ An additional projection step to He and Liao's method for solving variational inequalities ⋮ A rapid algorithm for a class of linear complementarity problems ⋮ Self-adaptive projection method for co-coercive variational inequalities ⋮ A self-adaptive projection-type method for nonlinear multiple-sets split feasibility problem ⋮ Modified descent-projection method for solving variational inequalities ⋮ An efficient projection method for nonlinear inverse problems with sparsity constraints ⋮ Inexact proximal point method for general variational inequalities ⋮ ON A NEW NUMERICAL METHOD FOR SOLVING GENERAL VARIATIONAL INEQUALITIES ⋮ Accelerating the gradient projection algorithm for solving the non-additive traffic equilibrium problem with the Barzilai-Borwein step size ⋮ A new decomposition method for variational inequalities with linear constraints ⋮ A self-adaptive projection method with improved step-size for solving variational inequalities ⋮ An improved two-step method for solving generalized Nash equilibrium problems ⋮ An LQP-based two-step method for structured variational inequalities ⋮ New step lengths in projection method for variational inequality problems ⋮ Applications of fixed-point and optimization methods to the multiple-set split feasibility problem ⋮ A generalized proximal-point-based prediction-correction method for variational inequality problems ⋮ An operator splitting method for monotone variational inequalities with a new perturbation strategy ⋮ Solving the combined modal split and traffic assignment problem with two types of transit impedance function ⋮ A new class of projection and contraction methods for solving variational inequality problems ⋮ Strong convergence of a self-adaptive method for the split feasibility problem ⋮ A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem ⋮ Modified self-adaptive projection method for solving pseudomonotone variational inequalities ⋮ A new modified Goldstein-Levitin-Polyak projection method for variational inequality problems ⋮ A modified inexact implicit method for mixed variational inequalities ⋮ An operator splitting method for variational inequalities with partially unknown mappings ⋮ Unnamed Item ⋮ A modified projection method with a new direction for solving variational inequalities ⋮ A proximal alternating direction method for multi-block coupled convex optimization ⋮ Modified extragradient methods for solving variational inequalities ⋮ Some projection methods with the BB step sizes for variational inequalities ⋮ A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems ⋮ On projected alternating BB methods for variational inequalities ⋮ Self-adaptive implicit methods for monotone variant variational inequalities ⋮ A projection descent method for solving variational inequalities ⋮ The improvement with relative errors of He et al.'s inexact alternating direction method for monotone variational inequalities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- A note on a globally convergent Newton method for solving monotone variational inequalities
- Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems
- Dynamical systems and variational inequalities
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Equivalence of variational inequality problems to unconstrained minimization
- Formulation, stability, and computation of traffic network equilibria as projected dynamical systems
- Nonlinear complementarity as unconstrained optimization
- Projected dynamical systems and variational inequalities with applications
- Network economics: a variational inequality approach
- A globally convergent Newton method for solving strongly monotone variational inequalities
- Minimization of functions having Lipschitz continuous first partial derivatives
- Application Of Khobotov’s Algorithm To Variational Inequalities And Network Equilibrium Problems
- Two-Metric Projection Methods for Constrained Optimization
- Modification of the extra-gradient method for solving variational inequalities and certain optimization problems
- On the Goldstein-Levitin-Polyak gradient projection method
- An iterative scheme for variational inequalities
- Convex programming in Hilbert space
This page was built for publication: Modified Goldstein--Levitin--Polyak projection method for asymmetric strongly monotone variational inequalities