A strong duality theorem for the minimum of a family of convex programs

We produce a duality theorem for the minimum of an arbitrary family of convex programs. This duality theorem provides a single concave dual maximization and generalizes recent work in linear disjunctive programming. Homogeneous and symmetric formulations are studied in some detail, and a number of convex and nonconvex applications are given.This work was partially funded by National Research Council of Canada, Grant No. A4493. Thanks are due to Mr. B. Toulany for many conversations and to Dr. L. MacLean who suggested the chance-constrained model.     

A solvability theorem and minimax fractional programming

This paper presents a stable solvability theorem for general inequality systems under a local closedness condition. It is shown how this mild regularity condition can be characterized by the validity of the solvability theorem for all local perturbations. Based on this solvability theorem zero duality gap and stability are established for general minimax fractional programming problems.The research was initiated while the first named author was a visitor at the University of New South Wales and was completed while the second named author was a visitor at the Technische Hochschule Darmstadt.     

A duality theorem for linear congruences

An analogous duality theorem to that for Linear Programming is presented for systems of linear congruences. It is pointed out that such a system of linear congruences is a relaxation of an Integer Programming model (for which the duality theorem does not hold). Algorithms are presented for both the resulting primal and dual problems. These algorithms serve to give a constructive proof of the duality theorem.     

Duality theorem for weak L-R smash products

This paper gives a duality theorem for weak L-R smash products, which extends the duality theorem for weak smash products given by Nikshych.     

Duality theorem for a generalized Fermat-Weber problem

The classical Fermat-Weber problem is to minimize the sum of the distances from a point in a plane tok given points in the plane. This problem was generalized by Witzgall ton-dimensional space and to allow for a general norm, not necessarily symmetric; he found a dual for this problem. The authors generalize this result further by proving a duality theorem which includes as special cases a great variety of choices of norms in the terms of the Fermat-Weber sum. The theorem is proved by applying a general duality theorem of Rockafellar. As applications, a dual is found for the multi-facility location problem and a nonlinear dual is obtained for a linear programming problem with a priori bounds for the variables. When the norms concerned are continuously differentiable, formulas are obtained for retrieving the solution for each primal problem from the solution of its dual.     

A duality theorem for generalized local cohomology

We prove a duality theorem for graded algebras over a field that implies several known duality results: graded local duality, versions of Serre duality for local cohomology and of Suzuki duality for generalized local cohomology, and Herzog-Rahimi bigraded duality.

     

Bipolar theorem for quantum cones

In this note duality properties of quantum cones are investigated. We propose a bipolar theorem for quantum cones, which provides a new proof of the operator bipolar theorem proved by Effros and Webster. In particular, a representation theorem for a quantum cone is proved.     

Abstract Plancherel theorems and a Frobenius reciprocity theorem

A method for obtaining Plancherel theorems for unitary representations of Lie groups via C^∞ vector techniques is studied. The results are used to prove the nonunimodular Plancherel theorem of Moore and to study its convergence. A C^∞ Frobenius reciprocity theorem which generalizes Gelfand's duality theorem is also proven.     

A duality theorem for a homogeneous fractional programming problem

The usual theory of duality for linear fractional programs is extended by replacing the linear functions in the numerator and denominator by arbitrary positively homogeneous convex functions. In the constraints, the positive orthant inR ⁿ is replaced by an arbitrary cone. The resultant duality theorem contains a recent result of Chandra and Gulati as a special case.The authors wish to thank the referee for a number of valuable suggestions, particularly improvements in Theorem 3.4 and Corollary 3.1.     

On the Kantorovich–Rubinstein theorem

The Kantorovich–Rubinstein theorem provides a formula for the Wasserstein metric W₁ on the space of regular probability Borel measures on a compact metric space. Dudley and de Acosta generalized the theorem to measures on separable metric spaces. Kellerer, using his own work on Monge–Kantorovich duality, obtained a rapid proof for Radon measures on an arbitrary metric space. The object of the present expository article is to give an account of Kellerer’s generalization of the Kantorovich–Rubinstein theorem, together with related matters. It transpires that a more elementary version of Monge–Kantorovich duality than that used by Kellerer suffices for present purposes. The fundamental relations that provide two characterizations of the Wasserstein metric are obtained directly, without the need for prior demonstration of density or duality theorems. The latter are proved, however, and used in the characterization of optimal measures and functions for the Kantorovich–Rubinstein linear programme. A formula of Dobrushin is proved.     

Sandwich theorem for quasiconvex functions and its applications

In convex programming, sandwich theorem is very important because it is equivalent to Fenchel duality theorem. In this paper, we investigate a sandwich theorem for quasiconvex functions. Also, we consider some applications for quasiconvex programming.     

Duality theorem for the stochastic optimal control problem

We prove a duality theorem for the stochastic optimal control problem with a convex cost function and show that the minimizer satisfies a class of forward–backward stochastic differential equations. As an application, we give an approach, from the duality theorem, to h$h$-path processes for diffusion processes.     

Duality on a nondifferentiable minimax fractional programming

We establish the necessary and sufficient optimality conditions on a nondifferentiable minimax fractional programming problem. Subsequently, applying the optimality conditions, we constitute two dual models: Mond-Weir type and Wolfe type. On these duality types, we prove three duality theorems??weak duality theorem, strong duality theorem, and strict converse duality theorem.     

A new proof of the strong duality theorem for semidefinite programming

Semidefinite programs are convex optimization problems arising in a wide variety of applications and are the extension of linear programming. Most methods for linear programming have been generalized to semidefinite programs. Just as in linear programming, duality theorem plays a basic and an important role in theory as well as in algorithmics. Based on the discretization method and convergence property, this paper proposes a new proof of the strong duality theorem for semidefinite programming, which is different from other common proofs and is more simple.     

Relative formality theorem and quantisation of coisotropic submanifolds

We prove a relative version of Kontsevich's formality theorem. This theorem involves a manifold M and a submanifold C and reduces to Kontsevich's theorem if C=M. It states that the DGLA of multivector fields on an infinitesimal neighbourhood of C is L_∞-quasiisomorphic to the DGLA of multidifferential operators acting on sections of the exterior algebra of the conormal bundle. Applications to the deformation quantisation of coisotropic submanifolds are given. The proof uses a duality transformation to reduce the theorem to a version of Kontsevich's theorem for supermanifolds, which we also discuss. In physical language, the result states that there is a duality between the Poisson sigma model on a manifold with a D-brane and the Poisson sigma model on a supermanifold without branes (or, more properly, with a brane which extends over the whole supermanifold).     

Duality theorem for L-R crossed coproducts

In this paper, the notion of L-R crossed coproduct is introduced as a unified approach for smash coproducts, crossed coproducts and L-R smash coproducts of Hopf algebras. A duality theorem for L-R crossed coproduct is proved.     

A subgradient duality theorem

A duality theorem of P. Wolfe for nonlinear differentiable programming is extended to the nondifferentiable case by replacing gradients by subgradients. The dual pair is further simplified in the case that nondifferentiability enters only in the objective functions and then only through a positively homogeneous convex function. A number of previously studied problems appear as special cases.     

Fenchel duality, Fitzpatrick functions and the Kirszbraun-Valentine extension theorem

We present a new proof of the classical Kirszbraun-Valentine extension theorem. Our proof is based on the Fenchel duality theorem from convex analysis and an analog for nonexpansive mappings of the Fitzpatrick function from monotone operator theory.

     

Quantum systems and representation theorem

In this paper we investigate quantum systems which are locally convex versions of abstract operator systems. Our approach is based on the duality theory for unital quantum cones. We prove the unital bipolar theorem and provide a representation theorem for a quantum system being represented as a quantum $L^{\infty }$ -system.     

The duality theorem between the t-singular homology and the ws-singular cohomology of orbifolds

In the present paper, we prove that for an n-dimensional compact orbifold with an s-homological orientation, the duality of the ws-singular cohomology group and the t-singular homology group holds. The key tools are “the t-modification of the cap product” for giving the duality homomorphism and “the Convex Suborbifold Theorem” for extending the local duality isomorphism to the global one. The duality theorem proved in the present paper is a naturally required consequence of the preceding works of the authors.