Related papers: Algebraic Farkas Lemma and Strong Duality for Pert…
In this paper we give five gauge-invariant systems of governing equations for first and second order scalar perturbations of flat Friedmann-Lema\^{i}tre universes that are minimal in the sense that they contain no redundant equations or…
In this paper, we present sufficient conditions ensuring that the sum of the image of quadratic functions and the nonnegative orthant is convex. The hidden convexity of the trust-region problem with linear inequality constraints is…
We discuss and provide nontrivial evidence for a large class of dualities in three-dimensional field theories with different gauge groups. We match the full partition functions of the dual phases for any value of the couplings to underpin…
This paper presents rigorous forward error bounds for linear conic optimization problems. The error bounds are formulated in a quite general framework; the underlying vector spaces are not required to be finite-dimensional, and the convex…
We study properties of programs with monotone and convex constraints. We extend to these formalisms concepts and results from normal logic programming. They include the notions of strong and uniform equivalence with their characterizations,…
We introduce a vector-valued version of a uniform algebra, called the vector-valued function space over a uniform algebra. The diameter two properties of the vector-valued function space over a uniform algebra on an infinite compact…
The aim of this work is to study the dual and the algebraic dual of an evaluation code using standard monomials and indicator functions. We show that the dual of an evaluation code is the evaluation code of the algebraic dual. We develop an…
The main purpose of this paper is to close the gap between the optimal values of an infinite convex program and that of its biconjugate relaxation. It is shown that Slater and continuity-type conditions guarantee such a zero-duality gap.…
In the context of augmented Lagrangian approaches for solving semidefinite programming problems, we investigate the possibility of eliminating the positive semidefinite constraint on the dual matrix by employing a factorization. Hints on…
Some of the most important results in prediction theory and time series analysis when finitely many values are removed from or added to its infinite past have been obtained using difficult and diverse techniques ranging from duality in…
Recently a notion of self-duality for differential equations of maximal cuts was introduced, which states that there should be a basis in which the matrix for an {\epsilon}-factorised differential equation is persymmetric. It was observed…
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…
Self-dual codes over finite fields and over some finite rings have been of interest and extensively studied due to their nice algebraic structures and wide applications. Recently, characterization and enumeration of Euclidean self-dual…
This paper studies convex sets categorically, namely as algebras of a distribution monad. It is shown that convex sets occur in two dual adjunctions, namely one with preframes via the Boolean truth values {0,1} as dualising object, and one…
Duality transformations play a very important role in theoretical physics. In this paper I propose new duality transformations for fermionic theories. They map the strong coupling regime of one theory to the weak coupling regime of another…
Quantum computers have the potential to explore the vast Hilbert space of entangled states that play an important role in the behavior of strongly interacting matter. This opportunity motivates reconsidering the Hamiltonian formulation of…
Accurately describing many-body effects in multi-orbital systems remains a major challenge in theoretical condensed matter physics. At present, there is a significant methodological gap between the numerical tools used in ab initio…
Motivated by some recent developments in abstract theories of quadratic forms, we start to develop in this work an expansion of Linear Algebra to multivalued structures (a multialgebraic structure is essentially an algebraic structure but…
In this paper, we consider establishing a formal connection between two distinct tree-abstraction problems inspired by the information-bottleneck (IB) method. Specifically, we consider the hard- and soft-constrained formulations that have…
This paper is concerned with the study of constrained statistical learning problems, the unconstrained version of which are at the core of virtually all of modern information processing. Accounting for constraints, however, is paramount to…