Compactness and convergence rates in the combinatorial integral approximation decomposition
DOI10.1007/s10107-020-01598-8zbMath1471.49006OpenAlexW3108649445MaRDI QIDQ2044969
Paul Manns, Stefan Ulbrich, Christian Kirches
Publication date: 11 August 2021
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-020-01598-8
convergence ratesapproximation methodsmixed-integer optimal controlcombinatorial integral decomposition
Mixed integer programming (90C11) Discrete-time control/observation systems (93C55) Existence theories for problems in abstract spaces (49J27) Algorithms for approximation of functions (65D15) Numerical methods of relaxation type (49M20)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Relaxation methods for mixed-integer optimal control of partial differential equations
- The integer approximation error in mixed-integer optimal control
- Multi-bang control of elliptic systems
- Combinatorial integral approximation
- An effective branch-and-bound algorithm for convex quadratic integer programming
- Direct methods with maximal lower bound for mixed-integer optimal control problems
- Convergence of sum-up rounding schemes for cloaking problems governed by the Helmholtz equation
- Multidimensional sum-up rounding for integer programming in optimal experimental design
- Multiphase mixed-integer nonlinear optimal control of hybrid electric vehicles
- The Lagrangian relaxation for the combinatorial integral approximation problem
- A convex analysis approach to multi-material topology optimization
- MultiDimensional Sum-Up Rounding for Elliptic Control Systems
- Weakly Differentiable Functions
- Total variation regularization of multi-material topology optimization
- A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems
- Improved regularity assumptions for partial outer convexification of mixed-integer PDE-constrained optimization problems
- Approximation Properties and Tight Bounds for Constrained Mixed-Integer Optimal Control
- Chapter 9: Mixed-Integer DAE Optimal Control Problems: Necessary Conditions and Bounds
- Approximation properties of sum-up rounding in the presence of vanishing constraints
- Operator Theory
This page was built for publication: Compactness and convergence rates in the combinatorial integral approximation decomposition