Related papers: The augmented Block Cimmino algorithm revisited
The aim of our paper is to formulate and solve problems concerning multitime multiple recurrence equations. We discuss in detail the generic properties and the existence and uniqueness of solutions. Among the general things, we discuss in…
In this paper we propose a variant of the linear least squares model allowing practitioners to partition the input features into groups of variables that they require to contribute similarly to the final result. The output allows…
Finite linear least squares is one of the core problems of numerical linear algebra, with countless applications across science and engineering. Consequently, there is a rich and ongoing literature on algorithms for solving linear least…
This text highlights issues present in the proof of Lemma 6.10 of the Baumgartner (1943 -- 2011) article "Almost disjoint sets, the dense set problem and the partition calculus" of 1976, and intends to present a correction at the same time…
In this paper, we propose an improved numerical algorithm for solving minimax problems based on nonsmooth optimization, quadratic programming and iterative process. We also provide a rigorous proof of convergence for our algorithm under…
We propose a parallel reconstruction algorithm to solve large scale TV constrained linear inverse problems. We provide a convergence proof and show numerically that our method is significantly faster than the main competitor, block ADMM.
In this paper, we establish some new integral inequalities for $(\alpha, m)-$convex functions and quasi-convex functions, respectively. Our results in special cases recapture known results.
In the present article, we have given a corrigendum to our paper "Some approximation results on Bernstein-Schurer operators defined by (p,q)-integers" published in Journal of In- equalities and Applications (2015) 2015:249.
We introduce the blockwise gluing construction. This describes residuated integral chains which can be decomposed into (possibly) partial algebras, stacked one on top of the other, and such that elements in a certain component multiply in…
In this paper we present a novel algorithm for computing a congruence on an inverse semigroup from a collection of generating pairs. This algorithm uses a myriad of techniques from the theories of groups, automata, and inverse semigroups.…
We propose extensions and improvements of the statistical analysis of distributed multipoles (SADM) algorithm put forth by Chipot et al. in [6] for the derivation of distributed atomic multipoles from the quantum-mechanical electrostatic…
We develop techniques for computing superconformal blocks in 4d superconformal field theories. First we study the super-Casimir differential equation, deriving simple new expressions for superconformal blocks for 4-point functions…
This review is an extended version of the Seoul ICM 2014 proceedings.It is a short overview of the "topological recursion", a relation appearing in the asymptotic expansion of many integrable systems and in enumerative problems. We recall…
We extend the geometrical inverse approximation approach for solving linear least-squares problems. For that we focus on the minimization of $1-\cos(X(A^TA),I)$, where $A$ is a given rectangular coefficient matrix and $X$ is the approximate…
We generalize the quantum Arimoto-Blahut algorithm by Ramakrishnan et al. (IEEE Trans. IT, 67, 946 (2021)) to a function defined over a set of density matrices with linear constraints so that our algorithm can be applied to optimizations of…
In this paper, we propose an incremental algorithm for computing cylindrical algebraic decompositions. The algorithm consists of two parts: computing a complex cylindrical tree and refining this complex tree into a cylindrical tree in real…
The elementary resolution of singularities algorithm of the author's earlier paper (math.CA/0609217) is developed further, replacing the quasibump functions in the blown up coordinates with the characteristic function of a rectangle times a…
Embedding randomization procedures in the Alternating Direction Method of Multipliers (ADMM) has recently attracted an increasing amount of interest as a remedy to the fact that the direct multi-block generalization of ADMM is not…
Solution methods for the minimum sum-of-squares clustering (MSSC) problem are analyzed and developed in this paper. Based on the DCA (Difference-of-Convex functions Algorithms) in DC programming and recently established qualitative…
In this talk we go over several new developments regarding the techniques for a large class of non-hermitian matrix models with unitary randomness (complex random numbers). In particular, we discuss: (a) - A diagrammatic approach based on a…