In this paper, we introduce and study a relaxed extragradient method for finding solutions of a general system of variational inequalities with inverse-strongly monotone mappings in a real Hilbert space. First, this system of variational inequalities is proven to be equivalent to a fixed point...

In this paper, we introduce and study a relaxed extragradient method for finding solutions of a general system of variational inequalities with inverse-strongly monotone mappings in a real Hilbert space. First, this system of variational inequalities is proven to be equivalent to a fixed point...

We propose in this paper a fixed parameter polynomial algorithm for the cardinality-constrained quadratic optimization problem, which is NP-hard in general. More specifically, we prove that, given a problem of size n (the number of decision variables) and s (the cardinality), if the n−k...

We focus in this paper the problem of improving the semidefinite programming (SDP) relaxations for the standard quadratic optimization problem (standard QP in short) that concerns with minimizing a quadratic form over a simplex. We first analyze the duality gap between the standard QP and one of...

In this paper we consider cardinality-constrained convex programs that minimize a convex function subject to a cardinality constraint and other linear constraints. This class of problems has found many applications, including portfolio selection, subset selection and compressed sensing. We...