English
Related papers

Related papers: On the Finiteness Property of the Polynomial Compl…

200 papers

We study two modifications of the Post Correspondence Problem (PCP), namely 1) the bi-infinite version, where it is asked whether there exists a bi-infinite word such that two given morphisms agree on it, and 2) the conjugate version, where…

Discrete Mathematics · Computer Science 2022-09-16 Olivier Finkel , Vesa Halava , Tero Harju , Esa Sahla

We introduce a new consistency-based approach for defining and solving nonnegative/positive matrix and tensor completion problems. The novelty of the framework is that instead of artificially making the problem well-posed in the form of an…

Information Retrieval · Computer Science 2023-10-18 Tung Nguyen , Jeffrey Uhlmann

This paper deals with the class of Q-tensors, that is, a Q-tensor is a real tensor $\mathcal{A}$ such that the tensor complementarity problem $(\q, \mathcal{A})$: $$\mbox{ finding } \x \in \mathbb{R}^n\mbox{ such that }\x \geq \0, \q +…

Optimization and Control · Mathematics 2017-01-18 Yisheng Song , Liqun Qi

In this paper, we introduce a unified framework of Tensor Higher-Degree Eigenvalue Complementarity Problem (THDEiCP), which goes beyond the framework of the typical Quadratic Eigenvalue Complementarity Problem (QEiCP) for matrices. First,…

Optimization and Control · Mathematics 2015-07-15 Chen Ling , Hongjin He , Liqun Qi

Nonlinear gradient dynamic approach for solving the tensor complementarity problem (TCP) is presented. Theoretical analysis shows that each of the defined dynamical system models ensures the convergence performance. The computer simulation…

Numerical Analysis · Mathematics 2018-08-13 Xuezhong Wang , Maolin Che , Liqun Qi , Yimin Wei

The Chinese Remainder Theorem for the integers says that every system of congruence equations is solvable as long as the system satisfies an obvious necessary condition. This statement can be generalized in a natural way to arbitrary…

Computational Complexity · Computer Science 2023-07-07 Miguel Campercholi , Diego Castaño , Gonzalo Zigarán

Tensors are multidimensional analogs of matrices. In this paper, based on degree-theoretic ideas, we study homogeneous nonlinear complementarity problems induced by tensors. By specializing this to $Z$-tensors (which are tensors with…

Optimization and Control · Mathematics 2017-01-02 M. Seetharama Gowda , Ziyan Luo , Liqun Qi , Naihua Xiu

In this paper, some results on the existence of n-tuplet fixed points for multi-valued contraction mappings are proved via measure of noncompactness. As an application, the existence of solutions for a system of integral inclusions is…

Functional Analysis · Mathematics 2020-02-04 Derya Sekman , Nour El Houda Bouzara , Vatan Karakaya

Let $\MP_d$ denote the space of polynomials $f: \C \to \C$ of degree $d\geq 2$, modulo conjugation by $\Aut(\C)$. Using properties of polynomial trees (as introduced in [DM, math.DS/0608759]), we show that if $f_n$ is a divergent sequence…

Dynamical Systems · Mathematics 2007-05-23 Laura DeMarco

The concepts of P- and P$_0$-matrices are generalized to P- and P$_0$-tensors of even and odd orders via homogeneous formulae. Analog to the matrix case, our P-tensor definition encompasses many important classes of tensors such as the…

Spectral Theory · Mathematics 2015-07-27 Weiyang Ding , Ziyan Luo , Liqun Qi

The purpose of this article is to examine and limit the conditions in which the P complexity class could be equivalent to the NP complexity class. Proof is provided by demonstrating that as the number of clauses in a NP-complete problem…

Computational Complexity · Computer Science 2008-09-07 Jerrald Meek

Finding the sparsest solutions to a tensor complementarity problem is generally NP-hard due to the nonconvexity and noncontinuity of the involved $\ell_0$ norm. In this paper, a special type of tensor complementarity problems with…

Spectral Theory · Mathematics 2015-05-06 Ziyan Luo , Liqun Qi , Naihua Xiu

It is worth knowing that a particular tensor class belongs to $P$-tensor which ensures the compactness to solve tensor complementarity problem (TCP). In this study, we propose a new class of tensor, Nekrasov $Z$ tensor, in the context of…

Optimization and Control · Mathematics 2022-12-29 R. Deb , A. K. Das

We investigate the fundamental conditions on the sampling pattern, i.e., locations of the sampled entries, for finite completability of a low-rank tensor given some components of its Tucker rank. In order to find the deterministic necessary…

Numerical Analysis · Computer Science 2019-05-13 Morteza Ashraphijuo , Vaneet Aggarwal , Xiaodong Wang

The problem of Knowledge Base Completion can be framed as a 3rd-order binary tensor completion problem. In this light, the Canonical Tensor Decomposition (CP) (Hitchcock, 1927) seems like a natural solution; however, current implementations…

Machine Learning · Statistics 2018-06-20 Timothée Lacroix , Nicolas Usunier , Guillaume Obozinski

This paper is concerned with solving some structured multi-linear systems, which are called tensor absolute value equations. This kind of absolute value equations is closely related to tensor complementarity problems and is a generalization…

Numerical Analysis · Mathematics 2017-05-19 Shouqiang Du , Liping Zhang , Chiyu Chen , Liqun Qi

Recent approaches to the tensor completion problem have often overlooked the nonnegative structure of the data. We consider the problem of learning a nonnegative low-rank tensor, and using duality theory, we propose a novel factorization of…

Computer Vision and Pattern Recognition · Computer Science 2023-05-16 Tanmay Kumar Sinha , Jayadev Naram , Pawan Kumar

In this paper we discuss the notion of singular vector tuples of a complex valued $d$-mode tensor of dimension m_1 x ... x m_d. We show that a generic tensor has a finite number of singular vector tuples, viewed as points in the…

Algebraic Geometry · Mathematics 2013-11-11 Shmuel Friedland , Giorgio Ottaviani

In this paper, we consider the tensor eigenvalue complementarity problem which is closely related to the optimality conditions for polynomial optimization, as well as a class of differential inclusions with nonconvex processes. By…

Optimization and Control · Mathematics 2015-10-30 Zhongming Chen , Liqun Qi

This work studies the combinatorial optimization problem of finding an optimal core tensor shape, also called multilinear rank, for a size-constrained Tucker decomposition. We give an algorithm with provable approximation guarantees for its…

Data Structures and Algorithms · Computer Science 2024-06-19 Mehrdad Ghadiri , Matthew Fahrbach , Gang Fu , Vahab Mirrokni