scispace - formally typeset
Open AccessBook

Linear complementarity, linear and nonlinear programming

About
The article was published on 1988-01-01 and is currently open access. It has received 1012 citations till now. The article focuses on the topics: Mixed complementarity problem & Complementarity theory.

read more

Citations
More filters
Dissertation

Mathematical programming methods for decentralized POMDPs

Raghav Aras
TL;DR: A new mathematical programming based approach for exactly solving a finite horizon DEC-POMDP using the sequence form of a control policy in this approach and shows how the problem can be formulated as a mathematical progam with a nonlinear object and linear constraints.

Modeling and simulation of friction -limited continuously variable transmissions

TL;DR: In this paper, the authors presented a detailed continuous onedimensional transient-dynamic model of a metal V-belt CVT that accurately captures the various transient dynamic interactions occurring in the system, whereas the dynamics characterized by the discrete structure (that cause polygonal excitations) of the chain are captured by developing a detailed planar multibody model of chain CVT.
Journal ArticleDOI

On local w-uniqueness of solutions to linear complementarity problem

TL;DR: In this paper, column (row) competent matrices were introduced and it was shown that the local uniqueness of solutions to linear complementarity problems can be characterized by column-compensated matrices.

Discrete Particle Simulation Techniques for the Analysis of Colliding and Flowing Particulate Media

TL;DR: The Software Library for Discrete Element Simulations (SLIDES) as discussed by the authors is an object-oriented discrete particle simulation library developed in Fortran capable of performing fully 3D simulations of particulate systems.
Book ChapterDOI

Sparse linear complementarity problems

TL;DR: It is shown that 2-LCP is strongly NP-hard, while it can be solved in O(n 3 logn) time if it is sign-balanced, i.e., each row has at most one positive and one negative entries, where n is the number of constraints.
Related Papers (5)