A continuous deformation algorithm for variational inequality problems on polytopes

DOI10.1007/BF01582567zbMath0819.65102MaRDI QIDQ1330896

Yang Dai, Yoshitsugu Yamamoto

Publication date: 10 August 1994

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

variational inequality; numerical examples; polytope; continuous deformation algorithm; variable dimension algorithm

Mathematics Subject Classification ID

65K10: Numerical optimization and variational techniques

49J40: Variational inequalities

49M27: Decomposition methods

Cites Work

• The computation of fixed points and applications
• A simplicial homotopy algorithm for computing zero points on polytopes
• Simplicial algorithms on the simplotope
• A variable rate refining triangulation
• A Simplicial Algorithm for Stationary Point Problems on Polytopes
• Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
• A new subdivision for computing fixed points with a homotopy algorithm
• A Simplicial Algorithm for the Nonlinear Stationary Point Problem on an Unbounded Polyhedron
• A restart algorithm for computing fixed points without an extra dimension
• Homotopies for computation of fixed points
• A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices
• Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods
• Homotopies for computation of fixed points on unbounded regions
• Conjugate Directions without Linear Searches
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item