Related papers: On "two important theorems" in canonical duality t…
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…
The paper is accompanying "A general Duality Theorem for the Monge-Kantorovich Transport Problem". We explain the methods used in this article in an elementary setting and present two examples complementing the results obtained therein.
We discuss the pseudodual chiral model to illustrate a class of two-dimensional theories which have an infinite number of conservation laws but allow particle production, at variance with naive expectations. We describe the symmetries of…
This article will be a continuation of our research into self-justifying systems. It will introduce several new theorems and their applications. (One of these results will transform our previous infinite-sized self-verifying formalisms into…
We consider an optimization problem with positively homogeneous functions in its objective and constraint functions. Examples of such positively homogeneous functions include the absolute value function and the $p$-norm function, where $p$…
We propose to solve large instances of the non-convex optimization problems reformulated with canonical duality theory. To this aim we propose an interior point potential reduction algorithm based on the solution of the primal-dual total…
This paper presents an application of Canonical duality theory to the solution of contact problems with Coulomb friction. The contact problem is formulated as a quasi-variational inequality which solution is found by solving its…
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…
We present a cut elimination argument that witnesses the conservativity of the compositional axioms for truth (without the extended induction axiom) over any theory interpreting a weak subsystem of arithmetic. In doing so we also fix a…
We provide three new proofs of the strong concavity of the dual function of some convex optimization problems. For problems with nonlinear constraints, we show that the the assumption of strong convexity of the objective cannot be weakened…
With this note we bring again into attention a vector dual problem neglected by the contributions who have recently announced the successful healing of the trouble encountered by the classical duals to the classical linear vector…
Lectures given by C.G. in the Advanced School on Effective Theories (Almu\~{n}ecar, Granada, 1995) on duality in N=2 supersymmetric Yang-Mills, and the coupling to gravity.
By introducing a quadratic perturbation to the canonical dual of the maxcut problem, we transform the integer programming problem into a concave maximization problem over a convex positive domain under some circumstances, which can be…
Two recent papers (Renou et al., arXiv:2101.10873, and Chen et al., arXiv:2103.08123) have indicated that complex numbers are necessary for quantum theory. This short note is a comment on their result.
The problem of minimizing the difference of two convex functions is called polyhedral d.c. optimization problem if at least one of the two component functions is polyhedral. We characterize the existence of global optimal solutions of…
Recent advances in the efficiency and robustness of algorithms solving convex quadratically constrained quadratic programming (QCQP) problems motivate developing techniques for creating convex quadratic relaxations that, although more…
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…
In this short note we give counterexamples to several results related to extension theorems published recently.
In a recent manuscript, Gelman & Yao (2020) claim that "the usual rules of conditional probability fail in the quantum realm" and that "probability theory isn't true (quantum physics)" and purport to support these statements with the…
The goal of this paper is to solve a class of high-order polynomial benchmark optimization problems, including the Goldstein-Price problem and the Three Hump Camel Back problem. By using a generalized canonical duality theory, we are able…