Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Books and Book parts
  4. An output-sensitive algorithm for multi-parametric LCPs with sufficient matrices
 
book part or chapter

An output-sensitive algorithm for multi-parametric LCPs with sufficient matrices

Columbano, S.
•
Fukuda, K.
•
Jones, Colin  
2009
Polyhedral Computation

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 the input and linear in the size of the output, when the problem is non-degenerate. We give a lexicographic perturbation technique to resolve degeneracy as well. Unlike for the non-parametric case, the resolution turns out to be nontrivial, and in particular, it involves linear programming (LP) duality and multi-objective LP.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

2009 An output-sensitive algorithm for multi-parametric LCPs with sufficient matrices.pdf

Access type

openaccess

Size

1.03 MB

Format

Adobe PDF

Checksum (MD5)

775a533e52743b0f034bd950237481bd

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés