A new hybrid generalized proximal point algorithm for variational inequality problems

From MaRDI portal
Publication:1422877

DOI10.1023/A:1023087304476zbMath1044.65055OpenAlexW19621769MaRDI QIDQ1422877

Deren Han

Publication date: 12 February 2004

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1023087304476




Related Items

A survey on some recent developments of alternating direction method of multipliersThe developments of proximal point algorithmsAn interior proximal method for a class of quasimonotone variational inequalitiesA Bregman stochastic method for nonconvex nonsmooth problem beyond global Lipschitz gradient continuityAn alternating structure-adapted Bregman proximal gradient descent algorithm for constrained nonconvex nonsmooth optimization problems and its inertial variantA modified extragradient method for multi-valued variational inequality problemsA generalized \(f\)-projection algorithm for inverse mixed variational inequalitiesThe convergence rate analysis of the symmetric ADMM for the nonconvex separable optimization problemsA projection method for a system of nonlinear monotone equations with convex constraintsA generalized proximal-point-based prediction-correction method for variational inequality problemsProjected subgradient techniques and viscosity methods for optimization with variational inequality constraintsAn interior proximal point algorithm for nonlinear complementarity problemsExistence result and error bounds for a new class of inverse mixed quasi-variational inequalitiesNON-INTERIOR CONTINUATION METHOD FOR COMPLEMENTARITY PROBLEMS IN ABSENCE OF STRICT COMPLEMENTARITYA new algorithm for solving multi-valued variational inequality problemsA proximal point algorithm with asymmetric linear termA hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problemsProximal point algorithms for general variational inequalitiesThe indefinite proximal point algorithms for maximal monotone operators