Related papers: A continuation method for tensor complementarity p…
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…
Let X be a smooth projective Berkovich space over a complete discrete valuation field K of residue characteristic zero, and assume that X is defined over a function field admitting K as a completion. Let further m be a positive measure on X…
We consider optimization problems that are formulated and solved in the framework of tropical mathematics. The problems consist in minimizing or maximizing functionals defined on vectors of finite-dimensional semimodules over idempotent…
We propose in this work a subgradient extragradient method with inertial and correction terms for solving equilibrium problems in a real Hilbert space. We obtain that the sequence generated by our proposed method converges weakly to a point…
Resummation methods using continued functions are implemented to converge divergent series appearing in perturbation problems related to continuous phase transitions in field theories. In some cases, better convergence properties are…
One of the central problems in the theory of linear complementarity problems (LCPs) is to study the class of $Q$-matrices since it characterizes the solvability of LCP. Recently, the concept of $Q$-matrix has been extended to the case of…
We consider the problem of tensor estimation from noisy observations with possibly missing entries. A nonparametric approach to tensor completion is developed based on a new model which we coin as sign representable tensors. The model…
The main purpose of this paper is devoted to an introduction of the stochastic tensor complementarity problem. We consider the expected residual minimization formulation of the stochastic tensor complementarity problem. We show that the…
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…
In this paper, we present and analyze methods for solving a system of linear equations over idempotent semifields. The first method is based on the pseudo-inverse of the system matrix. We then present a specific version of Cramer's rule…
We prove a generalization of the Fujita-Kawamata-Zuo semi-positivity Theorem for filtered regular meromorphic Higgs bundles and tame harmonic bundles. Our approach gives a new proof in the cases already considered by these authors. We give…
We propose an algorithm for solving bound-constrained mathematical programs with complementarity constraints on the variables. Each iteration of the algorithm involves solving a linear program with complementarity constraints in order to…
In this manuscript, we introduce the tensor-train reduced basis method, a novel projection-based reduced-order model designed for the efficient solution of parameterized partial differential equations. While reduced-order models are widely…
A class of backward doubly stochastic differential equations (BDSDEs in short) with continuous coefficients is studied. We give the comparison theorems, the existence of the maximal solution and the structure of solutions for BDSDEs with…
We describe, study, and experiment with an algorithm for finding all solutions of systems of polynomial equations using homotopy continuation and monodromy. This algorithm follows a framework developed in previous work and can operate in…
Optimization has been widely used to generate smooth trajectories for motion planning. However, existing trajectory optimization methods show weakness when dealing with large-scale long trajectories. Recent advances in parallel computing…
Tensor factorization has proven useful in a wide range of applications, from sensor array processing to communications, speech and audio signal processing, and machine learning. With few recent exceptions, all tensor factorization…
We develop a systematic way to solve linear equations involving tensors of arbitrary rank. We start off with the case of a rank $3$ tensor, which appears in many applications, and after finding the condition for a unique solution we derive…
In this article, we establish an $L^2$ extension theorem for Nakano semi-positive singular Hermitian metrics on holomorphic vector bundles, and the strong openness and stability properties of the multiplier submodule sheaves associated to…
In this paper, we study local convergence of high-order Tensor Methods for solving convex optimization problems with composite objective. We justify local superlinear convergence under the assumption of uniform convexity of the smooth…