A case study in the performance and scalability of optimization algorithms

@article{Benson2001ACS,
  title={A case study in the performance and scalability of optimization algorithms},
  author={Steven Benson and Lois C. McInnes and Jorge J. Mor{\'e}},
  journal={ACM Trans. Math. Softw.},
  year={2001},
  volume={27},
  pages={361-376}
}
We analyze the performance and scalabilty of algorithms for the solution of large optimization problems on high-performance parallel architectures. Our case study uses the GPCG (gradient projection, conjugate gradient) algorithm for solving bound-constrained convex quadratic problems. Our implementation of the GPCG algorithm within the Toolkit for Advanced Optimization (TAO) is available for a wide range of high-performance architectures and has been tested on problems with over 2.5 million… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 21 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-4 OF 4 REFERENCES

On the solution of large quadratic programming prob- lems with bound constraints

  • J. J. Mor e, G. Toraldo
  • SIAM J. Optim.,
  • 1991
Highly Influential
15 Excerpts

Parallel domain decomposition methods for optimal con- trol of viscous incompressible ows

  • G. Biros, O. Ghattas
  • Proceedings of Parallel CFD99
  • 1999
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…