A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems
type: Item
instance of: scholarly article
title: A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems
zbMATH Open document ID: 1179.49033
author: Deren Han
publication date: 2009-10-30T00:00:00Z
Mathematics Subject Classification ID: 49M27
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 49J40
zbMATH DE Number: 5623815
zbMATH Keywords: variational inequality problems
zbMATH Keywords: decomposition methods
zbMATH Keywords: entropic/interior proximal methods
zbMATH Keywords: relative error criterion
zbMATH Keywords: self-adaptive strategy
MaRDI profile type: Publication
full work available at URL: j.camwa.2007.03.015
OpenAlex ID: W2057813899
cites work: Application of the alternating direction method of multipliers to separable convex programming problems
cites work: Network economics: a variational inequality approach
cites work: Q4311908
cites work: Q3694624
cites work: Q3995612
cites work: A proximal-based deomposition method for compositions method for convex minimization problems
cites work: Alternating Projection-Proximal Methods for Convex Programming and Variational Inequalities
cites work: Q5618030
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: A dual algorithm for the solution of nonlinear variational problems via finite element approximation
cites work: Q3038523
cites work: Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
cites work: A logarithmic-quadratic proximal method for variational inequalities
cites work: Entropic proximal decomposition methods for convex programs and variational inequalities
cites work: A Generalized Proximal Point Algorithm for the Variational Inequality Problem in a Hilbert Space
cites work: Q4718793
cites work: Approximate iterations in Bregman-function-based proximal algorithms
cites work: An inexact hybrid generalized proximal point algorithm and some new results on the theory of Bregman functions
cites work: Convergence of Proximal-Like Algorithms
cites work: A new inexact alternating directions method for monotone variational inequalities
cites work: Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
cites work: Alternating direction method with self-adaptive penalty parameters for monotone variational inequalities
cites work: Inexact implicit method with variable parameter for mixed monotone variational inequalities
cites work: Modified Goldstein--Levitin--Polyak projection method for asymmetric strongly monotone variational inequalities
cites work: Self-adaptive operator splitting methods for monotone variational inequalities
cites work: A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
cites work: A new hybrid generalized proximal point algorithm for variational inequality problems
cites work: Inexact implicit methods for monotone general variational inequalities
cites work: Enlargement of monotone operators with applications to variational inequalities
cites work: Proximal Minimization Methods with Generalized Bregman Functions
cites work: Q5704056
cites work: Q3702408
cites work: On the Convergence of the Proximal Point Algorithm for Convex Minimization
cites work: On the basic theorem of complementarity
cites work: On the Goldstein-Levitin-Polyak gradient projection method
cites work: Smooth methods of multipliers for complementarity problems
cites work: A note on a globally convergent Newton method for solving monotone variational inequalities
cites work: A globally convergent Newton method for solving strongly monotone variational inequalities
cites work: Computing stationary points
DOI: 10.1016/J.CAMWA.2007.03.015
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 5623815