Understanding linear semi-infinite programming via linear programming over cones

In this article, the standard primal and dual linear semi-infinite programming (DLSIP) problems are reformulated as linear programming (LP) problems over cones. Therefore, the dual formulation via the minimal cone approach, which results in zero duality gap for the primal–dual pair for LP problems over cones, can be applied to linear semi-infinite programming (LSIP) problems. Results on the geometry of the set of the feasible solutions for the primal LSIP problem and the optimality criteria for the DLSIP problem are also discussed.     

A New and Self-Contained Proof of Borwein’s Norm Duality Theorem

Borwein’s norm duality theorem establishes the equality between the outer (inner) norm of a sublinear mapping and the inner (outer) norm of its adjoint mappings. In this note we provide an extended version of this theorem with a new and self-contained proof relying only on the Hahn-Banach theorem. We also give examples showing that the assumptions of the theorem cannot be relaxed. This author is supported by Grant BES-2003-0188 from FPI Program of MEC (Spain).     

Decomposition in global optimization

The purpose of this article is to propose a simple framework for the various decomposition schemes in mathematical programming.Special instances are discussed. Particular attention is devoted to the general mathematical programming problem with two sets of variables. An economic interpretation in the context of hierarchical planning is done for the suggested decomposition procedure.The framework is based on general duality theory in mathematical programming and thus focussing on approaches leading to global optimality.     

A Note on Error Bounds for Convex and Nonconvex Programs

Given a single feasible solution and a single infeasible solution of a mathematical program, we provide an upper bound to the optimal dual value. We assume that satisfies a weakened form of the Slater condition. We apply the bound to convex programs and we discuss its relation to Hoffman-like bounds. As a special case, we recover a bound due to Mangasarian [11] on the distance of a point to a convex set specified by inequalities.     

Cyclic Cohomology of étale Groupoids: The General Case

We give a general method for computing the cyclic cohomology of crossed products by étale groupoids, extending the Feigin–Tsygan–Nistor spectral sequences. In particular we extend the computations performed by Brylinski, Burghelea, Connes, Feigin, Karoubi, Nistor, and Tsygan for the convolution algebra C _c (G) of an étale groupoid, removing the Hausdorffness condition and including the computation of hyperbolic components. Examples like group actions on manifolds and foliations are considered.     

Deriving the Properties of Linear Bilevel Programming via a Penalty Function Approach

For the linear bilevel programming problem, we propose an assumption weaker than existing assumptions, while achieving similar results via a penalty function approach. The results include: equivalence between (i) existence of a solution to the problem, (ii) existence of an exact penalty function approach for solving the problem, and (iii) achievement of the optimal value of the equivalent form of the problem at some vertex of a certain polyhedral convex set. We prove that the assumption is both necessary and sufficient for the linear bilevel programming problem to admit an exact penalty function formulation, provided that the equivalent form of the problem has a feasible solution. A method is given for computing the minimal penalty function parameter value. This method can be executed by solving a set of linear programming problems. Lagrangian duality is also presented.     

A Duality Theorem for Étale p-Torsion Sheaves on Complete Varieties over a Finite Field

Let X be an arbitrary variety over a finite field k and p=char k,n N. We will construct a complex of étale sheaves on X together with trace isomorphism from the highest étale cohomology group of this complex onto Z/pⁿZ such that for every constructible Z/pⁿZ-sheaf on X the Yoneda pairing is a nondegenerate pairing of finite groups. If X is smooth, this complex is the Gersten resolution of the logarithmic de Rham–Witt sheaf introduced by Gros and Suwa. The proof is based on the special case proven by Milne when the sheaf is constant and X is smooth, as well as on a purity theorem which in turn follows from a theorem about the cohomological dimension of C_i-fields due to Kato and Kuzumaki. If the existence of the Lichtenbaum complex is proven, the theorem will be the p-part of a general duality theorem for varieties over finite fields.     

On Linear Programming Duality and Necessary and Sufficient Conditions in Minimax Theory

In this paper we discuss necessary and sufficient conditions for different minimax results to hold using only linear programming duality and the finite intersection property for compact sets. It turns out that these necessary and sufficient conditions have a clear interpretation within zero-sum game theory. We apply these results to derive necessary and sufficient conditions for strong duality for a general class of optimization problems. The authors like to thank the comments of the anonymous referees for their remarks, which greatly improved the presentation of this paper.