Related papers: Scalable augmented Lagrangian preconditioners for …
An effective power based parallel preconditioner is proposed for general large sparse linear systems. The preconditioner combines a power series expansion method with some low-rank correction techniques, where the Sherman-Morrison-Woodbury…
This paper investigates a type of fast and flexible preconditioners to solve multilinear system $\mathcal{A}\textbf{x}^{m-1}=\textbf{b}$ with $\mathcal{M}$-tensor $\mathcal{A}$ and obtains some important convergent theorems about…
This paper considers a generic convex minimization template with affine constraints over a compact domain, which covers key semidefinite programming applications. The existing conditional gradient methods either do not apply to our template…
Many problems in modern robotics can be addressed by modeling them as bilevel optimization problems. In this work, we leverage augmented Lagrangian methods and recent advances in automatic differentiation to develop a general-purpose…
The numerical analysis of higher-order mixed finite-element discretizations for saddle-point problems, such as the Stokes equations, has been well-studied in recent years. While the theory and practice of such discretizations is now…
We present an optimal preconditioner for the exactly divergence-free discontinuous Galerkin (DG) discretization of Cockburn, Kanschat, and Sch\"otzau [J. Sci. Comput., 31 (2007), pp. 61--73] and Wang and Ye [SIAM J. Numer. Anal., 45 (2007),…
The numerical solution of the Stokes equations on an evolving domain with a moving boundary is studied based on the arbitrary Lagrangian-Eulerian finite element method and a second-order projection method along the trajectories of the…
We present a two-level preconditioner for solving linear systems arising from the discretization of the elliptic, linear-elastic deformation equation, in displacement unknowns, over domains that have arbitrary geometric and topological…
We study first-order methods with preconditioning for solving structured nonlinear convex optimization problems. We propose a new family of preconditioners generated by symmetric polynomials. They provide first-order optimization methods…
In many applications, one wants to model physical systems consisting of two different physical processes in two different domains that are coupled across a common interface. A crucial challenge is then that the solutions of the two…
In this paper, the authors constructed an auxiliary space multigrid preconditioner for the weak Galerkin finite element method for second-order diffusion equations, discretized on simplicial 2D or 3D meshes. The idea of the auxiliary space…
In this paper, we propose a domain decomposition method for multiscale second order elliptic partial differential equations with highly varying coefficients. The method is based on a discontinuous Galerkin formulation. We present both a…
Modeling the chemical, electric, and thermal transport as well as phase transitions and the accompanying mesoscale microstructure evolution within a material in an electronic device setting involves the solution of partial differential…
We design inexact proximal augmented Lagrangian based decomposition methods for convex composite programming problems with dual block-angular structures. Our methods are particularly well suited for convex quadratic programming problems…
We propose a semi-proximal augmented Lagrangian based decomposition method for convex composite quadratic conic programming problems with primal block angular structures. Using our algorithmic framework, we are able to naturally derive…
We address the problem of the existence of a Lagrangian for a given system of linear PDEs with constant coefficients. As a subtask, this involves bringing the system into a pre-Lagrangian form, wherein the number of equations matches the…
Current state of the art preconditioners for the reduced Hessian and the Karush-Kuhn-Tucker (KKT) operator for large scale inverse problems are typically based on approximating the reduced Hessian with the regularization operator. However,…
Polynomial preconditioning can improve the convergence of the Arnoldi method for computing eigenvalues. Such preconditioning significantly reduces the cost of orthogonalization; for difficult problems, it can also reduce the number of…
Many physical problems involving heterogeneous spatial scales, such as the flow through fractured porous media, the study of fiber-reinforced materials, or the modeling of the small circulation in living tissues -- just to mention a few…
The efficient solution of discretisations of coupled systems of partial differential equations (PDEs) is at the core of much of numerical simulation. Significant effort has been expended on scalable algorithms to precondition Krylov…