相关论文: A Remark on the Manhattan Distance Matrix of a Rec…

The quadratic minimum spanning tree problem (QMSTP) is the problem of finding a spanning tree of a graph such that the total interaction cost between pairs of edges in the tree is minimized. We first show that most of the bounding…

We propose an SQP algorithm for mathematical programs with vanishing constraints which solves at each iteration a quadratic program with linear vanishing constraints. The algorithm is based on the newly developed concept of $\mathcal…

We revisit and strengthen splitting methods for solving doubly nonnegative, DNN, relaxations of the quadratic assignment problem, QAP. We use a modified restricted contractive splitting method, PRSM, approach. Our strengthened bounds and…

We comment on two randomized algorithms for constructing low-rank matrix decompositions. Both algorithms employ the Subsampled Randomized Hadamard Transform [14]. The first algorithm appeared recently in [9]; here, we provide a novel…

In several multiobjective decision problems Pairwise Comparison Matrices (PCM) are applied to evaluate the decision variants. The problem that arises very often is the inconsistency of a given PCM. In such a situation it is important to…

Crossing minimization is one of the central problems in graph drawing. Recently, there has been an increased interest in the problem of minimizing crossings between paths in drawings of graphs. This is the metro-line crossing minimization…

Let $X=X(n,q)$ be the set of $n\times n$ Hermitian matrices over $\mathbb{F}_{q^2}$. It is well known that $X$ gives rise to a metric translation association scheme whose classes are induced by the rank metric. We study $d$-codes in this…

A rigidity theory is developed for frameworks in a metric space with two types of distance constraints. Mixed sparsity graph characterisations are obtained for the infinitesimal and continuous rigidity of completely regular bar-joint…

Consider an $n \times n$ matrix polynomial $P(\lambda)$. A spectral norm distance from $P(\lambda)$ to the set of $n \times n$ matrix polynomials that have a given scalar $\mu\in\mathbb{C}$ as a multiple eigenvalue was introduced and…

Recently, deep learning based methods have demonstrated promising results on the graph matching problem, by relying on the descriptive capability of deep features extracted on graph nodes. However, one main limitation with existing deep…

Determining the Shannon capacity of graphs is a long-standing open problem in information theory, graph theory and combinatorial optimization. Over decades, a wide range of upper and lower bound methods have been developed to analyze this…

In this paper, we consider the problem of computing the nearest stable matrix to an unstable one. We propose new algorithms to solve this problem based on a reformulation using linear dissipative Hamiltonian systems: we show that a matrix…

Let $D(G)$ denote the distance matrix of a connected graph $G$ with $n$ vertices. The distance spectral gap of a graph $G$ is defined as $\delta_{D^G} = \rho_1 - \rho_2$, where $\rho_1$ and $\rho_2$ represent the largest and second largest…

An equivalence between attainability of simultaneous diagonalization (SD) and hidden convexity in quadratically constrained quadratic programming (QCQP) stimulates us to investigate necessary and sufficient SD conditions, which is one of…

We study several versions of the alternating direction method of multipliers (ADMM) for solving the convex problem of finding the distance between two ellipsoids and the nonconvex problem of finding the distance between the boundaries of…

The (unweighted) point-separation problem asks, given a pair of points $s$ and $t$ in the plane, and a set of candidate geometric objects, for the minimum-size subset of objects whose union blocks all paths from $s$ to $t$. Recent work has…

Probabilistic analysis for metric optimization problems has mostly been conducted on random Euclidean instances, but little is known about metric instances drawn from distributions other than the Euclidean. This motivates our study of…

Recently, many graph matching methods that incorporate pairwise constraint and that can be formulated as a quadratic assignment problem (QAP) have been proposed. Although these methods demonstrate promising results for the graph matching…

We consider an optimization problem posed by an actual newspaper company, which consists of computing a minimum length route for a delivery truck, such that the driver only stops at street crossings, each time delivering copies to all…

Geometry and topology have generated impacts far beyond their pure mathematical primitive, providing a solid foundation for many applicable tools. Typically, real-world data are represented as vectors, forming a linear subspace for a given…