Cosmin Petra

2papers

2 Papers

62.7NAApr 17
Algebraic Multigrid with Filtering: An Efficient Preconditioner for Interior Point Methods in Large-Scale Contact Mechanics Optimization

Socratis Petrides, Tucker Hartland, Tzanio Kolev et al.

Large-scale contact mechanics simulations are crucial in many engineering fields such as structural design and manufacturing. In the frictionless case, contact can be modeled by minimizing an energy functional; however, these problems are often nonlinear, nonconvex, and increasingly difficult to solve as mesh resolution increases. In this work, we employ a Newton-based interior-point (IP) filter line-search method, an effective approach for large-scale constrained optimization. While this method converges rapidly, each iteration requires solving a large saddle-point linear system that becomes ill-conditioned as the optimization process converges, largely due to IP treatment of the contact constraints. Such ill-conditioning can hinder solver scalability and increase iteration counts with mesh refinement. To address this, we introduce a novel preconditioner, AMG with filtering (AMGF), tailored to the Schur complement of the saddle-point system. Building on the classical AMG solver, commonly used for elasticity, we augment it with a specialized subspace correction that filters near null space components introduced by contact interface constraints. Through theoretical analysis and numerical experiments on a range of linear and nonlinear contact problems, we demonstrate that AMGF achieves mesh independent convergence and maintains robustness against the ill-conditioning that notoriously plagues IP methods. These results indicate that AMGF makes contact mechanics simulations more tractable and broadens the applicability of Newton-based IP methods in challenging engineering scenarios. More broadly, AMGF is well suited for problems where solver performance is limited by a low-dimensional subspace, such as those arising from localized constraints, interface conditions or model heterogeneities, making it applicable beyond contact mechanics and constrained optimization.

NAApr 3, 2011
Multigrid preconditioning of linear systems for interior point methods applied to a class of box-constrained optimal control problems

Andrei Draganescu, Cosmin Petra

In this article we construct and analyze multigrid preconditioners for discretizations of operators of the form D+K* K, where D is the multiplication with a relatively smooth positive function and K is a compact linear operator. These systems arise when applying interior point methods to the minimization problem min_u (||K u-f||^2 +b||u||^2) with box-constraints on the controls u. The presented preconditioning technique is closely related to the one developed by Draganescu and Dupont in [11] for the associated unconstrained problem, and is intended for large-scale problems. As in [11], the quality of the resulting preconditioners is shown to increase with increasing resolution but decreases as the diagonal of D becomes less smooth. We test this algorithm first on a Tikhonov-regularized backward parabolic equation with box-constraints on the control, and then on a standard elliptic-constrained optimization problem. In both cases it is shown that the number of linear iterations per optimization step, as well as the total number of fine-scale matrix-vector multiplications is decreasing with increasing resolution, thus showing the method to be potentially very efficient for truly large-scale problems.