Hostname: page-component-7b7567c8c-m6dxt Total loading time: 0 Render date: 2026-11-18T14:31:18.765Z Has data issue: false hasContentIssue false

Limited memory solution of bound constrained convex quadratic problems arising in video games

Published online by Cambridge University Press:  15 June 2007

Michael C. Ferris
Affiliation:
Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford, OX1 3QD, UK.Computer Sciences Department, University of Wisconsin, 1210 West Dayton Street, Madison, Wisconsin 53706, USA.
Andrew J. Wathen
Affiliation:
Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford, OX1 3QD, UK.
Paul Armand
Affiliation:
Laboratoire XLIM, Université de Limoges, Faculté des Sciences et Techniques, 123, avenue Albert Thomas, 87060 Limoges, France; armand@unilim.fr
Get access

Abstract

We describe the solution of a bound constrained convex quadratic problem with limited memory resources. The problem arises from physical simulations occurring within video games. The motivating problem is outlined, along with a simple interior point approach for its solution. Various linear algebra issues arising in the implementation are explored, including preconditioning, ordering and a number of ways of solving an equivalent augmented system. Alternative approaches are briefly surveyed, and some recommendations for solving these types of problems are given.

Information

Type
Research Article
Copyright
© EDP Sciences, ROADEF, SMAI, 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable