8 citations · 12 across the 6 of their papers we have counts for
6 papers
Anderson Acceleration for Linearly Converging SQP-Type Methods
Jonathan Frey, David Kiessling, Katrin Baumgärtner +1
Although Anderson acceleration (AA) is known to speed up fixed-point iterations, it is rarely applied in constrained optimization, in particular sequential quadratic programming (S…
A Unified Funnel Restoration SQP Algorithm
David Kiessling, Sven Leyffer, Charlie Vanaret
We consider nonlinearly constrained optimization problems and discuss a generic double-loop framework consisting of four algorithmic ingredients that unifies a broad range of nonli…
Fast Generation of Feasible Trajectories in Direct Optimal Control
David Kiessling, Katrin Baumgärtner, Jonathan Frey +3
This paper examines the question of finding feasible points to discrete-time optimal control problems. The optimization problem of finding a feasible trajectory is transcribed to a…
An Almost Feasible Sequential Linear Programming Algorithm
David Kiessling, Charlie Vanaret, Alejandro Astudillo +2
This paper proposes an almost feasible Sequential Linear Programming (afSLP) algorithm. In the first part, the practical limitations of previously proposed Feasible Sequential Line…
Anderson Accelerated Feasible Sequential Linear Programming
David Kiessling, Pieter Pas, Alejandro Astudillo +2
This paper proposes an accelerated version of Feasible Sequential Linear Programming (FSLP): the AA()-FSLP algorithm. FSLP preserves feasibility in all intermediate iterates by…
A Feasible Sequential Linear Programming Algorithm with Application to Time-Optimal Path Planning Problems
David Kiessling, Andrea Zanelli, Armin Nurkanović +5
In this paper, we propose a Feasible Sequential Linear Programming (FSLP) algorithm applied to time-optimal control problems (TOCP) obtained through direct multiple shooting discre…