Adjoint-based predictor-corrector sequential convex programming for parametric nonlinear optimization

This paper proposes an algorithmic framework for solving parametric optimization problems which we call adjoint-based predictor-corrector sequential convex programming. After presenting the algorithm, we prove a contraction estimate that guarantees the tracking performance of the algorithm. Two variants of this algorithm are investigated. The first one can be used to solve nonlinear programming problems while the second variant is aimed to treat online parametric nonlinear programming problems. The local convergence of these variants is proved. An application to a large-scale benchmark problem that originates from nonlinear model predictive control of a hydro power plant is implemented to examine the performance of the algorithms.Comment: This manuscript consists of 25 pages and 7 figure

Solution of transient optimization problems by using an algorithm based on nonlinear programming

An algorithm is presented for solution of dynamic optimization problems which are nonlinear in the state variables and linear in the control variables. It is shown that the optimal control is bang-bang. A nominal bang-bang solution is found which satisfies the system equations and constraints, and influence functions are generated which check the optimality of the solution. Nonlinear optimization (gradient search) techniques are used to find the optimal solution. The algorithm is used to find a minimum time acceleration for a turbofan engine

Model predictive control based on LPV models with parameter-varying delays

© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.This paper presents a Model Predictive Control (MPC) strategy based on Linear Parameter Varying (LPV) models with varying delays affecting states and inputs. The proposed control approach allows the controller to accommodate the scheduling parameters and delay change. By computing the prediction of the state variables and delay along a prediction time horizon, the system model can be modified according to the evaluation of the estimated state and delay at each time instant. Moreover, the solution of the optimization problem associated with the MPC design is achieved by solving a series of Quadratic Programming (QP) problem at each time instant. This iterative approach reduces the computational burden compared to the solution of a non-linear optimization problem. A pasteurization plant system is used as a case study to demonstrate the effectiveness of the proposed approach.Peer ReviewedPostprint (author's final draft

Sensitivity-based multistep MPC for embedded systems

In model predictive control (MPC), an optimization problem is solved every sampling instant to determine an optimal control for a physical system. We aim to accelerate this procedure for fast systems applications and address the challenge of implementing the resulting MPC scheme on an embedded system with limited computing power. We present the sensitivity-based multistep MPC, a strategy which considerably reduces the computing requirements in terms of floating point operations (FLOPs), compared to a standard MPC formulation, while fulfilling closed- loop performance expectations. We illustrate by applying the method to a DC-DC converter model and show how a designer can optimally trade off closed-loop performance considerations with computing requirements in order to fit the controller into a resource-constrained embedded system

Sensitivity of Pareto Solutions in Multiobjective Optimization.

The paper presents a sensitivity analysis of Pareto solutions on the basis of the Karush-Kuhn-Tucker (KKT) necessary conditions applied to nonlinear multiobjective programs (MOP) continuously depending on a parameter. Since the KKT conditions are of the first order, the sensitivity properties are considered in the first approximation. An analogue of the shadow prices, well known for scalar linear programs, is obtained for nonlinear MOPs. Two types of sensitivity are investigated: sensitivity in the state space (on the Pareto set) and sensitivity in the cost function space (on the balance set) for a vector cost function. The results obtained can be used in applications for sensitivity computation under small variations of parameters. Illustrative examples are presented.Sensitivity analysis; Nonscalarized multiobjective programming; Pareto set; Balance set;

Automating embedded analysis capabilities and managing software complexity in multiphysics simulation part II: application to partial differential equations

A template-based generic programming approach was presented in a previous paper that separates the development effort of programming a physical model from that of computing additional quantities, such as derivatives, needed for embedded analysis algorithms. In this paper, we describe the implementation details for using the template-based generic programming approach for simulation and analysis of partial differential equations (PDEs). We detail several of the hurdles that we have encountered, and some of the software infrastructure developed to overcome them. We end with a demonstration where we present shape optimization and uncertainty quantification results for a 3D PDE application