Related papers: A primal-dual formulation for certifiable computat…
We propose a variable metric forward-backward splitting algorithm and prove its convergence in real Hilbert spaces. We then use this framework to derive primal-dual splitting algorithms for solving various classes of monotone inclusions in…
Solving dual quaternion equations is an important issue in many fields such as scientific computing and engineering applications. In this paper, we first introduce a new metric function for dual quaternion matrices. Then, we reformulate…
We prove the Cauchy type identities for the universal double Schubert polynomials, introduced recently by W. Fulton. As a corollary, the determinantal formulae for some specializations of the universal double Schubert polynomials…
Primal-dual algorithms are frequently used for iteratively solving large-scale convex optimization problems. The analysis of such algorithms is usually done on a case-by-case basis, and the resulting guaranteed rates of convergence can be…
Optimization methods are at the core of many problems in signal/image processing, computer vision, and machine learning. For a long time, it has been recognized that looking at the dual of an optimization problem may drastically simplify…
We present an accurate investigation of the algebraic conditions that the symbols of a univariate, binary, Hermite subdivision scheme have to fulfil in order to reproduce polynomials. These conditions are sufficient for the scheme to…
We propose a unifying general (i.e. not assuming the mapping to have any particular structure) view on the theory of regularity and clarify the relationships between the existing primal and dual quantitative sufficient and necessary…
In this paper we study nonconvex and nonsmooth multi-block optimization over Riemannian manifolds with coupled linear constraints. Such optimization problems naturally arise from machine learning, statistical learning, compressive sensing,…
The paper is dedicated to the study of strong duality for a problem of linear copositive programming. Based on the recently introduced concept of the set of normalized immobile indices, an extended dual problem is deduced. The dual problem…
The principle underlying this paper is the basic observation that the problem of simultaneously solving a large class of composite monotone inclusions and their duals can be reduced to that of finding a zero of the sum of a maximally…
Let V be a 2n-dimensional complex symplectic space. Let G' be the Lagrangian Grassmannian of maximal isotropic subspaces of V embedded via the inclusion i into the Grassmannian G of all n-dimensional subspaces of V. We discuss the…
We give formulas for the products of classes of Schubert varieties in the quantum cohomology rings of Grassmannians, in terms of the combinatorics of partitions and tableaux.
We propose a primal-dual splitting algorithm for solving monotone inclusions involving a mixture of sums, linear compositions, and parallel sums of set-valued and Lipschitzian operators. An important feature of the algorithm is that the…
The canonical duality theory has provided with a unified analytic solution to a range of discrete and continuous problems in global optimization, which can transform a nonconvex primal problem to a concave maximization dual problem over a…
We show the equivalence of the Pieri formula for flag manifolds and certain identities among the structure constants, giving new proofs of both the Pieri formula and of these identities. A key step is the association of a symmetric function…
Schur-Weyl duality is a fundamental framework in combinatorial representation theory. It intimately relates the irreducible representations of a group to the irreducible representations of its centralizer algebra. We investigate the analog…
The existing doubling algorithms have been proven efficient for several important nonlinear matrix equations arising from real-world engineering applications. In a nutshell, the algorithms iteratively compute a basis matrix, in one of the…
We give a formula for a birational map on the Schubert cell associated to each Weyl group element of $G=\text{GL}(n)$. The map simplifies the UDL decomposition of matrices, providing structural insight into the Schubert cell decomposition…
Schur-Weyl duality is a ubiquitous tool in quantum information. At its heart is the statement that the space of operators that commute with the tensor powers of all unitaries is spanned by the permutations of the tensor factors. In this…
CLIFFORD performs various computations in Grassmann and Clifford algebras. It can compute with quaternions, octonions, and matrices with entries in Cl(B) - the Clifford algebra of a vector space V endowed with an arbitrary bilinear form B.…