Block pivot methods for solving the complementarity problem

DOI10.1016/0024-3795(78)90083-6zbMath0395.65032OpenAlexW2035177710MaRDI QIDQ1253090

Publication date: 1978

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(78)90083-6

zbMATH Keywords

Block Pivot Methods Complementarity Problem Nonlinear Problems in Rn- Space

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

Block pivot methods for solving frictional contact problems, Optimal non-negative forecast reconciliation, On a ``stability in the linear complementarity problem, Linear complementarity problems and multiple objective programming, A Comparison of Block Pivoting and Interior-Point Algorithms for Linear Least Squares Problems with Nonnegative Variables, Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach, Iterations for solving linear variational inequalities on domains with nonlinear boundaries, The block principal pivoting algorithm for the linear complementarity problem with an \(M\)-matrix, Block pivoting and shortcut strategies for detecting copositivity, A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization, Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications, A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems

Cites Work