Online Feedback Optimization (OFO) controllers steer a system to its optimal operating point by treating optimization algorithms as auxiliary dynamic systems. Implementation of OFO controllers requires setting the parameters of the optimization algorithm that allows reaching convergence, posing a challenge because the convergence of the optimization algorithm is often decoupled from the performance of the controlled system. OFO controllers are also typically designed to ensure steady-state tracking by fixing the sampling time to be longer than the time constants of the system. In this paper, we first quantify the impact of OFO parameters and the sampling time on the tracking error and number of oscillations of the controlled system, showing that adjusting them without waiting for steady state allows good tracking. We then propose a tuning method for the sampling time of the OFO controller together with the parameters to allow tracking fast trajectories while reducing oscillations. We validate the proposed tuning approach in a pressure controller in a centrifugal compressor, tracking trajectories faster than the time needed to reach the steady state by the compressor. The results of the validation confirm that simultaneous tuning of the sampling time and the parameters of OFO yields up to 87% times better tracking performance than manual tuning based on steady state.

Ensuring safety in optimization is challenging if the underlying functional forms of either the constraints or the objective function are unknown. The challenge can be addressed by using Gaussian processes to provide confidence intervals used to find solutions that can be considered safe. To iteratively find a trade-off between finding the solution and ensuring safety, the SafeOpt algorithm builds on algorithms using only the upper bounds (UCB-type algorithms) by performing an exhaustive search on the entire search space to find a safe iterate. That approach can quickly become computationally expensive. We reformulate the exhaustive search as a series of optimization problems to find the next recommended points. We show that the proposed reformulation allows using a wide range of available optimization solvers, such as derivative-free methods. We show that by exploiting the properties of the solver, we enable the introduction of new stopping criteria into safe learning methods and increase flexibility in trading off solver accuracy and computational time. The results from a non-convex optimization problem and an application for controller tuning confirm the flexibility and the performance of the proposed reformulation.