Local linear convergence analysis of Primal–Dual splitting methods

In this paper, we study the local linear convergence properties of a versatile class of Primal–Dual splitting methods for minimizing composite non-smooth convex optimization problems. Under the assumption that the non-smooth components of the problem are partly smooth relative to smooth manifolds, we present a unified local convergence analysis framework for these methods. More precisely, in our framework, we first show that (i) the sequences generated by Primal–Dual splitting methods identify a pair of primal and dual smooth manifolds in a finite number of iterations, and then (ii) enter a local linear convergence regime, which is characterized based on the structure of the underlying active smooth manifolds. We also show how our results for Primal–Dual splitting can be specialized to cover existing ones on Forward–Backward splitting and Douglas–Rachford splitting/ADMM (alternating direction methods of multipliers). Moreover, based on these obtained local convergence analysis result, several practical acceleration techniques are discussed. To exemplify the usefulness of the obtained result, we consider several concrete numerical experiments arising from fields including signal/image processing, inverse problems and machine learning. The demonstration not only verifies the local linear convergence behaviour of Primal–Dual splitting methods, but also the insights on how to accelerate them in practice.     

Robust linear optimization under general norms

We explicitly characterize the robust counterpart of a linear programming problem with uncertainty set described by an arbitrary norm. Our approach encompasses several approaches from the literature and provides guarantees for constraint violation under probabilistic models that allow arbitrary dependencies in the distribution of the uncertain coefficients.     

Modules over Operator Algebras and Its Module Maps

ＭｏｄｕｌｅｓｏｖｅｒＯｐｅｒａｔｏｒＡｌｇｅｂｒａｓａｎｄＩｔｓＭｏｄｕｌｅＭａｐｓＸｕＴｉａｎｚｈｏｕ（许天周）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＮａｎｊｉｎｇＵｎｉｅｒｓｉｔｙ，Ｎａｎｊｉｎｇ，２１００９３）ＡｂｓｔｒａｃｔＬｅ...     

Dual Characterizations of Set Containments with Strict Convex Inequalities

Characterizations of the containment of a convex set either in an arbitrary convex set or in the complement of a finite union of convex sets (i.e., the set, described by reverse-convex inequalities) are given. These characterizations provide ways of verifying the containments either by comparing their corresponding dual cones or by checking the consistency of suitable associated systems. The convex sets considered in this paper are the solution sets of an arbitrary number of convex inequalities, which can be either weak or strict inequalities. Particular cases of dual characterizations of set containments have played key roles in solving large scale knowledge-based data classification problems where they are used to describe the containments as inequality constraints in optimization problems. The idea of evenly convex set (intersection of open half spaces), which was introduced by W. Fenchel in 1952, is used to derive the dual conditions, characterizing the set containments.     

Dual frames in connected with generalized sampling in shift-invariant spaces

The aim of this article is to derive stable generalized sampling in a shift-invariant space by using some special dual frames in L²(0,1). These sampling formulas involve samples of filtered versions of the functions in the shift-invariant space. The involved samples are expressed as the frame coefficients of an appropriate function in L²(0,1) with respect to some particular frame in L²(0,1). Since any shift-invariant space with stable generator is the image of L²(0,1) by means of a bounded invertible operator, our generalized sampling is derived from some dual frame expansions in L²(0,1).     

Urn模型的B网及其应用

Urn模型的离散概率分布被用于构造逼近格式,具有Bernstein多项式的许多特性。本文用B网技术对Urn模型概率分布给出新的解释,指出了Urn模型B网的诸多性质,导出分布函数曲线的导数公式,构造了Urn分布的对偶基及与此相关的拟插值算子。     

Eigenvalue problem for arbitrary linear combinations of a boson annihilation and creation operator

The eigenvalue problem for arbitrary linear combinations kα + μα^? of a boson annihilation operator α and a boson creation operator α^? is solved. It is shown that these operators possess nondegenerate eigenstates to arbitrary complex eigenvalues. The expansion of these eigenstates into the basic set of number states | n >, (n = 0, 1, 2, …), is found. The eigenstates are normalizable and are therefore states of a Hilbert space for | ζ | < 1 with ζ ? μ/k and represent in this case squeezed coherent states of minimal uncertainty product. They can be considered as states of a rigged Hilbert space for | ζ | ? 1. A completeness relation for these states is derived that generalizes the completeness relation for the coherent states | α 〉. Furthermore, it is shown that there exists a dual orthogonality in the entire set of these states and a connected dual completeness of the eigenstates on widely arbitrary paths over the complex plane of eigenvalues. This duality goes over into a selfduality of the eigenstates of the hermitian operators kα + k* α^? to real eigenvalues. The usually as nonexistent considered eigenstates of the boson creation operator α^? are obtained by a limiting procedure. They belong to the most singular case among the considered general class of eigenstates with ζ ? μ/k as a parameter.     

WEAK CONVERGENCE OF HENSTOCK INTEGRABLE SEQUENCES

Some relationships between pointwise and weak convergence of a sequence of Henstock integrable functions are studied, In particular it is provided an example of a sequence of Henstock integrable functions whose pointwise limit is different from the weak one. By introducing an asymptotic version of the Henstock equiintegrability notion it is given a necessary and sufficient condition in order that a pointwisely convergent sequence of Henstock integrable functions is weakly convergent to its pointwise limit.     

Dual Si-H effects in platinum-catalyzed silane reduction of carboxamides leading to a practical synthetic process of tertiary-amines involving self-encapsulation of the catalyst species into the insoluble silicone resin formed

Combination of commercially available platinum catalysts with siloxanes containing more than two Si-H groups is found to be an efficient catalyst system for the reduction of carboxamides to amines. In particular, facile removal of silicon and platinum residues from the product can be achieved by the use of polymethylhydrosiloxanes as reducing reagents.