# Mittagsseminar (in cooperation with M. Ghaffari, A. Steger and B. Sudakov)

__Mittagsseminar Talk Information__ | |

**Date and Time**: Thursday, July 02, 2009, 12:15 pm

**Duration**: This information is not available in the database

**Location**: CAB G51

**Speaker**: Lorenz Klaus

## On the Number of Unique-Sink Orientations Arising from Pivoting in Linear Complementarity

For the P-matrix linear complementarity problem (P-LCP) neither hardness results nor polynomial-time algorithms are known. We focus on simple principal pivoting algorithms, identified by a pivot rule, as solving methods. The combinatorial unique-sink orientation (USO) abstraction is employed for the study of their behavior. By determining bounds on the number of USOs arising from P-LCPs (P-USOs) we estimate the chances whether a polynomial-time pivot rule for the P-LCP is likely to exist. The number of P-USOs in dimension $n$ turns out to be at most $2^{O(n^{3})}$, and for a lower bound, an explicit construction scheme gives $2^{\Omega(n^{2})}$ LP-realizable USOs. We conclude that the P-USOs contain a lot of combinatorial structure which is unknown so far, because every previously studied combinatorially defined class of USOs is much larger. The goal of future research is to extract this structure in order to prove polynomial runtime of an existing pivot rule or to devise superior rules.

Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)

Previous talks by year: 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M | admin login