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.90069OpenAlexW1549741150MaRDI QIDQ3936520
Jong-Shi Pang, Richard W. Cottle
Publication date: 1982
Published in: Mathematical Programming Studies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0120964
convergencecompactnesslevel setslarge-scale linear complementarity problemsreduced block successive overrelaxation method
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Iterative methods for variational and complementarity problems, Computational development of a lagrangian dual approach for quadratic networks, Projected splitting methods for vertical linear complementarity problems, A lagrangean relaxation algorithm for the constrained matrix problem, Dual coordinate step methods for linear network flow problems, A multisplitting method for symmetric linear complementarity problems, Relaxation modulus-based matrix splitting iteration method for vertical linear complementarity problem, A new matrix splitting generalized iteration method for linear complementarity problems, The double-relaxation modulus-based matrix splitting iteration method for linear complementarity problems, Quadratic one-step smoothing Newton method for \(P_{0}\)-LCP without strict complementarity., Relaxation methods for problems with strictly convex separable costs and linear constraints, A survey on the continuous nonlinear resource allocation problem, Implementing an “exact” Newton method for separable convex transportation problems, A new smoothing Newton method for solving constrained nonlinear equations, Hidden Z-matrices with positive principal minors, On multilevel iterative methods for optimization problems, On cone orderings and the linear complementarity problem, A polynomial algorithm for minimum quadratic cost flow problems, Necessary and sufficient conditions for the convergence of iterative methods for the linear complementarity problem, More results on the convergence of iterative methods for the symmetric linear complementarity problem, Descent methods for convex essentially smooth minimization, On the convergence of the coordinate descent method for convex differentiable minimization
