中文
相关论文

相关论文: Extended Horizontal Tensor Complementarity Problem…

200 篇论文

We consider the problem of low canonical polyadic (CP) rank tensor completion. A completion is a tensor whose entries agree with the observed entries and its rank matches the given CP rank. We analyze the manifold structure corresponding to…

机器学习 · 计算机科学 2017-04-03 Morteza Ashraphijuo , Xiaodong Wang

This survey/expository article covers a variety of topics related to the "topology at infinity" of noncompact manifolds and complexes. In manifold topology and geometric group theory, the most important noncompact spaces are often…

几何拓扑 · 数学 2021-03-02 Craig R. Guilbault

Although a unique solution is guaranteed in the Linear complementarity problem (LCP) when the matrix $\mathbf{M}$ is positive definite, practical applications often involve cases where $\mathbf{M}$ is only positive semi-definite, leading to…

最优化与控制 · 数学 2025-08-11 Jiamin Xu , Nazli Demirer , Vy Pho , He Zhang , Kaixiao Tian , Ketan Bhaidasna , Robert Darbe , Dongmei Chen

This paper concerns the reconstruction of an anisotropic conductivity tensor in an elliptic second-order equation from knowledge of the so-called power density functionals. This problem finds applications in several coupled-physics medical…

偏微分方程分析 · 数学 2013-02-15 Guillaume Bal , Chenxi Guo , Francois Monard

We study multivariate linear tensor product problems with some special properties in the worst case setting. We consider algorithms that use finitely many continuous linear functionals. We use a unified method to investigate tractability of…

数值分析 · 数学 2024-12-20 Rong Guo , Heping Wang

We call a real multi-dimensional array a {\em tensor} for short. In enumerating vertices of the polytopes of stochastic tensors, different approaches have been used: {(1)} Combinatorial method via Latin squares; {(2)} Analytic (topological)…

组合数学 · 数学 2021-11-09 Fuzhen Zhang , Xiao-Dong Zhang

The non-convex quadratic orogramming problem and the non-monotone linear complementarity problem are NP-complete problems. In this paper we first show taht the inverse problem of determinning a KKT point of the non-convex quadratic…

最优化与控制 · 数学 2021-03-30 Siming Huang

In this work, a tensor completion problem is studied, which aims to perfectly recover the tensor from partial observations. The existing theoretical guarantee requires the involved transform to be orthogonal, which hinders its applications.…

机器学习 · 计算机科学 2024-08-16 Li Ge , Lin Chen , Yudong Chen , Xue Jiang

The dispersionless KP hierarchy is considered from the point of view of the twistor formalism. A set of explicit additional symmetries is characterized and its action on the solutions of the twistor equations is studied. A method for…

可精确求解与可积系统 · 物理学 2007-05-23 Luis Martinez Alonso , Manuel Manas

Tensor completion is a problem of filling the missing or unobserved entries of partially observed tensors. Due to the multidimensional character of tensors in describing complex datasets, tensor completion algorithms and their applications…

机器学习 · 统计学 2018-05-04 Qingquan Song , Hancheng Ge , James Caverlee , Xia Hu

Octupolar tensors are third order, completely symmetric and traceless tensors. Whereas in 2D an octupolar tensor has the same symmetries as an equilateral triangle and can ultimately be identified with a vector in the plane, the symmetries…

数学物理 · 物理学 2018-12-24 Giuseppe Gaeta , Epifanio G. Virga

In this paper, firstly we study the continuity of the core-EP inverse without explicit error bounds by virtue of two methods. One is the rank equality, followed from the classical generalized inverse. The other one is matrix decomposition.…

环与代数 · 数学 2018-07-02 Yuefeng Gao , Jianlong Chen , Pedro Patricio

Existing tensor completion formulation mostly relies on partial observations from a single tensor. However, tensors extracted from real-world data are often more complex due to: (i) Partial observation: Only a small subset (e.g., 5%) of…

数值分析 · 数学 2021-06-22 Chaoqi Yang , Navjot Singh , Cao Xiao , Cheng Qian , Edgar Solomonik , Jimeng Sun

The Promise Constraint Satisfaction Problem (PCSP for short) is a generalization of the well-studied Constraint Satisfaction Problem (CSP). The PCSP has its roots in such classic problems as the Approximate Graph Coloring and the…

计算复杂性 · 计算机科学 2025-12-08 Arash Beikmohammadi , Andrei A. Bulatov

Low rank tensor learning, such as tensor completion and multilinear multitask learning, has received much attention in recent years. In this paper, we propose higher order matching pursuit for low rank tensor learning problems with a convex…

机器学习 · 统计学 2015-03-10 Yuning Yang , Siamak Mehrkanoon , Johan A. K. Suykens

In this paper, we firstly construct a weakly coupled Toda lattices with indefinite metrics which consist of $2N$ different coupled Hamiltonian systems. Afterwards, we consider the iso-spectral manifolds of extended tridiagonal Hessenberg…

可精确求解与可积系统 · 物理学 2020-05-07 Jian Li , Chuanzhong Li

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…

计算机视觉与模式识别 · 计算机科学 2023-05-16 Tanmay Kumar Sinha , Jayadev Naram , Pawan Kumar

A charged entanglement entropy is a new measure which probes quantum entanglement between different charge sectors. We study symmetry protected topological (SPT) phases in 2+1 dimensional space-time by using this charged entanglement…

强关联电子 · 物理学 2016-05-11 Shunji Matsuura , Xueda Wen , Ling-Yan Hung , Shinsei Ryu

We study Morse theory on noncompact manifolds equipped with exhaustions by compact pieces, defining the Morse homology of a pair which consists of the manifold and related geometric/homotopy data. We construct a collection of Morse data…

几何拓扑 · 数学 2019-11-12 Taesu Kim

Ehrhart theory is the study of sequences recording the number of integer points in non-negative integral dilates of rational polytopes. For a given lattice polytope, this sequence is encoded in a finite vector called the Ehrhart…

组合数学 · 数学 2017-11-30 Benjamin Braun