Structure Exploiting Numerical Algorithms For Optimal Control
Download Structure Exploiting Numerical Algorithms For Optimal Control PDF/ePub or read online books in Mobi eBooks. Click Download or Read Online button to get Structure Exploiting Numerical Algorithms For Optimal Control book now. This website allows unlimited access to, at the time of writing, more than 1.5 million titles, including hundreds of thousands of titles in various foreign languages.
Structure-Exploiting Numerical Algorithms for Optimal Control
Author: Isak Nielsen
language: en
Publisher: Linköping University Electronic Press
Release Date: 2017-04-20
Numerical algorithms for efficiently solving optimal control problems are important for commonly used advanced control strategies, such as model predictive control (MPC), but can also be useful for advanced estimation techniques, such as moving horizon estimation (MHE). In MPC, the control input is computed by solving a constrained finite-time optimal control (CFTOC) problem on-line, and in MHE the estimated states are obtained by solving an optimization problem that often can be formulated as a CFTOC problem. Common types of optimization methods for solving CFTOC problems are interior-point (IP) methods, sequential quadratic programming (SQP) methods and active-set (AS) methods. In these types of methods, the main computational effort is often the computation of the second-order search directions. This boils down to solving a sequence of systems of equations that correspond to unconstrained finite-time optimal control (UFTOC) problems. Hence, high-performing second-order methods for CFTOC problems rely on efficient numerical algorithms for solving UFTOC problems. Developing such algorithms is one of the main focuses in this thesis. When the solution to a CFTOC problem is computed using an AS type method, the aforementioned system of equations is only changed by a low-rank modification between two AS iterations. In this thesis, it is shown how to exploit these structured modifications while still exploiting structure in the UFTOC problem using the Riccati recursion. Furthermore, direct (non-iterative) parallel algorithms for computing the search directions in IP, SQP and AS methods are proposed in the thesis. These algorithms exploit, and retain, the sparse structure of the UFTOC problem such that no dense system of equations needs to be solved serially as in many other algorithms. The proposed algorithms can be applied recursively to obtain logarithmic computational complexity growth in the prediction horizon length. For the case with linear MPC problems, an alternative approach to solving the CFTOC problem on-line is to use multiparametric quadratic programming (mp-QP), where the corresponding CFTOC problem can be solved explicitly off-line. This is referred to as explicit MPC. One of the main limitations with mp-QP is the amount of memory that is required to store the parametric solution. In this thesis, an algorithm for decreasing the required amount of memory is proposed. The aim is to make mp-QP and explicit MPC more useful in practical applications, such as embedded systems with limited memory resources. The proposed algorithm exploits the structure from the QP problem in the parametric solution in order to reduce the memory footprint of general mp-QP solutions, and in particular, of explicit MPC solutions. The algorithm can be used directly in mp-QP solvers, or as a post-processing step to an existing solution.
Optimization with PDE Constraints
Author: Michael Hinze
language: en
Publisher: Springer Science & Business Media
Release Date: 2008-10-16
Solving optimization problems subject to constraints given in terms of partial d- ferential equations (PDEs) with additional constraints on the controls and/or states is one of the most challenging problems in the context of industrial, medical and economical applications, where the transition from model-based numerical si- lations to model-based design and optimal control is crucial. For the treatment of such optimization problems the interaction of optimization techniques and num- ical simulation plays a central role. After proper discretization, the number of op- 3 10 timization variables varies between 10 and 10 . It is only very recently that the enormous advances in computing power have made it possible to attack problems of this size. However, in order to accomplish this task it is crucial to utilize and f- ther explore the speci?c mathematical structure of optimization problems with PDE constraints, and to develop new mathematical approaches concerning mathematical analysis, structure exploiting algorithms, and discretization, with a special focus on prototype applications. The present book provides a modern introduction to the rapidly developing ma- ematical ?eld of optimization with PDE constraints. The ?rst chapter introduces to the analytical background and optimality theory for optimization problems with PDEs. Optimization problems with PDE-constraints are posed in in?nite dim- sional spaces. Therefore, functional analytic techniques, function space theory, as well as existence- and uniqueness results for the underlying PDE are essential to study the existence of optimal solutions and to derive optimality conditions.
Numerical Computations: Theory and Algorithms
Author: Yaroslav D. Sergeyev
language: en
Publisher: Springer Nature
Release Date: 2024-12-31
The three-volume set LNCS 14476-14478 constitutes the post conference proceedings of the 4th International Conference on Numerical Computations: Theory and Algorithms, NUMTA 2023, held in Pizzo Calabro, Italy, during June 14-20, 2023. The 45 full papers presented in this book together with 60 short papers were carefully reviewed and selected from 170 submissions. The papers focus on topics such as: continuous and discrete single- and multi-objective problems, local, global and large-scale optimization, classification in machine learning, optimal control, and applications; computational and applied mathematics (such as approximation theory, computational geometry, computational fluid dynamics, dynamical systems and differential equations, numerical algebra, etc.) and applications in engineering and science; numerical models, methods and software using traditional and emerging high-performance computational tools and paradigms (including the infinity and quantum computing) and their application in artificial intelligence and data science, bioinformatics, economics and management, engineering and technology, mathematical education, number theory and foundations of mathematics, etc.