12 citations · 13 across the 5 of their papers we have counts for
7 papers
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…
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…
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…
Non-uniform Grid Refinement for the Combinatorial Integral Approximation
Felix Bestehorn, Christoph Hansknecht, Christian Kirches +1
The combinatorial integral approximation (CIA) is a solution technique for integer optimal control problems. In order to regularize the solutions produced by CIA, one can minimize…
Convergence of Successive Linear Programming Algorithms for Noisy Functions
Christoph Hansknecht, Christian Kirches, Paul Manns
Gradient-based methods have been highly successful for solving a variety of both unconstrained and constrained nonlinear optimization problems. In real-world applications, such as…
Mathematical Programming Models for Mean Computation in Dynamic Time Warping Spaces
Vincent Froese, Christoph Hansknecht
The dynamic time warping (dtw) distance is an established tool for mining time series data. The DTW-Mean problem consists of computing a series which minimizes the so-called Fréche…
Cuts, Primal Heuristics, and Learning to Branch for the Time-Dependent Traveling Salesman Problem
Christoph Hansknecht, Imke Joormann, Sebastian Stiller
We consider the time-dependent traveling salesman problem (TDTSP), a generalization of the asymmetric traveling salesman problem (ATSP) to incorporate time-dependent cost functions…