activity
20162024
most citedSequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints

8 citations · 17 across the 10 of their papers we have counts for

collaborators

10 papers

eess.SY2024

Fast Switching in Mixed-Integer Model Predictive Control

Artemi Makarow, Christian Kirches

We deduce stability results for finite control set and mixed-integer model predictive control with a downstream oversampling phase. The presentation rests upon the inherent robustn…

math.OC2023

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…

math.OC2023★ 1 cited

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…

math.OC2022★ 3 cited

On Convergence of Binary Trust-Region Steepest Descent

Paul Manns, Mirko Hahn, Christian Kirches +2

Binary trust-region steepest descent (BTR) and combinatorial integral approximation (CIA) are two recently investigated approaches for the solution of optimization problems with di…

stat.AP2021

A deterministic matching method for exact matchings to compare the outcome of different interventions

Felix Bestehorn, Maike Bestehorn, Christian Kirches

Statistical matching methods are widely used in the social and health sciences to estimate causal effects using observational data. Often the objective is to find comparable groups…

math.OC2020★ 8 cited

Sequential Linearization Method for Bound-Constrained Mathematical Programs with Complementarity Constraints

Christian Kirches, Jeffrey Larson, Sven Leyffer +1

We propose an algorithm for solving bound-constrained mathematical programs with complementarity constraints on the variables. Each iteration of the algorithm involves solving a li…

math.OC2020★ 2 cited

Relations between Abs-Normal NLPs and MPCCs. Part 1: Strong Constraint Qualifications

Lisa C. Hegerhorst-Schultchen, Christian Kirches, Marc C. Steinbach

This work is part of an ongoing effort of comparing non-smooth optimization problems in abs-normal form to MPCCs. We study the general abs-normal NLP with equality and inequality c…

math.OC2020

Relations between Abs-Normal NLPs and MPCCs. Part 2: Weak Constraint Qualifications

Lisa C. Hegerhorst-Schultchen, Christian Kirches, Marc C. Steinbach

This work continues an ongoing effort to compare non-smooth optimization problems in abs-normal form to Mathematical Programs with Complementarity Constraints (MPCCs). We study gen…

stat.AP2018★ 2 cited

A deterministic balancing score algorithm to avoid common pitfalls of propensity score matching

Felix Bestehorn, Maike Bestehorn, Markus Bestehorn +1

Propensity score matching (PSM) is the de-facto standard for estimating causal effects in observational studies. We show that PSM and its implementations are susceptible to several…

math.OC2016★ 1 cited

trlib: A vector-free implementation of the GLTR method for iterative solution of the trust region problem

Felix Lenders, Christian Kirches, Andreas Potschka

We describe trlib, a library that implements a variant of Gould's Generalized Lanczos method (Gould et al. in SIAM J. Opt. 9(2), 504-525, 1999) for solving the trust region problem…