Related papers: Von Neumann's minimax theorem through Fourier-Motz…
In this paper, we propose a new method for removing all the redundant inequalities generated by Fourier-Motzkin elimination. This method is based on an improved version of Balas' work and can also be used to remove all the redundant…
In this paper we introduce a novel quantifier elimination method for conjunctions of linear real arithmetic constraints. Our algorithm is based on the Fourier-Motzkin variable elimination procedure, but by case splitting we are able to…
Fourier-Motzkin elimination is a projection algorithm for solving finite linear programs. We extend Fourier-Motzkin elimination to semi-infinite linear programs which are linear programs with finitely many variables and infinitely many…
Our first result is a statement of a somewhat general form of a non-substitution theorem for linear programming problems, along with a very easy proof of the same. Subsequently, we provide an easy proof of theorem 1 in a 1979 paper of Olvi…
In this paper we present a quantifier elimination method for conjunctions of linear real arithmetic constraints. Our algorithm is based on the Fourier-Motzkin variable elimination procedure, but by case splitting we are able to reduce the…
In this work, we characterize the existence of solution for a certain variational inequality by means of a classical minimax theorem. In addition, we propose a numerical algorithm for the solution of an inverse problem associated with a…
A number of landmark existence theorems of nonlinear functional analysis follow in a simple and direct way from the basic separation of convex closed sets in finite dimension via elementary versions of the Knaster-Kuratowski-Mazurkiewicz…
Many proofs of the fundamental theorem of algebra rely on the fact that the minimum of the modulus of a complex polynomial over the complex plane is attained at some complex number. The proof then follows by arguing the minimum value is…
Here, we give a self-contained and elementary proof of a minimax theorem due to Fan in a simplified setting that can be taught in an advanced undergraduate course. Our proof follows Nikaido's argument with some simplifications.
The aim of this article is to establish new two-functions minimax inequalities extending classical results such as Simons' minimax theorem. Our results will be proved in a non-compact setting. We also prove, under general conditions, that…
In this paper, we present a new method for variable elimination in systems of inequations which is much faster than the Fourier-Motzkin Elimination (FME) method. In our method, a linear Diophantine problem is introduced which is dual to our…
A one-line proof of a minimax theorem due to Steinerberger is given.
We give a simple proof of the Fourier Inversion Theorem, using the methods of nonstandard analysis.
We consider first-order linear systems of ordinary differential equations with periodic coefficients. Supposing that right-hand sides of equations are not known and subjected to some quadratic restrictions, we obtain optimal, in certain…
While teaching a course on integral equations, I noticed that a straightforward combination of Neumann series and Fourier series for the resolvent (or the solution) of an integral equation has good approximation qualities. This short…
We study minimizers of non-autonomous energies with minimal growth and coercivity assumptions on the energy. We show that the minimizer is nevertheless the solution of the relevant Euler--Lagrange equation or inequality. The main tool is an…
Lower bounds involving $f$-divergences between the underlying probability measures are proved for the minimax risk in estimation problems. Our proofs just use simple convexity facts. Special cases and straightforward corollaries of our…
We give an elementary proof of Kelley's theorem based on a minimax argument. Some applications to related problems are also developed.
A system of linear equations is said underdetermined when there are more unknowns than equations. Such systems may have infinitely many solutions. In this case, it is important to single out solutions possessing special features. A well…
The basic disentanglement theorem established by the present authors states that estimates on a weighted geometric mean over (convex) families of functions can be disentangled into quantitatively linked estimates on each family separately.…