English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

This paper considers the multi-parametric linear complementarity problem(pLCP) with sufficient matrices. The main result is an algorithm to find apolyhedral decomposition of the set of feasible parameters and to construct apiecewise affine function that maps each feasible parameter to a solution ofthe associated LCP in such a way that the function is affine over each cell ofthe decomposition. The algorithm is output-sensive in the sense that its timecomplexity is polynomial in the size of the input and linear in the size of theoutput, when the problem is non-degenerate. We give a lexicographicperturbation technique to resolve degeneracy as well. Unlike for thenon-parametric case, the resolution turns out to be nontrivial, and inparticular, it involves linear programming (LP) duality and multi-objective LP.

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