Iterative methods for variational and complementarity problems
Publication:3965925
DOI10.1007/BF01585112zbMath0499.90074MaRDI QIDQ3965925
No author found.
Publication date: 1982
Published in: Mathematical Programming (Search for Journal in Brave)
global convergencelocal convergencenonlinear complementarity problemsvariational inequality problemtraffic equilibriacomputation of equilibrialinear approximation methodsnonlinear approximation methodseconomic spatial equilibriasuccessive overrelaxation algorithmsvarious iterative methods
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) General equilibrium theory (91B50) Variational inequalities (global problems) in infinite-dimensional spaces (58E35)
Related Items (only showing first 100 items - show all)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solution of nonsymmetric, linear complementarity problems by iterative methods
- Generalized variational inequalities
- On the convergence of a basic iterative method for the implicit complementarity problem
- Solution of symmetric linear complementarity problems by iterative methods
- M-matrix characterizations. I: nonsingular M-matrices
- On the solution of large, structured linear complementarity problems: the block partitioned case
- Hidden Z-matrices with positive principal minors
- On \(M\)-functions and their application to nonlinear Gauss-Seidel iterations and to network flows
- Strongly Regular Generalized Equations
- A Hybrid Method for the Solution of Some Multi-Commodity Spatial Equilibrium Problems
- On the convergence of a block successive over-relaxation method for a class of linear complementarity problems
- A Column Generation Technique for the Computation of Stationary Points
- The Generalized Quasi-Variational Inequality Problem
- Minimality and complementarity properties associated with Z-functions and M-functions
- Linear complementarity problems solvable by A single linear program
- Extension of the Generalized Complementarity Problem
- Computing stationary points
- On solving linear complementarity problems as linear programs
- An iterative scheme for variational inequalities
- Convex Analysis
- The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
- Homotopies for computation of fixed points on unbounded regions
- A Partition Theorem for Euclidean n-Space
This page was built for publication: Iterative methods for variational and complementarity problems