scientific article; zbMATH DE number 1399482

MaRDI QIDQ4937580zbMATH OpenFDO

Authors Jing Zhou

Publication date 6 February 2000

zbMATH Keywords

convergencenumerical experimentsalternating direction methodmonotone variational inequalityprojection and contraction method

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Numerical methods based on nonlinear programming (49M37) Variational inequalities (49J40)

Recommendations

• A simple alternating direction method for linear variational inequality problems
• A modified alternating direction method for variational inequality problems.
• An extended alternating direction method for variational inequality problems with linear equality and inequality constraints
• Solving variational inequality problems with linear constraints by a proximal decomposition algorithm
• An inexact alternating direction method for solving a class of structured variational inequalities

Cited in

(6)

• Solving variational inequality problems with linear constraints by a proximal decomposition algorithm
• A simple alternating direction method for linear variational inequality problems
• Solving linear programming problem via a reduced dimension method
• Solving variational inequalities defined on a domain with infinitely many linear constraints
• AN EXTENSION OF LEITMANN'S DIRECT METHOD TO INEQUALITY CONSTRAINTS
• A variable transformation method for solving linear absolute-value objective-function problems with linear constraints

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4937580)