A splitting method for quadratic programming problem
From MaRDI portal
Publication:5949529
DOI10.1007/BF02677381zbMath1007.90044MaRDI QIDQ5949529
Publication date: 21 November 2001
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- More results on the convergence of iterative methods for the symmetric linear complementarity problem
- On affine scaling algorithms for nonconvex quadratic programming
- Solution of symmetric linear complementarity problems by iterative methods
- On the convergence of iterative methods for symmetric linear complementarity problems
- An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming
- The Numerical Solution of Equality-Constrained Quadratic Programming Problems
- On the Convergence of a Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem