Zobrazeno 1 - 10
of 118
pro vyhledávání: '"Adler, Ilan"'
The equivalence between von Neumann's Minimax Theorem for zero-sum games and the LP Duality Theorem connects cornerstone problems of the two fields of game theory and optimization, respectively, and has been the subject of intense scrutiny for seven
Externí odkaz:
http://arxiv.org/abs/2410.10767
In this paper, we propose new proximal Newton-type methods for convex optimization problems in composite form. The applications include model predictive control (MPC) and embedded MPC. Our new methods are computationally attractive since they do not
Externí odkaz:
http://arxiv.org/abs/2007.09525
Oriented matroids (often called order types) are combinatorial structures that generalize point configurations, vector configurations, hyperplane arrangements, polyhedra, linear programs, and directed graphs. Oriented matroids have played a key role
Externí odkaz:
http://arxiv.org/abs/2006.08922
We consider a random knockout tournament among players $1, \ldots, n$, in which each match involves two players. The match format is specified by the number of matches played in each round, where the constitution of the matches in a round is random.
Externí odkaz:
http://arxiv.org/abs/1612.04448
We show that there are simplex pivoting rules for which it is PSPACE-complete to tell if a particular basis will appear on the algorithm's path. Such rules cannot be the basis of a strongly polynomial algorithm, unless P = PSPACE. We conjecture that
Externí odkaz:
http://arxiv.org/abs/1404.3320
Autor:
Adler, Ilan, Verma, Sushil
The linear complementarity problem, LCP(q,M), is defined as follows. For given M,q find z such that q+Mz>=0, z>=0, z(q + M z)=0,or certify that there is no such z. It is well known that the problem of finding a Nash equilibrium for a bimatrix game (2
Externí odkaz:
http://arxiv.org/abs/1302.0067
Autor:
Adler, Ilan, Hochbaum, Dorit S.
We consider a generalization of the $k$-flow set system auction where the set to be procured by a customer corresponds to a feasible solution to a linear programming problem where the coefficient matrix and right-hand-side together constitute a total
Externí odkaz:
http://arxiv.org/abs/1102.3499
Publikováno v:
Operations Research, 2017 Nov 01. 65(6), 1589-1596.
Externí odkaz:
https://www.jstor.org/stable/45111672
Publikováno v:
Journal of Applied Probability, 2003 Jun 01. 40(2), 513-518.
Externí odkaz:
https://www.jstor.org/stable/3215807