Related papers: New enumeration formulas for alternating sign matr…
We explore the problem of approximate matrix multiplication (AMM) within the sliding window model, where algorithms utilize limited space to perform large-scale matrix multiplication in a streaming manner. This model has garnered increasing…
We present a stochastic setting for optimization problems with nonsmooth convex separable objective functions over linear equality constraints. To solve such problems, we propose a stochastic Alternating Direction Method of Multipliers…
In this paper we settle a weak version of a conjecture (i.e. Conjecture 6) by Mills, Robbins and Rumsey in the paper "Self-complementary totally symmetric plane partitions" (J. Combin. Theory Ser. A 42, 277-292). In other words we show that…
In the first part of this study, a convex-constrained penalized formulation was studied for a class of constant modulus (CM) problems. In particular, the error bound techniques were shown to play a vital role in providing exact penalization…
Tensor factorization with hard and/or soft constraints has played an important role in signal processing and data analysis. However, existing algorithms for constrained tensor factorization have two drawbacks: (i) they require…
The study of the partition function in M-theory involves the use of index theory on a twelve-dimensional bounding manifold. In eleven dimensions, viewed as a boundary, this is given by secondary index invariants such as the…
The alternating direction method of multipliers (ADMM) is a powerful splitting algorithm for linearly constrained convex optimization problems. In view of its popularity and applicability, a growing attention is drawn towards the ADMM in…
The weighted projection of an alternating sign matrix (ASM) was introduced by Brualdi and Dahl (2018) as a step towards characterising a generalisation of Latin squares they introduced using alternating sign hypermatrices. If $z_n =…
In this paper, we develop a symmetric accelerated stochastic Alternating Direction Method of Multipliers (SAS-ADMM) for solving separable convex optimization problems with linear constraints. The objective function is the sum of a possibly…
The alternating direction method of multipliers (ADM or ADMM) breaks a complex optimization problem into much simpler subproblems. The ADM algorithms are typically short and easy to implement yet exhibit (nearly) state-of-the-art…
New scalar structure functions with different sign-symmetry properties are defined. These structure functions possess different scaling exponents even when their order is the same. Their scaling properties are investigated for second and…
The Chabauty--Kim method and its refined variant by Betts and Dogra aim to cut out the $S$-integral points $X(\mathbb{Z}_S)$ on a curve inside the $p$-adic points $X(\mathbb{Z}_p)$ by producing enough Coleman functions vanishing on them. We…
We consider the Izergin-Korepin determinant [1] together with another determinant which was invented by Kuperberg [2]. He used these determinants to prove a formula for the total number of half-turn symmetric alternating sign matrices of…
Many biomedical studies collect high-dimensional medical imaging data to identify biomarkers for the detection, diagnosis, and treatment of human diseases. Consequently, it is crucial to develop accurate models that can predict a wide range…
We develop a calculus that gives an elementary approach to enumerate partition-like objects using an infinite upper-triangular number-theoretic matrix. We call this matrix the Partition-Frequency Enumeration (PFE) matrix. This matrix…
We present exact mixed-integer linear programming formulations for verifying the performance of first-order methods for parametric quadratic optimization. We formulate the verification problem as a mixed-integer linear program where the…
We present a stationary iteration method, namely Alternating Symmetric positive definite and Scaled symmetric positive semidefinite Splitting (ASSS), for solving the system of linear equations obtained by using finite element discretization…
An alternating sign matrix is a square matrix satisfying (i) all entries are equal to 1, -1 or 0; (ii) every row and column has sum 1; (iii) in every row and column the non-zero entries alternate in sign. The 8-element group of symmetries…
The paper proves sum-of-square-of-rational-function based representations (shortly, sosrf-based representations) of polynomial matrices that are positive semidefinite on some special sets: $\mathbb{R}^n;$ $\mathbb{R}$ and its intervals…
Affine matrix rank minimization problem is a fundamental problem with a lot of important applications in many fields. It is well known that this problem is combinatorial and NP-hard in general. In this paper, a continuous promoting low rank…