Multiparametric Linear Complementarity Problems

The linear complementarity problem (LCP) is a general problem that unifies linear and quadratic programs and bimatrix games. In this paper, we present an efficient algorithm for the solution to multiparametric linear complementarity problems (pLCPs) that are defined by positive semi-definite matrices. This class of problems includes the multiparametric linear (pLP) and semi-definite quadratic programs (pQP), where parameters are allowed to appear linearly in the cost and the right hand side of the constraints. We demonstrate that the proposed algorithm is equal in efficiency to the best of current pLP and pQP solvers for all problems that they can solve, and yet extends to a much larger class

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Multiparametric Linear Complementarity Problems

Chat with Graph Search

Augmented Memory: Sample-Efficient Generative Molecular Design with Reinforcement Learning

Reach For the Arcs: Reconstructing Surfaces from SDFs via Tangent Points

A ride time-oriented scheduling algorithm for dial-a-ride problems