Knowledge graphs have been demonstrated to be an effective tool for numerous intelligent applications. However, a large amount of valuable knowledge still exists implicitly in the graphs. To enrich existing graphs, recent years witnessed that many algorithms link prediction and embedding designed infer new facts. But most these studies focus on static ignore temporal information which reflects ...

In this paper, we establish strong complementary approximate Karush- Kuhn-Tucker (SCAKKT) sequential optimality conditions for multiobjective optimization problems with equality and inequality constraints without any constraint qualifications introduce a weak qualification which assures the equivalence between SCAKKT Karush-Kuhn-Tucker (J Optim Theory Appl 80 (3): 483-500, 1994) problems.

A relation between coprlme fractions and the gap metric is presented. USlng this result we provlde some sufficient condi Hons for BIBO robust stabll1za tion for a very wlde class of systems. These conditions allow the plant and compensator to be disturbed simutaneously. K.e.Y words: Robust stabllization; Gap metric; Coprime fraction.

A state-defect constraint pairing graph coarsening method is described for improving computational efficiency during the numerical factorization of large sparse Karush–Kuhn–Tucker matrices that arise from the discretization of optimal control problems via an Legendre–Gauss–Radau orthogonal collocation method. The method takes advantage of the particular sparse structure of the Karush–Kuhn–Tucke...

The tensor-structured methods developed recently for the accurate calculation of the Hartree and the non-local exchange operators have been applied successfully to the ab initio numerical solution of the Hartree-Fock equation for some molecules. In the present work, we show that the rank-structured representation can be gainfully applied to the accurate approximation of the electron density of ...