Results 1 to 10 of about 246 (126)
A Lemke-Like Algorithm for the Multiclass Network Equilibrium Problem [PDF]
, 2013 We consider a nonatomic congestion game on a connected graph, with several classes of players. Each player wants to go from its origin vertex to its destination vertex at the minimum cost and all players of a given class share the same characteristics: cost functions on each arc, and origin-destination pair. Under some mild conditions, it is known that
Frédéric Meunier, Thomas Pradeau
openaire +6 more sources
Parallel Implementation of Lemke's Algorithm on the Hypercube [PDF]
ORSA Journal on Computing, 1991 A simple but very effective method for parallelizing Lemke's algorithm for the solution of linear complementarity problems is presented. Implementation details on a 32-node Intel iPSC/2 hypercube for problems of dimension up to 1000 are discussed. A speedup efficiency as high as 76% is achieved with 32 processing nodes for a problem with 500 variables
DE LEONE, Renato, Ow Terence T. H.
openaire +3 more sources
More with the Lemke complementarity algorithm [PDF]
Mathematical Programming, 1978 In the case that the matrix of a linear complementarity problem consists of the sum of a positive semi-definite matrix and a co-positive matrix a general condition is deduced implying that the Lemke algorithm will terminate with a complementarity solution.
openaire +3 more sources
Graph pebbling algorithms and Lemke graphs
Discrete Applied Mathematics, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Charles A. Cusack +3 more
openaire +4 more sources
Maximization of a Convex Quadratic Function Under Linear Constraints [PDF]
, 1974 Since the appearance of a paper by H. Tui, maximization of convex function over a polytope has attracted much attention. In his paper, two algorithms were proposed: one cutting plane and the other enumerative.
Konno, H.
core +3 more sources
Linear complementarity problems solvable as linear programs
Journal of Numerical Analysis and Approximation Theory, 2018 In this paper, we present a theoretical and numerical study of linear complementary problems solvable as linear programs. We give several examples of linear complementarity problems which can be solved as linear programs using linear programming ...
Zakia Kebbiche
doaj +2 more sources
Analysis of Iterative Waterfilling Algorithm for Multiuser Power Control in Digital Subscriber Lines
EURASIP Journal on Advances in Signal Processing, 2006 We present an equivalent linear complementarity problem (LCP) formulation of the noncooperative Nash game resulting from the DSL power control problem.
Pang Jong-Shi, Luo Zhi-Quan
doaj +1 more source
An experimental analysis of Lemke-Howson algorithm
, 2008 15 pages, 18 figures.
Codenotti, Bruno +2 more
openaire +2 more sources
The non-smooth contact dynamics method [PDF]
, 1999 International audienceThe main features of the Non-Smooth Contact Dynamics method are presented in this paper, the use of the dynamical equation, the non-smooth modelling of unilateral contact and Coulomb's law, fully implicit algorithms to solve the ...
Jean, Michel
core +2 more sources
Lasso Estimation of an Interval-Valued Multiple Regression Model
, 2015 A multiple interval-valued linear regression model considering all the cross-relationships between the mids and spreads of the intervals has been introduced recently.
A. Blanco-Fernández +6 more
core +1 more source