Flexible Complementarity Solvers for Large-Scale Applications

Simple item page
dc.creatorBenson, Steven J.
dc.creatorMunson, Todd S.
dc.date2003-07-22
dc.date.accessioned2026-07-07T04:59:51Z
dc.date.available2026-07-07T04:59:51Z
dc.descriptionDiscretizations of infinite-dimensional variational inequalities lead to linear and nonlinear complementarity problems with many degrees of freedom. To solve these problems in a parallel computing environment, we propose two active-set methods that solve only one linear system of equations per iteration. The linear solver, preconditioner, and matrix structures can be chosen by the user for a particular application to achieve high parallel performance. The parallel scalability of these methods is demonstrated for some discretizations of infinite-dimensional variational inequalities.
dc.description17 pages; 2 figures
dc.identifierhttps://arxiv.org/abs/math/0307305
dc.identifierhttp://arxiv.org/abs/math/0307305
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/68151
dc.subjectOptimization and Control
dc.subject65K01; 90C08
dc.titleFlexible Complementarity Solvers for Large-Scale Applications
dc.typetext

Files

Collections

arXiv