Related papers: Optimal preconditioners for nonsymmetric multileve…
In this paper, we address the efficient numerical solution of linear and quadratic programming problems, often of large scale. With this aim, we devise an infeasible interior point method, blended with the proximal method of multipliers,…
Mixed-dimensional partial differential equations (PDEs) are characterized by coupled operators defined on domains of varying dimensions and pose significant computational challenges due to their inherent ill-conditioning. Moreover, the…
We consider the iterative solution of symmetric saddle-point matrices with a singular leading block. We develop a new ideal positive definite block diagonal preconditioner that yields a preconditioned operator with four distinct…
Although application examples of multilevel optimization have already been discussed since the 1990s, the development of solution methods was almost limited to bilevel cases due to the difficulty of the problem. In recent years, in machine…
Solving the normal equations corresponding to large sparse linear least-squares problems is an important and challenging problem. For very large problems, an iterative solver is needed and, in general, a preconditioner is required to…
We revisit gradient-based optimization for infinite projected entangled pair states (iPEPS), a tensor network ansatz for simulating many-body quantum systems. This approach is hindered by two major challenges: the high computational cost of…
This paper proposes and analyzes an optimal preconditioner for a general linear symmetric positive definite (SPD) system by following the basic idea of the well-known BPX framework. The SPD system arises from a large number of nonstandard…
Incomplete factorization is a powerful preconditioner for Krylov subspace methods for solving large-scale sparse linear systems. Existing incomplete factorization techniques, including incomplete Cholesky and incomplete LU factorizations,…
The paper focuses on developing and studying efficient block preconditioners based on classical algebraic multigrid for the large-scale sparse linear systems arising from the fully coupled and implicitly cell-centered finite volume…
The $p$-step backwards difference formula (BDF) for solving the system of ODEs can result in a kind of all-at-once linear systems, which are solved via the parallel-in-time preconditioned Krylov subspace solvers (see McDonald, Pestana, and…
It is well known that the discretization of fractional diffusion equations (FDEs) with fractional derivatives $\alpha\in(1,2)$, using the so-called weighted and shifted Gr\"unwald formula, leads to linear systems whose coefficient matrices…
We address the problem of preconditioning a sequence of saddle point linear systems arising in the solution of PDE-constrained optimal control problems via active-set Newton methods, with control and (regularized) state constraints. We…
A preconditioning theory is presented which establishes sufficient conditions for multiplicative and additive Schwarz algorithms to yield self-adjoint positive definite preconditioners. It allows for the analysis and use of non-variational…
We consider the iterative solution of symmetric saddle point systems with a rank-deficient leading block. We develop two preconditioners that, under certain assumptions on the rank structure of the system, yield a preconditioned matrix with…
In this work, we develop an adaptive, multivariate partitioning algorithm for solving mixed-integer nonlinear programs (MINLP) with multi-linear terms to global optimality. This iterative algorithm primarily exploits the advantages of…
In this article, we derive a new, fast, and robust preconditioned iterative solution strategy for the all-at-once solution of optimal control problems with time-dependent PDEs as constraints, including the heat equation and the non-steady…
In this paper, preconditioning the saddle point problem arising from the elliptic boundary optimal control problem with mixed boundary conditions is considered. A block triangular reconditioning method is proposed based on permutations of…
In this article we design and analyze a class of two-level non-overlapping additive Schwarz preconditioners for the solution of the linear system of equations stemming from discontinuous Galerkin discretizations of second-order elliptic…
Multigrid methods are asymptotically optimal algorithms ideal for large-scale simulations. But, they require making numerous algorithmic choices that significantly influence their efficiency. Unlike recent approaches that learn optimal…
We analyse a class of nonoverlapping domain decomposition preconditioners for nonsymmetric linear systems arising from discontinuous Galerkin finite element approximation of fully nonlinear Hamilton--Jacobi--Bellman (HJB) partial…