On a class of least-element complementarity problems

DOI10.1007/BF01582097MaRDI QIDQ4175066zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

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

Cited in

(13)

• Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
• Some n by dn linear complementarity problems
• Basic-set algorithm for a generalized linear complementarity problem
• A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
• A finite improvement algorithm for the linear complementarity problem
• Generalizations of \(\mathbf P_ 0\)- and \(\mathbf P\)-properties; extended vertical and horizontal linear complementarity problems
• On the solution of concave knapsack 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
• Iterative methods for linear complementarity problems with upperbounds on primary variables
• Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix
• Continuous Selections of Solutions to Parametric Variational Inequalities

This page was built for publication: On a class of least-element complementarity problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4175066)