Related papers: Algebraic Farkas Lemma and Strong Duality for Pert…
Farkas' lemma is a fundamental result from linear programming providing linear certificates for infeasibility of systems of linear inequalities. In semidefinite programming, such linear certificates only exist for strongly infeasible linear…
Property A is a form of weak amenability for groups and metric spaces introduced as an approach to the famous Novikov higher signature conjecture, one of the most important unsolved problems in topology. We show that property A can be…
We perform the study of perturbative aspects of a three-dimensional supersymmetric Maxwell-Chern-Simons-Proca theory minimally coupled to scalar superfields. Using the superfield formalism, we derive the propagators for both gauge and…
Infinite-dimensional linear conic formulations are described for nonlinear optimal control problems. The primal linear problem consists of finding occupation measures supported on optimal relaxed controlled trajectories, whereas the dual…
We examine the duality theory for a class of non-convex functions obtained by composing a convex function with a continuous one. Using Fenchel duality, we derive a dual problem that satisfies weak duality under general assumptions. To…
The most impressively prolific exploration of superstring models (aiming for our physical reality) has been focused on worldsheet-supersymmetric gauged linear sigma models and the closely associated complex-algebraic toric geometry. Mirror…
In semidefinite programming (SDP), unlike in linear programming, Farkas' lemma may fail to prove infeasibility. Here we obtain an exact, short certificate of infeasibility in SDP by an elementary approach: we reformulate any semidefinite…
The canonical structure of supergravity with a cosmological constant is analyzed in 2 + 1 dimensions using the Dirac constraint formalism. The first class constraints are used to find two Bosonic and one Fermionic gauge symmetries that…
Although it is easy to prove the sufficient conditions for optimality of a linear program, the necessary conditions pose a pedagogical challenge. A widespread practice in deriving the necessary conditions is to invoke Farkas' lemma, but…
Well-graded families, extremal systems and maximum systems (the last two in the sense of VC-theory and Sauer-Shelah lemma on VC-dimension) are three important classes of set systems. This paper aims to study the notion of duality in the…
In this paper, we investigate the use of so called "duality lemmas" to study the system of discrete coagulation-fragmentation equations with diffusion. When the fragmentation is strong enough with respect to the coagulation, we show that we…
This note establishes a limiting formula for the conic Lagrangian dual of a convex infinite optimization problem, correcting the classical version of Karney [Math. Programming 27 (1983) 75-82] for convex semi-infinite programs. A…
We study nonconvex quadratic problems (QPs) with quadratic separable constraints, where these constraints can be defined both as inequalities or equalities. We derive sufficient conditions for these types of problems to present the…
This paper is aimed to prove the strong duality theorem for continuous-time linear programming problems in which the coefficients are assumed to be piecewise continuous functions. The previous paper proved the strong duality theorem for the…
We show a universal algebraic local characterisation of the expressive power of finite-valued languages with domains of arbitrary cardinality and containing arbitrary many cost functions.
We present a new semidefinite Farkas lemma involving a side constraint on the rank. This lemma is then used to present a new proof of a recent characterization, by Connelly and Gortler, of dimensional rigidity of bar frameworks.
We present a new duality theory for non-convex variational problems, under possibly mixed Dirichlet and Neumann boundary conditions. The dual problem reads nicely as a linear programming problem, and our main result states that there is no…
This work studies the strong duality of non-convex matrix factorization problems: we show that under certain dual conditions, these problems and its dual have the same optimum. This has been well understood for convex optimization, but…
We consider sensitivity of a semidefinite program under perturbations in the case that the primal problem is strictly feasible and the dual problem is weakly feasible. When the coefficient matrices are perturbed, the optimal values can…
Farkas established that a system of linear inequalities has a solution if and only if we cannot obtain a contradiction by taking a linear combination of the inequalities. We state and formally prove several Farkas-like theorems over…