Douglas–Rachford algorithm for control-constrained minimum-energy control problems
From MaRDI portal
Publication:6151944
DOI10.1051/COCV/2024004arXiv2210.17279OpenAlexW4390820549WikidataQ130049304 ScholiaQ130049304MaRDI QIDQ6151944FDOQ6151944
Authors: R. S. Burachik, Bethany I. Caldwell, C. Y. Kaya 
Publication date: 11 March 2024
Published in: ESAIM: Control, Optimisation and Calculus of Variations (Search for Journal in Brave)
Abstract: Splitting and projection-type algorithms have been applied to many optimization problems due to their simplicity and efficiency, but the application of these algorithms to optimal control is less common. In this paper we utilize four popular projection algorithms, namely the Method of Alternating Projections, Dykstra, Douglas--Rachford and Arag'on Artacho--Campoy algorithms, to solve control-constrained linear-quadratic optimal control problems. Instead of the traditional approach where one discretizes the problem and solves it using large-scale finite-dimensional numerical optimization techniques we split the problem in two and use projection methods to find a point in the intersection of the solution sets of these two subproblems hence giving the solution to the original problem. We derive general expressions for the projections and propose a numerical approach. We obtain analytic closed-form expressions for the projectors of pure, under-, critically- and over-damped harmonic oscillators. We illustrate the working of our approach to solving not only these example problems but also a challenging machine tool manipulator problem. Through case studies, we explore and propose desirable ranges of values of some algorithmic parameters which yield a smaller number of iterations.}
Full work available at URL: https://arxiv.org/abs/2210.17279
Recommendations
- Optimal Control Duality and the Douglas–Rachford Algorithm
- On the Behavior of the Douglas--Rachford Algorithm for Minimizing a Convex Function Subject to a Linear Constraint
- A customized Douglas-Rachford splitting algorithm for separable convex minimization with linear constraints
- On the Douglas–Rachford Algorithm for Solving Possibly Inconsistent Optimization Problems
- Solution for state constrained optimal control problems applied to power split control for hybrid vehicles
Numerical optimization and variational techniques (65K10) Numerical methods based on nonlinear programming (49M37) Linear-quadratic optimal control problems (49N10)
Cites Work
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On rings of operators. Reduction theory
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Runge-Kutta methods in optimal control and the transformed adjoint system
- Functional analysis, calculus of variations and optimal control
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal control
- Title not available (Why is that?)
- Computing the steady state of linear quadratic optimization models with rational expectations
- SQP-methods for solving optimal control problems with control and state constraints: Adjoint variables, sensitivity analysis and real-time control
- Second Order Sufficient Conditions for Optimal Control Problems with Free Final Time: The Riccati Approach
- New general guidance method in constrained optimal control. I: Numerical method
- Douglas-Rachford feasibility methods for matrix completion problems
- On weak convergence of the Douglas-Rachford method
- Convex analysis and monotone operator theory in Hilbert spaces
- On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning
- On the Douglas-Rachford algorithm
- A new projection method for finding the closest point in the intersection of convex sets
- Optimal control theory. Applications to management science and economics
- Controllability and minimum energy control
- An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm
- Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms
- Iteration complexity of an inexact Douglas-Rachford method and of a Douglas-Rachford-Tseng's F-B four-operator splitting method for solving monotone inclusions
- A weakly convergent fully inexact Douglas-Rachford method with relative error tolerance
Cited In (1)
This page was built for publication: Douglas–Rachford algorithm for control-constrained minimum-energy control problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6151944)
