GPCG: A Case Study in the Performance and Scalability of Optimization Algorithms

Simple item page
dc.creatorBenson, Steven J.
dc.creatorMcInnes, Lois Curfman
dc.creatorMoré, Jorge J.
dc.date2001-01-19
dc.date.accessioned2026-07-07T03:16:52Z
dc.date.available2026-07-07T03:16:52Z
dc.descriptionGPCG is an algorithm within the Toolkit for Advanced Optimization (TAO) for solving bound constrained, convex quadratic problems. Originally developed by More' and Toraldo, this algorithm was designed for large-scale problems but had been implemented only for a single processor. The TAO implementation is available for a wide range of high-performance architecture, and has been tested on up to 64 processors to solve problems with over 2.5 million variables.
dc.descriptiontitle + 16 pages
dc.identifierhttps://arxiv.org/abs/cs/0101018
dc.identifierhttp://arxiv.org/abs/cs/0101018
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30514
dc.subjectMathematical Software
dc.subjectG.1.6
dc.titleGPCG: A Case Study in the Performance and Scalability of Optimization Algorithms
dc.typetext

Files

Collections

arXiv