Splitting methods for constrained quadratic programs in data analysis
type: Item
instance of: scholarly article
title: Splitting methods for constrained quadratic programs in data analysis
zbMATH Open document ID: 0861.90105
DOI: 10.1016/0898-1221(96)00131-9
publication date: 1996-11-27T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C06
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 950607
zbMATH Keywords: linearly constrained strictly convex quadratic program
zbMATH Keywords: large scale problem
zbMATH Keywords: acceleration technique
zbMATH Keywords: parallel computer
zbMATH Keywords: linearly constrained quadratic programming
zbMATH Keywords: splitting of the objective matrix
author: Emanuele Galligani
author: V. Ruggiero
author: Luca Zanni
MaRDI profile type: Publication
full work available at URL: 0898-1221(96)00131-9
OpenAlex ID: W2071170506
cites work: \(C^ 1\) surface interpolation with constraints
cites work: Q5661059
cites work: Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs
cites work: Accelerating the convergence of the diagonalization and projection algorithms for finite-dimensional variational inequalities
cites work: Iterative Methods for Large Convex Quadratic Programs: A Survey
cites work: An approach to nonlinear programming
cites work: The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 950607