A class of convergent primal-dual subgradient algorithms for decomposable convex programs

In this paper we develop a primal-dual subgradient algorithm for preferably decomposable, generally nondifferentiable, convex programming problems, under usual regularity conditions. The algorithm employs a Lagrangian dual function along with a suitable penalty function which satisfies a specified set of properties, in order to generate a sequence of primal and dual iterates for which some subsequence converges to a pair of primal-dual optimal solutions. Several classical types of penalty functions are shown to satisfy these specified properties. A geometric convergence rate is established for the algorithm under some additional assumptions. This approach has three principal advantages. Firstly, both primal and dual solutions are available which prove to be useful in several contexts. Secondly, the choice of step sizes, which plays an important role in subgradient optimization, is guided more determinably in this method via primal and dual information. Thirdly, typical subgradient algorithms suffer from the lack of an appropriate stopping criterion, and so the quality of the solution obtained after a finite number of steps is usually unknown. In contrast, by using the primal-dual gap, the proposed algorithm possesses a natural stopping criterion.     

Structure of T Modules and Restricted Duals: The Classical and the Quantum Case

Abstract

A concrete realization of Enright's T modules is obtained. This is used to show their self-duality. As a consequence, the restricted duals of Verma modules are also identified.     

On general frame decompositions

We provide a characterization and construction of general frame decompositions. We show that generating all duals for a given frame amounts to finding left inverses of an one-to-one mapping. A general parametric and algebraic formula for all duals is derived. An application of the theory to Weyl-Heisenberg (WH) frames is discussed. Besides the (usual) dual frame that preserves the translation and modulation structure, we construct a class of duals that attain such a structure. We also show constructively that there are duals to WH frames which are not the translation and modulation of a single function.     

Non-simply connected copes

Let (W⁴,?W⁴) be a 4-manifold. Let f₁,f₂,…,f_k:(D²,?D²)→ (W⁴,?W⁴) be transverse immersions that have spherical duals $\text{α}{}_1\text{,α}{}_2\text{,…,α}{}_{\mathrm{k}}\text{:S}{}^2\text{→}\text{W}\text{?}$. Then there are open disjoint subsets V₁, V₂,…,V_k of W, such that for each 1?i?k, (a) ?V_i=V₁∩?W and ?V_i is an open regular neighborhood of f_i(?D²) in ?W, and (b) (V_i,?V_i,f_i(?D²)) is proper homotopy equivalent to (M, ?M, d)—a standard object in which d bounds an embedded flat disk. If we could get a homeomorphism instead of a proper homotopy equivalence, then we would be able to prove a 5-dimensional s-cobordism theorem.     

On Some New Generalized Difference Sequence Spaces

Let (x) = A(x) , where A(x) denotes the number of square-full integers not exceeding x. In this paper, we prove that (x) = O , which improves the exponent 4/27 obtained by Y.-C. Cai [5].     

On hypercomplexifying real forms of arbitrary rank

For certain problems involving vector fields, it is possible to find an associated imaginary field that, in conjunction with the first, forms a complex field for which the equation can be solved. This result is generalized to arbitrary Clifford algebras, followed by quaternionic vectors as a special case. All results are shown to reduce to the established method of complexifying vector fields. For simplicity, differential forms are used rather than vector notation.