An Output-Sensitive Algorithm for Multi-Parametric LCPs with Sufficient Matrices

@inproceedings{Columbano2008AnOA,
  title={An Output-Sensitive Algorithm for Multi-Parametric LCPs with Sufficient Matrices},
  author={Sebastiano Columbano and Komei Fukuda and Colin Neil Jones},
  year={2008}
}
This paper considers the multi-parametric linear complementarity problem (pLCP) with sufficient matrices. The main result is an algorithm to find a polyhedral decomposition of the set of feasible parameters and to construct a piecewise affine function that maps each feasible parameter to a solution of the associated LCP in such a way that the function is affine over each cell of the decomposition. The algorithm is output-sensive in the sense that its time complexity is polynomial in the size of… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 28 references

The linear complementarity problem, Comput

  • R. W. Cottle, J.-S. Pang, R. E. Stone
  • Sci. Sci. Comput. Academic Press, Boston, MA,
  • 1992
Highly Influential
4 Excerpts

Linear complementarity, linear and nonlinear programming, Sigma Ser

  • K. G. Murty, F. T. Yu
  • Appl. Math., vol. 3, Heldermann, Berlin,
  • 1988
Highly Influential
4 Excerpts

and M

  • A. G. Beccuti, G. Papafotiou, R. Frasca
  • Morari, Explicit hybrid model predictive control…
  • 2007
1 Excerpt

and M

  • C. N. Jone
  • Morari, Multiparametric linear complementarity…
  • 2006

Geometry of model predictive control for constrained linear systems, Tech

  • M. M. Seron, G. C. Goodwin, J. A. De Doná
  • Report EE0031, The University of Newcastle…
  • 2000
2 Excerpts