On a class of least-element complementarity problems

DOI10.1007/BF01582097zbMath0393.90092OpenAlexW1989981719MaRDI QIDQ4175066

Jong-Shi Pang

Publication date: 1979

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01582097

zbMATH Keywords

AlgorithmComputational EfficiencyLeast-Element Complementarily Problems

Mathematics Subject Classification ID

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

Related Items

Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods ⋮ Generalizations of \(\mathbf P_ 0\)- and \(\mathbf P\)-properties; extended vertical and horizontal linear complementarity problems ⋮ Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix ⋮ Continuous Selections of Solutions to Parametric Variational Inequalities ⋮ Some n by dn linear complementarity problems ⋮ Nonnegative generalized inverses and least elements of polyhedral sets ⋮ Linear-step solvability of some folded concave and singly-parametric sparse optimization problems ⋮ Newton's method for linear complementarity problems ⋮ On the solution of concave knapsack problems ⋮ A finite improvement algorithm for the linear complementarity problem ⋮ Iterative methods for linear complementarity problems with upperbounds on primary variables ⋮ Basic-set algorithm for a generalized linear complementarity problem ⋮ A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems

Cites Work

• Unnamed Item
• Unnamed Item
• Some algorithms solving the unilateral Dirichlet problem with two constraints
• On the solution of large, structured linear complementarity problems: the block partitioned case
• Complementary pivot theory of mathematical programming
• Linear complementarity problems solvable by A single linear program
• Isotone solutions of parametric linear complementarity problems
• A linear complementarity problem with an n by 2n “P”-matrix
• On solving linear complementarity problems as linear programs
• The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
• The conjugate gradient method in extremal problems
• Least d-Majorized Network Flows with Inventory and Statistical Applications
• Polyhedral sets having a least element
• A Partition Theorem for Euclidean n-Space