Tensor decomposition is an important problem with many applications across several disciplines, and a popular approach for this problem is the tensor power method. However, previous works with theoretical guarantee based on this approach can only find the top eigenvectors one after one, unlike the case for matrices. In this paper, we show how to find the eigenvectors simultaneously with the hel...

0377-2217/$ see front matter 2010 Elsevier B.V. A doi:10.1016/j.ejor.2010.09.009 ⇑ Tel.: +1 781 861 6279. E-mail address: [email protected] We propose and develop an efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems. The traditional implementation of the heuristic applicable to all quadratic assignment problems is of O(N) complexity per iteration ...

We consider a multi-armed bandit problem where payoffs are a linear function of an observed stochastic contextual variable. In the scenario where there exists a gap between optimal and suboptimal rewards, several algorithms have been proposed that achieve O(log T ) regret after T time steps. However, proposed methods either have a computation complexity per iteration that scales linearly with T...

Iteration method is commonly used in solving linear systems of equations. We present quantum algorithms for the relaxed row and column iteration methods by constructing unitary matrices iterative processes, which generalize to solve on a computer. Comparing with conventional methods, convergence accelerates when appropriate parameters are chosen. Once states efficiently prepared, complexity our...

Exploring Complexity of Large Update Interior-Point Methods for ) k ( P* Linear Complementarity Problems Based on Kernel Function KEYVAN AMINI* M.REZA PEYGHAMI +,2 ∗ Department of Sciences, Razi University, Kermanshah, Iran + Department of Sciences, Khajeh Nasir Toosi (KNT) University of Technology, Tehran, Iran Abstract. Interior Point Methods not only are the most effective methods in practic...

Abstract Motivated by Pryce’s structural index reduction method for differential algebraic equations (DAEs), we give a complete theoretical analysis about existence and uniqueness of the optimal solution of index reduction problem, and then show the termination and complexity of the fixed-point iteration algorithm. Based on block upper triangular structure of system, we propose the block fixed-...

This paper presents a proximal bundle variant, namely, the relaxed (RPB) method, for solving convex nonsmooth composite optimization problems. Like other variants, R...