Related papers: The augmented Block Cimmino algorithm revisited
Block majorization-minimization (BMM) is a simple iterative algorithm for nonconvex optimization that sequentially minimizes a majorizing surrogate of the objective function in each block coordinate while the other block coordinates are…
To find the least squares solution of a very large and inconsistent system of equations, one can employ the extended Kaczmarz algorithm. This method simultaneously removes the error term, such that a consistent system is asymptotically…
The Restricted Assignment Problem is a prominent special case of Scheduling on Parallel Unrelated Machines. For the strongest known linear programming relaxation, the configuration LP, we improve the non-constructive bound on its…
In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…
The paper first recalls the Blahut Arimoto algorithm for computing the capacity of arbitrary discrete memoryless channels, as an example of an iterative algorithm working with probability density estimates. Then, a geometrical…
In this note we present a refinement of the AM-GM inequality, and then we estimate in a special case the typical size of the improvement.
We study Hamamoto's expanding square argument towards a 1-D minimisation problem related to the sharp solenoidal uncertainty principle. Working in the right function space, we recast the involved interpolation type inequality into an exact…
In the present article, we have given a corrigendum to our paper ``On (p,q)-analogue of Bernstein operators" published in Applied Mathematics and Computation 266 (2015) 874-882.
We investigate the techniques and ideas used in the convergence analysis of two proximal ADMM algorithms for solving convex optimization problems involving compositions with linear operators. Besides this, we formulate a variant of the ADMM…
We present a generalized formulation for reweighted least squares approximations. The goal of this article is twofold: firstly, to prove that the solution of such problem can be expressed as a convex combination of certain interpolants when…
We construct explicit easily implementable polynomial approximations of sufficiently high accuracy for locally constant functions on the union of disjoint segments. This problem has important applications in several areas of numerical…
Using determinant representations for partition functions of the corresponding square ice models and the method proposed recently by one of the authors, we investigate refined enumerations of vertically symmetric alternating-sign matrices,…
We present a new structure theorem for finite fields of odd order that relates multiplicative and additive structure in an interesting way. This theorem has several applications, including an improved understanding of Dickson and Chebyshev…
We have introduced q-analogues of bounded symmetric domains in our work q-alg/9703005. Given the simplest ones among those, the works q-alg/9603012 and math.QA/9803110 announce the relations describing the algebras of functions,…
In this article, we provide a new algorithm for solving constraint satisfaction problems over templates with few subpowers, by reducing the problem to the combination of solvability of a polynomial number of systems of linear equations over…
We show that the computational effort for the numerical solution of fermionic quantum systems, occurring e.g., in quantum chemistry, solid state physics, field theory in principle grows with less than the square of the particle number for…
The main purpose of this paper is to englobe some new and known types of Hermitian block-matrices $M=\begin{pmatrix} A \& X\\ {X^*} \& B\end{pmatrix}$ satisfying or not the inequality $\|M\|\le \|A+B\|$ for all symmetric norms
This is an expanded and updated version of the talk I gave at the meeting organized at CERN on April 27-28, 2015 dedicated to honoring the memory of Bruno Zumino and his legacy. In this talk I review the emergence of exceptional structures…
The alternating direction method of multipliers (ADMM) proposed by Glowinski and Marrocco is a benchmark algorithm for two-block separable convex optimization problems with linear equality constraints. It has been modified, specified, and…
We provide a commentary on Teichm{\"u}ller's paper "Extremale quasikonforme Abbildungen und quadratische Differentiale" (Extremal quasiconformal mappings of closed oriented Riemann surfaces), Abh. Preuss. Akad. Wiss., Math.-Naturw. Kl.…