On the convergence of a block successive over-relaxation method for a class of linear complementarity problems
From MaRDI portal
Publication:3936520
DOI10.1007/BFb0120964zbMath0478.90069MaRDI QIDQ3936520
Jong-Shi Pang, Richard W. Cottle
Publication date: 1982
Published in: Mathematical Programming Studies (Search for Journal in Brave)
convergence; compactness; level sets; large-scale linear complementarity problems; reduced block successive overrelaxation method
65K05: Numerical mathematical programming methods
90C20: Quadratic programming
90C05: Linear programming
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Related Items
On cone orderings and the linear complementarity problem, A polynomial algorithm for minimum quadratic cost flow problems, More results on the convergence of iterative methods for the symmetric linear complementarity problem, Dual coordinate step methods for linear network flow problems, Hidden Z-matrices with positive principal minors, Descent methods for convex essentially smooth minimization, On the convergence of the coordinate descent method for convex differentiable minimization, Quadratic one-step smoothing Newton method for \(P_{0}\)-LCP without strict complementarity., On multilevel iterative methods for optimization problems, Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem, A multisplitting method for symmetric linear complementarity problems, A survey on the continuous nonlinear resource allocation problem, A lagrangean relaxation algorithm for the constrained matrix problem, Relaxation methods for problems with strictly convex separable costs and linear constraints, Implementing an “exact” Newton method for separable convex transportation problems, Iterative methods for variational and complementarity problems, Computational development of a lagrangian dual approach for quadratic networks
