A new algorithm for the linear complementarity problem allowing for an arbitrary starting point [PDF]
Linear ...
Kremers, J.A.W.M., Talman, A.J.J.
core +1 more source
Water Resources Research, Volume 61, Issue 11, November 2025.Abstract The benthic biolayer is a shallow zone of reactive streambed sediments, widely believed to contribute disproportionately to whole‐stream reactions such as aerobic respiration and contaminant transformation. Quantifying the relative contribution of the biolayer to whole‐stream reactions remains challenging because it requires that hyporheic ...
Kevin R. Roche +8 more
wiley +1 more source
An enumerative method for the solution of linear complementarity problems [PDF]
, 1983 In this report an enumerative method for the solution of the Linear Complementarity Problem (LCP) is presented. This algorithm completely processes the LCP, and does not require any particular property of the LCP to apply.
Judice, JJ, Mitra, G
core +1 more source
Equilibrium and Linear Complementarity - An Economy with Institutional Constraints on Prices [PDF]
, 1974 In the theory of perfect competition, it is supposed that there are no institutional restrictions upon prices. Much the same assumption is built into mathematical programming models.
Hansen, T., Manne, A.S.
core
Progressive equilibration algorithms : the case of linear transaction costs [PDF]
, 1989 Includes bibliographical references (p. 26-27).by A.
core
On the removal of ill conditioning effects in the computation of optimal controls [PDF]
Ill conditioning effects eliminated in nonlinear programming algorithms for optimal ...
Polak, E.
core +1 more source
A linearization and decomposition algorithm for computing urban traffic equilibria [PDF]
, 1983 "This article has appeared in Proceedings, IEEE 192 Large-Scale Systems Symposium"--P.1.Includes bibliographical references (leaves 11-12).Supported in part by Dept. of Transportation DOT-TSC-1058.
core
A Cutting Plane Algorithm for Solving Bilinear Programs [PDF]
, 1974 Nonconvex programs which have either a nonconvex minimand and/or a nonconvex feasible region have been considered by most mathematical programmers as a hopelessly difficult area of research. There are, however, two exceptions where considerable effort to
Konno, H.
core
Mathematical programs with equilibrium constraints: automatic reformulation and solution via constrained optimization [PDF]
, 2002 Constrained optimization has been extensively used to solve many large scale deterministic problems arising in economics, including, for example, square systems of equations and nonlinear programs.
Dirkse, Steven P. +2 more
core +2 more sources
Computing Cournot-Nash equilibria / 1441 [PDF]
Includes bibliographical references (p. 22-23)
Kolstad, Charles D., Mathiesen, Lars
core