Florian Messerer

Florian Messerer

Auto-generated profile, based on publicly available information

Florian Messerer

Department of Microsystems Engineering, University of Freiburg, Freiburg, Germany

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 August 2021 in ESAIM: Proceedings and Surveys
Verified
Journal Article
Open access
PDF file
FMFlorian Messerer
Florian Messerer
KBKatrin Baumgärtner
Katrin Baumgärtner
MDMoritz Diehl
Moritz Diehl
We provide an overview of a class of iterative convex approximation methods for nonlinear optimization problems with convex-over-nonlinear substructure. These problems are characterized by outer convexities on the one hand, and nonlinear, generally nonconvex, but differentiable functions on the other hand. All methods from this class use only first order derivatives of the nonlinear functions and sequentially solve convex optimization problems. All of them are different generalizations of the classical Gauss-Newton (GN) method. We focus on the smooth constrained case and on three methods to address it: Sequential Convex Programming (SCP), Sequential Convex Quadratic Programming (SCQP), and Sequential Quadratically Constrained Quadratic Programming (SQCQP). While the first two methods were previously known, the last is newly proposed and investigated in this paper. We show under mild assumptions that SCP, SCQP and SQCQP have exactly the same local linear convergence – or divergence – rate. We then discuss the special case in which the solution is fully determined by the active constraints, and show that for this case the KKT conditions are sufficient for local optimality and that SCP, SCQP and SQCQP even converge quadratically. In the context of parameter estimation with symmetric convex loss functions, the possible divergence of the methods can in fact be an advantage that helps them to avoid some undesirable local minima: generalizing existing results, we show that the presented methods converge to a local minimum if and only if this local minimum is stable against a mirroring operation applied to the measurement data of the estimation problem. All results are illustrated by numerical experiments on a tutorial example.

24 May 2021 in IEEE Control Systems Letters
Verified
Journal Article
Closed access
JHJonas Hall
Jonas Hall
ANArmin Nurkanović
Armin Nurkanović
FMFlorian Messerer
Florian Messerer
MDMoritz Diehl
Moritz Diehl
Mathematical programs with complementarity constraints are notoriously difficult to solve due to their nonconvexity and lack of constraint qualifications in every feasible point. This letter focuses on the subclass of quadratic programs with linear complementarity constraints. A novel approach to solving a penalty reformulation using sequential convex programming and a homotopy on the penalty parameter is introduced. Linearizing the necessarily nonconvex penalty function yields convex quadratic subproblems, which have a constant Hessian matrix throughout all iterates. This allows solution computation with a single KKT matrix factorization. Furthermore, a globalization scheme is introduced in which the underlying merit function is minimized analytically, and guarantee of descent is provided at each iterate. The algorithmic features and possible computational speedups are illustrated in a numerical experiment.

27 May 2025 in IEEE Control Systems Letters
Verified
Journal Article
Closed access
HHHannes Homburger
Hannes Homburger
FMFlorian Messerer
Florian Messerer
MDMoritz Diehl
Moritz Diehl
JRJohannes Reuter
Johannes Reuter
Model predictive path integral (MPPI) control has recently received a lot of attention, especially in the robotics and reinforcement learning communities. This letter aims to make the MPPI control framework more accessible to the optimal control community. We present three classes of optimal control problems and their solutions by MPPI. Further, we investigate the suboptimality of MPPI to general deterministic nonlinear discrete-time systems. Here, suboptimality is defined as the deviation between the control provided by MPPI and the optimal solution to the deterministic optimal control problem. Our findings are that in a smooth and unconstrained setting, the growth of suboptimality in the control input trajectory is second-order with the scaling of the MPPI exploration uncertainty. The results indicate that the suboptimality of the MPPI solution can be modulated by tuning the hyperparameters. We illustrate our findings using numerical examples.

16 December 2024 in Mathematical Programming Computation
Verified
Journal Article
Closed access
PDF file
JHJonas Hall
Jonas Hall
ANArmin Nurkanović
Armin Nurkanović
FMFlorian Messerer
Florian Messerer
MDMoritz Diehl
Moritz Diehl

20 December 2022 in IEEE Control Systems Letters
Verified
Journal Article
Closed access
FMFlorian Messerer
Florian Messerer
KBKatrin Baumgartner
Katrin Baumgartner
MDMoritz Diehl
Moritz Diehl
We propose a formulation for approximate constrained nonlinear output-feedback stochastic model predictive control. Starting from the ideal but intractable stochastic optimal control problem (OCP), which involves the optimization over output-dependent policies, we use linearization with respect to the uncertainty to derive a tractable approximation which includes knowledge of the output model. This allows us to compute the expected value for the outer functions of the OCP exactly. Crucially, the dual control effect is preserved by this approximation. In consequence, the resulting controller is aware of how the choice of inputs affects the information available in the future which in turn influences subsequent controls.

3 May 2024 in IEEE Control Systems Letters
Verified
Journal Article
Closed access
FMFlorian Messerer
Florian Messerer
KBKatrin Baumgärtner
Katrin Baumgärtner
SLSergio Lucia
Sergio Lucia
MDMoritz Diehl
Moritz Diehl
We investigate the suboptimality resulting from the application of nominal model predictive control (MPC) to a nonlinear discrete time stochastic system. The suboptimality is defined with respect to the corresponding stochastic optimal control problem (OCP) that minimizes the expected cost of the closed loop system. In this context, nominal MPC corresponds to a form of certainty-equivalent control (CEC). We prove that, in a smooth and unconstrained setting, the suboptimality growth is of fourth order with respect to the level of uncertainty, a parameter which we can think of as a standard deviation. This implies that the suboptimality does not grow very quickly as the level of uncertainty is increased, providing further insight into the practical success of nominal MPC. Similarly, the difference between the optimal and suboptimal control inputs is of second order. We illustrate the result on a simple numerical example, which we also use to show how the proven relationship may cease to hold in the presence of state constraints.