On a class of iterative projection and contraction methods for linear programming

DOI10.1007/BF00939669zbMath0792.90042MaRDI QIDQ1321374

Bing-sheng He

Publication date: 25 July 1994

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

linear complementarity problemsprojection and contraction methodlinear speed of convergencetransportation and network problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Linear programming (90C05)

Related Items

A class of iterative methods for solving nonlinear projection equations ⋮ A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs ⋮ Extended projection methods for monotone variational inequalities ⋮ Two new self-adaptive projection methods for variational inequality problems

Cites Work

• Solution of projection problems over polytopes
• A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
• Solution of symmetric linear complementarity problems by iterative methods
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item