In this paper we take a new look at smoothing Newton methods for solving the nonlinear complementarity problem (NCP) and the box constrained variational inequalities (BVIs). Instead of using anâ€¦ (More)

In this paper we propose an iterative method for calculating the largest eigenvalue of an irreducible nonnegative tensor. This method is an extension of a method of Collatz (1942) for calculating theâ€¦ (More)

We introduce M -tensors. This concept extends the concept ofM -matrices. We denote Z-tensors as the tensors with nonpositive off-diagonal entries. We show that M -tensors must be Ztensors and theâ€¦ (More)

In this paper we present a primal-dual inexact infeasible interior-point algorithm for semidefinite programming problems (SDP). This algorithm allows the use of search directions that are calculatedâ€¦ (More)

We consider the problem of minimizing a sum of Euclidean norms, f(x) = âˆ‘m i=1 â€–biâˆ’ Ai xâ€–. This problem is a nonsmooth problem because f is not differentiable at a point x when one of the norms isâ€¦ (More)

Consider the problem of computing the smallest enclosing ball of a set of m balls in <n. Existing algorithms are known to be inefficient when n > 30. In this paper we develop two algorithms that areâ€¦ (More)

In this paper we consider a class of stochastic linear complementarity problems (SLCPs) with finitely many realizations. We present a feasible semismooth Newton method for this class of SLCPs byâ€¦ (More)

In this paper we propose an iterative method to calculate the largest eigenvalue of a nonnegative tensor. We prove this method converges for any irreducible nonnegative tensor.We also applyâ€¦ (More)