A splitting method for quadratic programming problem
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1874115
- Splitting methods for constrained quadratic programs in data analysis
- scientific article; zbMATH DE number 1569000
- Splitting and projection-type methods for large convex quadratic programs
- Solving the general quadratic programming problem in a finite number of steps
Cites work
- An O(n^ 3L) primal interior point algorithm for convex quadratic programming
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- scientific article; zbMATH DE number 1383441 (Why is no real title available?)
- scientific article; zbMATH DE number 3301975 (Why is no real title available?)
- scientific article; zbMATH DE number 3352737 (Why is no real title available?)
- More results on the convergence of iterative methods for the symmetric linear complementarity problem
- On affine scaling algorithms for nonconvex quadratic programming
- On the Convergence of a Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
- On the convergence of iterative methods for symmetric linear complementarity problems
- Solution of symmetric linear complementarity problems by iterative methods
- The Numerical Solution of Equality-Constrained Quadratic Programming Problems
Cited in
(5)- Splitting methods for constrained quadratic programs in data analysis
- scientific article; zbMATH DE number 4204122 (Why is no real title available?)
- scientific article; zbMATH DE number 4123185 (Why is no real title available?)
- scientific article; zbMATH DE number 1569000 (Why is no real title available?)
- scientific article; zbMATH DE number 1874115 (Why is no real title available?)
This page was built for publication: A splitting method for quadratic programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5949529)