Convex reformulations for a special class of nonlinear MPC problems
We show how the solution to NMPC problems for a special type of input-affine discrete-time systems can be obtained by reformulating the underlying non-convex optimal control problem in terms of a finite number of convex subproblems. The reformulation is facilitated by exact (input-state) linearization, which is shown to provide beneficial properties for the treated class of systems. We characterize possible types of the resulting convex subproblems and illustrate our approach with three numerical examples.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Convex NMPC reformulations for a special class of nonlinear multi-input systems with application to rank-one bilinear networks
We show that a special class of (nonconvex) NMPC problems admits an exact solution by reformulating them as a finite number of convex subproblems, extending previous results to the multi-input case. Our approach is appli…
Fast Algorithm for Constrained Linear Inverse Problems
We consider the constrained Linear Inverse Problem (LIP), where a certain atomic norm (like the $\ell_1 $ norm) is minimized subject to a quadratic constraint. Typically, such cost functions are non-differentiable which …
compressed sensingDenoisingImage DenoisingLinearizeLLM: An Agent-Based Framework for LLM-Driven Exact Linear Reformulation of Nonlinear Optimization Problems
Reformulating nonlinear optimization problems into solver-ready linear optimization problems is often necessary for practical applications, but the process is often manual and requires domain expertise. We propose Linear…
Efficient reformulations of ReLU deep neural networks for surrogate modelling in power system optimisation
The ongoing decarbonisation of power systems is driving an increasing reliance on distributed energy resources, which introduces complex and nonlinear interactions that are difficult to capture in conventional optimisati…
BO4IO: A Bayesian optimization approach to inverse optimization with uncertainty quantification
This work addresses data-driven inverse optimization (IO), where the goal is to estimate unknown parameters in an optimization model from observed decisions that can be assumed to be optimal or near-optimal solutions to …
Bayesian OptimizationUncertainty Quantification