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
Proceedings ArticleDOI

Multiparametric Linear Complementarity Problems

TL;DR: This paper presents an efficient algorithm for the solution to multiparametric linear complementarity problems (pLCPs) that are defined by positive semi-definite matrices and demonstrates that the proposed algorithm is equal in efficiency to the best of current pLP and pQP solvers.

Oops! I cannot do it again: Testing for recursive

TL;DR: It is shown how Farkas' Lemma in combination with bilevel programming and disjoint bilinear programming can be used to search for problematic initial states which lack recursive feasibility, thus invalidating a particular MPC controller.
Proceedings ArticleDOI

Parallel Dense Gauss-Seidel Algorithm on Many-Core Processors

TL;DR: This paper proposes to study several parallelization schemes for fully-coupled systems, unable to be parallelized by existing methods, taking advantage of recent many-cores architectures offering fast synchronization primitives.
Journal ArticleDOI

Stability and instability matrices for linear evolution variational inequalities

TL;DR: This paper deals with the characterization of the stability and instability matrices for a class of unilaterally constrained dynamical systems, represented as linear evolution variational inequalities (LEVI).
Proceedings ArticleDOI

An analytic placer for mixed-size placement and timing-driven placement

TL;DR: In this paper, the APlace wirelength-driven standard-cell analytic placement framework is extended to address timing-driven and mixed-size ("boulders and dust") placement.
Related Papers (5)