Splitting methods for constrained quadratic programs in data analysis

DOI10.1016/0898-1221(96)00131-9zbMath0861.90105OpenAlexW2071170506MaRDI QIDQ1816645

Emanuele Galligani, Luca Zanni, Valeria Ruggiero

Publication date: 27 November 1996

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(96)00131-9

zbMATH Keywords

large scale problemparallel computeracceleration techniquelinearly constrained quadratic programminglinearly constrained strictly convex quadratic programsplitting of the objective matrix

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20) Parallel numerical computation (65Y05)

Related Items

Splitting methods for constrained quadratic programs in data analysis ⋮ A modified projection algorithm for large strictly-convex quadratic programs

Cites Work

• Unnamed Item
• Parallel successive overrelaxation methods for symmetric linear complementarity problems and linear programs
• \(C^ 1\) surface interpolation with constraints
• Accelerating the convergence of the diagonalization and projection algorithms for finite-dimensional variational inequalities
• Splitting methods for constrained quadratic programs in data analysis
• An approach to nonlinear programming
• Iterative Methods for Large Convex Quadratic Programs: A Survey
• The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation