Flexible Complementarity Solvers for Large-Scale Applications
Steven J. Benson, Todd S. Munson
Abstract
Discretizations 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.
Create a lesson
Related papers
Towards learning-enhanced solvers for multi-parametric optimization
Dieter Teichrib, Fabian König, Moritz Schulze Darup
Taming Nonconvexity with Epigraph Lifting
Clara Lage, Hok Shing Wong, Matthias Ehrhardt
Multiplicative Gradient Method for Log-Homogeneous Optimization: A Unified Mirror-Descent Framework
Chun-Neng Chu, Yen-Huan Li
On the Complexity of Finding Stationary Points of p-th Order Hölder Smooth Functions in One Dimension
Huanjian Zhou, Taiji Suzuki
Well-Posedness and Strong Convergence of Infinite-Dimensional Port-Hamiltonian Primal-Dual Gradient Dynamics
O. V. Iftime, A. J. van der Schaft
Regularity of the Price of Anarchy in Routing Games over the Multivariate Demand Space
Jiawen Wang, Hu Shao, Ting Wu