A case study in the performance and scalability of optimization algorithms

DOI10.1145/502800.502805zbMath1070.65546OpenAlexW1974298974WikidataQ113309785 ScholiaQ113309785MaRDI QIDQ5461005

Jorge J. Moré, Lois Curfman McInnes, Steven Benson

Publication date: 20 July 2005

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/502800.502805

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Quadratic programming (90C20)

Related Items (2)

Using Krylov subspace and spectral methods for solving complementarity problems in many-body contact dynamics simulation ⋮ Flexible complementarity solvers for large-scale applications

Uses Software

• PETSc
• OPT++
• MPI
• TAO

This page was built for publication: A case study in the performance and scalability of optimization algorithms