GPCG: A case study in the performance and scalability of optimization algorithms

  • Steven Benson
  • Lois McInnes
  • Jorge MorĂ©
    • Categories Optimization Software Design Principles, Parallel Algorithms, Problem Solving Environments Tags , , Short URL: https://optimization-online.org/?p=8483

    GPCG 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.

    Citation

    Preprint ANL/MCS-P768-0799 Mathematics and Computer Science Division Argonne National Laboratory September 2000

    Article

    Download

    View GPCG: A case study in the performance and scalability of optimization algorithms