Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 28 min ago
PreprintarXiv licencearXiv

Randomized inexact block triangular preconditioners for double saddle-point systems in PDE-constrained optimization

Abstract

We develop a new class of inexact block triangular preconditioners for double saddle-point systems arising from PDE-constrained optimization. The proposed preconditioners are constructed through matrix factorization techniques while preserving the inherent block structure of the original systems. A comprehensive spectral analysis of the preconditioned matrices is provided, yielding explicit bounds for both real and nonreal eigenvalues. To enable efficient construction of the inexact preconditioners, randomized strategies are introduced to select the required subblocks. We establish high-probability bounds for the expected approximation error, with the error estimates explicitly characterized in terms of the eigenvalues of the associated matrices. Numerical experiments demonstrate the effectiveness, robustness, and scalability of the proposed preconditioners, and validate the efficiency of the randomized construction strategies.

Related

  1. Robust preconditioners for finite element approximations of control-state constrained optimal control problems governed by elliptic equations
    Juan Zhang, Liang Ge, Jianwei Zhou
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  2. Randomized and Oracle-Based Feasible Directions Methods for Nonsmooth Nonconvex Constrained Optimization
    Dan Greenstein, Nadav Hallak
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  3. An Inexact Augmented Lagrangian Method for (L0, L1)-Smooth Convex Optimization
    Aleksandr Vyguzov, Fedor Stonyakin
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  4. Primal-Dual Inexact Newton-MR for Nonconvex Optimization with Equality Constraints
    Oscar Smee, Fred Roosta
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  5. Randomized Branch Methods with Inexact Subproblems for Bouligand Stationarity in Linear and Quadratic Programs with Complementarity Constraints
    Ziyin Hu, Xin Liu, Shangzhi Zeng +1
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
BibTeX
@misc{liang2026randomized,
  title = {{Randomized inexact block triangular preconditioners for double saddle-point systems in PDE-constrained optimization}},
  author = {Siqi Liang and Na Huang},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.01031},
  eprint = {2609.01031},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.01031},
}
RIS
TY  - UNPB
TI  - Randomized inexact block triangular preconditioners for double saddle-point systems in PDE-constrained optimization
AU  - Siqi Liang
AU  - Na Huang
PY  - 2026
DA  - 2026/09/01
PB  - arXiv
DO  - 10.48550/arxiv.2609.01031
UR  - https://arxiv.org/abs/2609.01031
AB  - We develop a new class of inexact block triangular preconditioners for double saddle-point systems arising from PDE-constrained optimization. The proposed preconditioners are constructed through matrix factorization techniques while preserving the inherent block structure of the original systems. A comprehensive spectral analysis of the preconditioned matrices is provided, yielding explicit bounds for both real and nonreal eigenvalues. To enable efficient construction of the inexact preconditioners, randomized strategies are introduced to select the required subblocks. We establish high-probability bounds for the expected approximation error, with the error estimates explicitly characterized in terms of the eigenvalues of the associated matrices. Numerical experiments demonstrate the effectiveness, robustness, and scalability of the proposed preconditioners, and validate the efficiency of the randomized construction strategies.
ER  -