اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدB tensors and tensor complementarity problems
279
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, one of our main purposes is to prove the boundedness of solution set of tensor complementarity problem with B tensor such that the specific bounds only depend on the structural properties of tensor. To achieve this purpose, firstly, we present that each B tensor is strictly semi-positive and each B$_0$ tensor is semi-positive. Subsequencely, the strictly lower and upper bounds of different operator norms are given for two positively homogeneous operators defined by B tensor. Finally, with the help of the upper bounds of different operator norms, we show the strcitly lower bound of solution set of tensor complementarity problem with B tensor. Furthermore, the upper bounds of spectral radius and $E$-spectral radius of B (B$_0$) tensor are obtained, respectively, which achieves our another objective. In particular, such the upper bounds only depend on the principal diagonal entries of tensors.
قيم البحث
اقرأ أيضاً
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 positive defin
ite tensors, the nonsingular M-tensors, the nonsingular H-tensors with positive diagonal entries, the strictly diagonally dominant tensors with positive diagonal entries, etc. As even-order symmetric PSD tensors are exactly even-order symmetric P$_0$-tensors, our definition of P$_0$-tensors, to some extent, can be regarded as an extension of PSD tensors for the odd-order case. Along with the basic properties of P- and P$_0$-tensors, the relationship among P$_0$-tensors and other extensions of PSD tensors are then discussed for comparison. Many structured tensors are also shown to be P- and P$_0$-tensors. As a theoretical application, the P-tensor complementarity problem is discussed and shown to possess a nonempty and compact solution set.
In this paper, we propose a discretization scheme for the two-stage stochastic linear complementarity problem (LCP) where the underlying random data are continuously distributed. Under some moderate conditions, we derive qualitative and quantitative
convergence for the solutions obtained from solving the discretized two-stage stochastic LCP (SLCP). We explain how the discretized two-stage SLCP may be solved by the well-known progressive hedging method (PHM). Moreover, we extend the discussion by considering a two-stage distributionally robust LCP (DRLCP) with moment constraints and proposing a discretization scheme for the DRLCP. As an application, we show how the SLCP and DRLCP models can be used to study equilibrium arising from two-stage duopoly game where each player plans to set up its optimal capacity at present with anticipated competition for production in future.
In this article, we introduce a new homotopy function to trace the trajectory by applying modified homotopy continuation method for finding the solution of the Linear Complementarity Problem. Earlier several authors attempted to propose homotopy func
tions based on original problems. We propose the homotopy function based on the Karush-Kuhn-Tucker condition of the corresponding quadratic programming problem of the original problem. The proposed approach extends the processability of the larger class of linear complementarity problems and overcomes the limitations of other existing homotopy approaches. We show that the homotopy path approaching the solution is smooth and bounded. We find the positive tangent direction of the homotopy path. The difficulty of finding a strictly feasible initial point for the interior point algorithm can be replaced appropriately by combining the interior point with the homotopy method. Various classes of numerical examples are illustrated to show the effectiveness of the proposed algorithm.
The error bound property for a solution set defined by a set-valued mapping refers to an inequality that bounds the distance between vectors closed to a solution of the given set by a residual function. The error bound property is a Lipschitz-like/ca
lmness property of the perturbed solution mapping, or equivalently the metric subregularity of the underlining set-valued mapping. It has been proved to be extremely useful in analyzing the convergence of many algorithms for solving optimization problems, as well as serving as a constraint qualification for optimality conditions. In this paper, we study the error bound property for the solution set of a very general second-order cone complementarity problem (SOCCP). We derive some sufficient conditions for error bounds for SOCCP which is verifiable based on the initial problem data.
Hermitian tensors are natural generalizations of Hermitian matrices, while possessing rather different properties. A Hermitian tensor is separable if it has a Hermitian decomposition with only positive coefficients, i.e., it is a sum of rank-1 psd He
rmitian tensors. This paper studies how to detect separability of Hermitian tensors. It is equivalent to the long-standing quantum separability problem in quantum physics, which asks to tell if a given quantum state is entangled or not. We formulate this as a truncated moment problem and then provide a semidefinite relaxation algorithm to solve it. Moreover, we study psd decompositions of separable Hermitian tensors. When the psd rank is low, we first flatten them into cubic order tensors and then apply tensor decomposition methods to compute psd decompositions. We prove that this method works well if the psd rank is low. In computation, this flattening approach can detect separability for much larger sized Hermitian tensors. This method is a good start on determining psd ranks of separable Hermitian tensors.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
