Paul Manns
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Paul Manns has a total of 30 co-authors. Here are the top co-authors by number of shared publications:
- Christian Kirches
Institute for Mathematical Optimization, Technische Universitt Braunschweig, Braunschweig, Germany
9 shared publications - Christoph Hansknecht
Institute for Mathematical Optimization TU Braunschweig
4 shared publications Sven Leyffer
4 shared publications- Christian Meyer
Lehrstuhl X, Fakultät für Mathematik, Technische Universität Dortmund, Dortmund, Germany
3 shared publications - Marvin Severitt
Faculty of Mathematics, TU Dortmund University, 44227 Dortmund, Germany
3 shared publications Annika Schiemann
Faculty of Mathematics, TU Dortmund University, Dortmund 44227, Germany
2 shared publications
Latest Publications
- 22 May 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 36 (2) , 841-865
Convergence of Trust-Region Algorithms in Metric Spaces
Trust-region algorithms can be applied to very abstract optimization problems because they do not require a specific direction of descent or gradient. This has lead to recent interest in ...
- 22 May 2026
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 36 (2) , 841-865
Convergence of Trust-Region Algorithms in Metric Spaces
Trust-region algorithms can be applied to very abstract optimization problems because they do not require a specific direction of descent or gradient. This has lead to recent interest in ...
- 22 April 2026
- Published by IOP Publishing in Inverse Problems
- Vol. 42 (4) , 045015
Locally-averaged McCormick relaxations for discretization-regularized inverse problems
In this paper, by means of a standard model problem, we devise an approach to computing approximate dual bounds for use in global optimization of coefficient identification in partial differential equations (PDEs) by, e.g. (spatial) branch-and-bound methods. Linearization is achieved by a McCormick relaxation (that is, replacing the bilinear PDE term by a linear one and adding inequality constraints), combined with local averaging to reduce the number of inequalities. Optimization-based bound tightening allows us to tighten the relaxation and thus reduce the induced error. Combining this with a quantification of the discretization error and the propagated noise, we prove that the resulting discretization regularizes the inverse problem, thus leading to an overall convergent scheme. Numerical experiments illustrate the theoretical findings.
- 22 April 2026
- Published by IOP Publishing in Inverse Problems
- Vol. 42 (4) , 045015
Locally-averaged McCormick relaxations for discretization-regularized inverse problems
In this paper, by means of a standard model problem, we devise an approach to computing approximate dual bounds for use in global optimization of coefficient identification in partial differential equations (PDEs) by, e.g. (spatial) branch-and-bound methods. Linearization is achieved by a McCormick relaxation (that is, replacing the bilinear PDE term by a linear one and adding inequality constraints), combined with local averaging to reduce the number of inequalities. Optimization-based bound tightening allows us to tighten the relaxation and thus reduce the induced error. Combining this with a quantification of the discretization error and the propagated noise, we prove that the resulting discretization regularizes the inverse problem, thus leading to an overall convergent scheme. Numerical experiments illustrate the theoretical findings.
- Open Access
- 17 February 2026
- Published by Springer Nature in Mathematical Programming
- Vol. 218 (1-2) , 591-592
Correction: McCormick envelopes in mixed-integer PDE-constrained optimization
We correct two mistakes in the paper [S. Leyffer and P. Manns, Math. Prog. 2025].
- 17 February 2026
- Published by Springer Nature in Mathematical Programming
- Vol. 218 (1-2) , 591-592
Open AccessCorrection: McCormick envelopes in mixed-integer PDE-constrained optimization
We correct two mistakes in the paper [S. Leyffer and P. Manns, Math. Prog. 2025].
- 4 November 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 63 (6) , 3825-3855
Domain Decomposition for Integer Optimal Control with Total Variation Regularization
Total variation integer optimal control problems admit solutions and necessary optimality conditions via geometric variational analysis. In spite of the existence of said solutions, algorithms which solve the discretized objective suffer from high numerical cost associated with the combinatorial nature of integer programming. Hence, such methods are often limited to small and medium-sized problems. We propose a globally convergent, coordinate descent–inspired algorithm that allows tractable subproblem solutions restricted to a partition of the domain. Our decomposition method solves relatively small trust-region subproblems that modify the control variable on a subdomain only. Given nontrivial subdomain overlap, we prove that a global first-order necessary optimality condition is equivalent to a first-order necessary optimality condition per subdomain. We additionally show that a sufficient decrease is achieved on a single subdomain by way of a trust-region subproblem solver using geometric measure–theoretic arguments, which we integrate with a greedy patch selection to prove convergence of our algorithm. We demonstrate the practicality of our algorithm on a benchmark large-scale, PDE-constrained integer optimal control problem and find that our method is faster than the state of the art.
- 4 November 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 63 (6) , 3825-3855
Domain Decomposition for Integer Optimal Control with Total Variation Regularization
Total variation integer optimal control problems admit solutions and necessary optimality conditions via geometric variational analysis. In spite of the existence of said solutions, algorithms which solve the discretized objective suffer from high numerical cost associated with the combinatorial nature of integer programming. Hence, such methods are often limited to small and medium-sized problems. We propose a globally convergent, coordinate descent–inspired algorithm that allows tractable subproblem solutions restricted to a partition of the domain. Our decomposition method solves relatively small trust-region subproblems that modify the control variable on a subdomain only. Given nontrivial subdomain overlap, we prove that a global first-order necessary optimality condition is equivalent to a first-order necessary optimality condition per subdomain. We additionally show that a sufficient decrease is achieved on a single subdomain by way of a trust-region subproblem solver using geometric measure–theoretic arguments, which we integrate with a greedy patch selection to prove convergence of our algorithm. We demonstrate the practicality of our algorithm on a benchmark large-scale, PDE-constrained integer optimal control problem and find that our method is faster than the state of the art.
- Open Access
Minimizing and Maximizing the Shannon Entropy for Fixed Marginals
The mutual information (MI) between two random variables is an important correlation measure in data analysis. The Shannon entropy of a joint probability distribution is the variable part under fixed marginals. We aim to minimize and maximize it to obtain the largest and smallest MI possible in this case, leading to a scaled MI ratio for better comparability. We present algorithmic approaches and optimal solutions for a set of problem instances based on data from molecular evolution. We show that this allows us to construct a sensible, systematic correction to raw MI values.
Open AccessMinimizing and Maximizing the Shannon Entropy for Fixed Marginals
The mutual information (MI) between two random variables is an important correlation measure in data analysis. The Shannon entropy of a joint probability distribution is the variable part under fixed marginals. We aim to minimize and maximize it to obtain the largest and smallest MI possible in this case, leading to a scaled MI ratio for better comparability. We present algorithmic approaches and optimal solutions for a set of problem instances based on data from molecular evolution. We show that this allows us to construct a sensible, systematic correction to raw MI values.
- 1 July 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 37 (4) , 1121-1141
On Discrete Subproblems in Integer Optimal Control with Total Variation Regularization in Two Dimensions
We analyze integer linear programs that we obtain after discretizing two-dimensional subproblems arising from a trust-region algorithm for mixed integer optimal control problems with total variation regularization. We discuss NP-hardness of the discretized problems and the connection to graph-based problems. We show that the underlying polyhedron exhibits structural restrictions in its vertices with regard to which variables can attain fractional values at the same time. Based on this property, we derive cutting planes by employing a relation to shortest-path and minimum bisection problems. We propose a branching rule and a primal heuristic which improves previously found feasible points. We validate the proposed tools with a numerical benchmark in a standard integer programming solver. We observe a significant speedup for medium-sized problems. Our results give hints for scaling toward larger instances in the future. History: Accepted by Andrea Lodi, Area Editor for Design & Analysis of Algorithms–Discrete. Funding: This work was supported by the Deutsche Forschungsgemeinschaft [Grant MA 10080/2-1]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0680 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0680 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 1 July 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 37 (4) , 1121-1141
On Discrete Subproblems in Integer Optimal Control with Total Variation Regularization in Two Dimensions
We analyze integer linear programs that we obtain after discretizing two-dimensional subproblems arising from a trust-region algorithm for mixed integer optimal control problems with total variation regularization. We discuss NP-hardness of the discretized problems and the connection to graph-based problems. We show that the underlying polyhedron exhibits structural restrictions in its vertices with regard to which variables can attain fractional values at the same time. Based on this property, we derive cutting planes by employing a relation to shortest-path and minimum bisection problems. We propose a branching rule and a primal heuristic which improves previously found feasible points. We validate the proposed tools with a numerical benchmark in a standard integer programming solver. We observe a significant speedup for medium-sized problems. Our results give hints for scaling toward larger instances in the future. History: Accepted by Andrea Lodi, Area Editor for Design & Analysis of Algorithms–Discrete. Funding: This work was supported by the Deutsche Forschungsgemeinschaft [Grant MA 10080/2-1]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0680 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0680 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 25 February 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 63 (1) , 437-460
Discretization of Total Variation in Optimization with Integrality Constraints
We introduce discretizations of infinite-dimensional optimization problems with total variation regularization and integrality constraints on the optimization variables. We advance the discretization of the dual formulation of the total variation term with Raviart–Thomas functions, which is known from the literature for certain convex problems. Since we have an integrality constraint, the previous analysis from Caillaud and Chambolle [ IMA J. Numer. Anal., 43 (2022), pp. 692–736] no longer holds. Even weaker [Formula: see text]-convergence results no longer hold because the recovery sequences generally need to attain noninteger values to recover the total variation of the limit function. We solve this issue by introducing a discretization of the input functions on an embedded, finer mesh. A superlinear coupling of the mesh sizes implies an averaging on the coarser mesh of the Raviart–Thomas ansatz, which enables us to recover the total variation of integer-valued limit functions with integer-valued discretized input functions. Moreover, we are able to estimate the discretized total variation of the recovery sequence by the total variation of its limit and an error depending on the mesh size ratio. For the discretized optimization problems, we additionally add a constraint that vanishes in the limit and enforces compactness of the sequence of minimizers, which yields their convergence to a minimizer of the original problem. This constraint contains a degree of freedom whose admissible range is determined. Its choice may have a strong impact on the solutions in practice as we demonstrate with an example from imaging.
- 25 February 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 63 (1) , 437-460
Discretization of Total Variation in Optimization with Integrality Constraints
We introduce discretizations of infinite-dimensional optimization problems with total variation regularization and integrality constraints on the optimization variables. We advance the discretization of the dual formulation of the total variation term with Raviart–Thomas functions, which is known from the literature for certain convex problems. Since we have an integrality constraint, the previous analysis from Caillaud and Chambolle [ IMA J. Numer. Anal., 43 (2022), pp. 692–736] no longer holds. Even weaker [Formula: see text]-convergence results no longer hold because the recovery sequences generally need to attain noninteger values to recover the total variation of the limit function. We solve this issue by introducing a discretization of the input functions on an embedded, finer mesh. A superlinear coupling of the mesh sizes implies an averaging on the coarser mesh of the Raviart–Thomas ansatz, which enables us to recover the total variation of integer-valued limit functions with integer-valued discretized input functions. Moreover, we are able to estimate the discretized total variation of the recovery sequence by the total variation of its limit and an error depending on the mesh size ratio. For the discretized optimization problems, we additionally add a constraint that vanishes in the limit and enforces compactness of the sequence of minimizers, which yields their convergence to a minimizer of the original problem. This constraint contains a degree of freedom whose admissible range is determined. Its choice may have a strong impact on the solutions in practice as we demonstrate with an example from imaging.
- Open Access
- 6 January 2025
- Published by Springer Nature in Mathematical Programming
- Vol. 218 (1-2) , 1-46
McCormick envelopes in mixed-integer PDE-constrained optimization
McCormick envelopes are a standard tool for deriving convex relaxations of optimization problems that involve polynomial terms. Such McCormick relaxations provide lower bounds, for example, in branch-and-bound procedures for mixed-integer nonlinear programs but have not gained much attention in PDE-constrained optimization so far. This lack of attention may be due to the distributed nature of such problems, which on the one hand leads to infinitely many linear constraints (generally state constraints that may be difficult to handle) in addition to the state equation for a pointwise formulation of the McCormick envelopes and renders bound-tightening procedures that successively improve the resulting convex relaxations computationally intractable. We analyze McCormick envelopes for a model problem class that is governed by a semilinear PDE involving a bilinearity and integrality constraints. We approximate the nonlinearity and in turn the McCormick envelopes by averaging the involved terms over the cells of a partition of the computational domain on which the PDE is defined. This yields convex relaxations that underestimate the original problem up to an a priori error estimate that depends on the mesh size of the discretization. These approximate McCormick relaxations can be improved by means of an optimization-based bound-tightening procedure. We show that their minimizers converge to minimizers to a limit problem with a pointwise formulation of the McCormick envelopes when driving the mesh size to zero. We provide a computational example, for which we certify all of our imposed assumptions. The results point to both the potential of the methodology and the gaps in the research that need to be closed. Our methodology provides a framework first for obtaining pointwise underestimators for nonconvexities and second for approximating them with finitely many linear inequalities in an infinite-dimensional setting.
- 6 January 2025
- Published by Springer Nature in Mathematical Programming
- Vol. 218 (1-2) , 1-46
Open AccessMcCormick envelopes in mixed-integer PDE-constrained optimization
McCormick envelopes are a standard tool for deriving convex relaxations of optimization problems that involve polynomial terms. Such McCormick relaxations provide lower bounds, for example, in branch-and-bound procedures for mixed-integer nonlinear programs but have not gained much attention in PDE-constrained optimization so far. This lack of attention may be due to the distributed nature of such problems, which on the one hand leads to infinitely many linear constraints (generally state constraints that may be difficult to handle) in addition to the state equation for a pointwise formulation of the McCormick envelopes and renders bound-tightening procedures that successively improve the resulting convex relaxations computationally intractable. We analyze McCormick envelopes for a model problem class that is governed by a semilinear PDE involving a bilinearity and integrality constraints. We approximate the nonlinearity and in turn the McCormick envelopes by averaging the involved terms over the cells of a partition of the computational domain on which the PDE is defined. This yields convex relaxations that underestimate the original problem up to an a priori error estimate that depends on the mesh size of the discretization. These approximate McCormick relaxations can be improved by means of an optimization-based bound-tightening procedure. We show that their minimizers converge to minimizers to a limit problem with a pointwise formulation of the McCormick envelopes when driving the mesh size to zero. We provide a computational example, for which we certify all of our imposed assumptions. The results point to both the potential of the methodology and the gaps in the research that need to be closed. Our methodology provides a framework first for obtaining pointwise underestimators for nonconvexities and second for approximating them with finitely many linear inequalities in an infinite-dimensional setting.
- Open Access
- 6 January 2025
- Published by EDP Sciences in ESAIM: Control, Optimisation and Calculus of Variations
- Vol. 31
Homotopy trust-region method for phase-field approximations in perimeter-regularized binary optimal control
We consider optimal control problems that have binary-valued control input functions and a perimeter regularization. We develop and analyze a trust-region algorithm that solves a sequence of subproblems in which the regularization term and the binarity constraint are relaxed by a non-convex energy functional. We show how the parameter that controls the distinctiveness of the resulting phase field can be coupled to the trust-region radius updates and be driven to zero over the course of the iterations in order to obtain convergence to points that satisfy a first-order optimality condition of the limit problem under suitable regularity assumptions. Finally, we highlight and discuss the assumptions and restrictions of our approach and provide the first computational results for a motivating application in the field of control of acoustic waves in dissipative media.
- 6 January 2025
- Published by EDP Sciences in ESAIM: Control, Optimisation and Calculus of Variations
- Vol. 31
Open AccessHomotopy trust-region method for phase-field approximations in perimeter-regularized binary optimal control
We consider optimal control problems that have binary-valued control input functions and a perimeter regularization. We develop and analyze a trust-region algorithm that solves a sequence of subproblems in which the regularization term and the binarity constraint are relaxed by a non-convex energy functional. We show how the parameter that controls the distinctiveness of the resulting phase field can be coupled to the trust-region radius updates and be driven to zero over the course of the iterations in order to obtain convergence to points that satisfy a first-order optimality condition of the limit problem under suitable regularity assumptions. Finally, we highlight and discuss the assumptions and restrictions of our approach and provide the first computational results for a motivating application in the field of control of acoustic waves in dissipative media.
- 17 December 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 62 (6) , 2782-2783
Erratum: Multidimensional Sum-Up Rounding for Elliptic Control Systems
We correct a mistake in the paper [P. Manns and C. Kirches, SIAM J. Numer. Anal., 58 (2020), pp. 3427–3447]. The grid refinement strategy in Definition 4.3 needs to ensure that the order of the (sets of) grid cells that are successively refined is preserved over all grid iterations. This was only partially reflected in Definition 4.3 , and we correct it here.
- 17 December 2024
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 62 (6) , 2782-2783
Erratum: Multidimensional Sum-Up Rounding for Elliptic Control Systems
We correct a mistake in the paper [P. Manns and C. Kirches, SIAM J. Numer. Anal., 58 (2020), pp. 3427–3447]. The grid refinement strategy in Definition 4.3 needs to ensure that the order of the (sets of) grid cells that are successively refined is preserved over all grid iterations. This was only partially reflected in Definition 4.3 , and we correct it here.