Skip to Main Content (Press Enter)

Logo UNIMORE
  • ×
  • Home
  • Degree programmes
  • Modules
  • Jobs
  • People
  • Research Outputs
  • Academic units
  • Third Mission
  • Projects
  • Skills

UNI-FIND
Logo UNIMORE

|

UNI-FIND

unimore.it
  • ×
  • Home
  • Degree programmes
  • Modules
  • Jobs
  • People
  • Research Outputs
  • Academic units
  • Third Mission
  • Projects
  • Skills
  1. Research Outputs

Parallel splitting methods for linearly constrained quadratic programs

Chapter
Publication Date:
1998
Short description:
Parallel splitting methods for linearly constrained quadratic programs / Galligani, E., V., R., Zanni, L. - In: Science and Supercomputing at CINECA, Report 1997 / M. VOLI. - STAMPA. - Casalecchio di Reno (Bologna) : CINECA, 1998. - ISBN 9788886037037. - pp. 561-569
abstract:
We consider the solution of large and sparse linearly constrained quadratic programming problems by an iterative scheme that requires to solve at each iteration a linear complementarity problem. For the solution of this last problem we examine parallel iterative solvers based on splittings of the complementarity matrix. We report the results of numerical experiments carried out on Cray T3E.
Iris type:
Capitolo/Saggio
Keywords:
Parallel computing; quadratic programming; linear complementarity problems; parallel iterative solvers
List of contributors:
Galligani, Emanuele; V., Ruggiero; Zanni, Luca
Authors of the University:
GALLIGANI Emanuele
ZANNI Luca
Handle:
https://iris.unimore.it/handle/11380/593597
Book title:
Science and Supercomputing at CINECA, Report 1997
  • Use of cookies

Powered by VIVO | Designed by Cineca | 26.9.0.0