activity
20212026
most citedDouble Saddle-Point Preconditioning for Krylov Methods in the Inexact Sequential Homotopy Method

1 citations · 1 across the 4 of their papers we have counts for

collaborators

7 papers

math.OC2026

Constraint Qualifications and Gradient Flows for Block Vanishing Constraint Problems

Julian Niederer, Christoph Hansknecht, Andreas Potschka +1

Mathematical Programs with Blocks of Vanishing Constraints (MP-BVCs) are a challenging class of optimization problems due to the loss of standard constraint qualifications. Based o…

math.OC2026

A Flow-based Method for Problems with Vanishing Constraints

Christoph Hansknecht, Julian Niederer, Andreas Potschka

Mathematical Programs with Vanishing Constraints (MPVCs) are a notoriously challenging class of problems owing to their lack of constraint qualification. Therefore, to tackle these…

math.NA2025

Eigenvalue bounds for preconditioned symmetric multiple saddle-point matrices

L. Bergamaschi, A. Martinez, J. W. Pearson +1

We develop eigenvalue bounds for symmetric, block tridiagonal multiple saddle-point linear systems, preconditioned with block diagonal matrices. We extend known results for $3 \tim…

math.NA2024

A Framework for the Solution of Tree-Coupled Saddle-Point Systems

Christoph Hansknecht, Bernhard Heinzelreiter, John W. Pearson +1

We consider the solution of saddle-point systems with a tree-based block structure, introducing a parallelizable direct method for their solution. As our key contribution, we then…

math.NA2024

Spectral analysis of block preconditioners for double saddle-point linear systems with application to PDE-constrained optimization

Luca Bergamaschi, Angeles Martinez, John Pearson +1

In this paper, we describe and analyze the spectral properties of a symmetric positive definite inexact block preconditioner for a class of symmetric, double saddle-point linear sy…

math.OC2024

A zonogon approach for computing small polygons of maximum perimeter

Bernd Mulansky, Andreas Potschka

We derive a mixed integer nonlinear programming formulation for the problem of finding a convex polygon with a given number of vertices that is small (diameter at most one) and has…

math.OC2021★ 1 cited

Double Saddle-Point Preconditioning for Krylov Methods in the Inexact Sequential Homotopy Method

John W. Pearson, Andreas Potschka

We derive an extension of the sequential homotopy method that allows for the application of inexact solvers for the linear (double) saddle-point systems arising in the local semism…