The quasi-Newton method of solution of convex variational inequalities with descent decomposition

DOI10.1007/BF02835855zbMath0971.65056MaRDI QIDQ1570271

V. M. Panin, V. V. Skopetskyia

Publication date: 1 July 2001

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

algorithmconvergencequasi-Newton methodconvex variational inequalitiesdescent decomposition

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Variational inequalities (49J40) Newton-type methods (49M15) Decomposition methods (49M27)

Related Items (1)

Penalty method for variational inequalities with multivalued mappings. I

Cites Work

• A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
• 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
• A general descent framework for the monotone variational inequality problem
• A nonsmooth Newton method for variational inequalities. I: Theory
• Regularized method for solving variational inequalities with a monotone operator on a polyhedron
• Finite algorithm to find the saddle point of a quadratic function subject to linear constraints
• Nonlocal quasi-Newton type method for solving convex variational inequalities
• A relaxed projection method for variational inequalities
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The quasi-Newton method of solution of convex variational inequalities with descent decomposition