Add to ORKGWe analyse the efficiency of a class of iterative methods for solving large scale convex quadratic programs. These methods, known as splitting methods and projection methods, require to solve a sequence of easy strictly convex quadratic programming subproblems obtained by splitting the matrix of the objective function. We describe in details the techniques used for generating the large and sparse test problems on which the computational behaviour of the methods is studied
Many problems arising in data analysis can be formulated as a large sparse strictly convex quadratic...
We consider the solution of large and sparse linearly constrained quadratic programming problems by ...
We consider the solution of large and sparse linearly constrained quadratic programming problems by ...
We analyse the efficiency of a class of iterative methods for solving large scale convex quadratic p...
In this paper we analyse the behaviour of the classical splitting and projection methods for solving...
In this paper we analyse the behaviour of the classical splitting and projection methods for solving...
A well-known approach to the solution of large and sparse linearly constrained quadratic programming...
A well-known approach to the solution of large and sparse linearly constrained quadratic programming...
A well-known approach for solving large and sparse linearly constrained quadratic programming (QP) p...
A well-known approach for solving large and sparse linearly constrained quadratic programming (QP) p...
In this paper, we propose a modified projection-type method for solving strictly-convex quadratic pr...
We describe a method for solving large-scale general quadratic programming problems. Our method is b...
We consider the solution of large and sparse linearly constrained quadratic programming problems. We...
We consider the solution of large and sparse linearly constrained quadratic programming problems. We...
Many problems arising in data analysis can be formulated as a large sparse strictly convex quadratic...
Many problems arising in data analysis can be formulated as a large sparse strictly convex quadratic...
We consider the solution of large and sparse linearly constrained quadratic programming problems by ...
We consider the solution of large and sparse linearly constrained quadratic programming problems by ...
We analyse the efficiency of a class of iterative methods for solving large scale convex quadratic p...
In this paper we analyse the behaviour of the classical splitting and projection methods for solving...
In this paper we analyse the behaviour of the classical splitting and projection methods for solving...
A well-known approach to the solution of large and sparse linearly constrained quadratic programming...
A well-known approach to the solution of large and sparse linearly constrained quadratic programming...
A well-known approach for solving large and sparse linearly constrained quadratic programming (QP) p...
A well-known approach for solving large and sparse linearly constrained quadratic programming (QP) p...
In this paper, we propose a modified projection-type method for solving strictly-convex quadratic pr...
We describe a method for solving large-scale general quadratic programming problems. Our method is b...
We consider the solution of large and sparse linearly constrained quadratic programming problems. We...
We consider the solution of large and sparse linearly constrained quadratic programming problems. We...
Many problems arising in data analysis can be formulated as a large sparse strictly convex quadratic...
Many problems arising in data analysis can be formulated as a large sparse strictly convex quadratic...
We consider the solution of large and sparse linearly constrained quadratic programming problems by ...
We consider the solution of large and sparse linearly constrained quadratic programming problems by ...