A new approach to improve ill-conditioned parabolic optimal control problem via time domain decomposition

From MaRDI portal
Publication:2630751

DOI10.1007/S11075-015-0060-0zbMATH Open1347.65116arXiv1403.7254OpenAlexW1928045444MaRDI QIDQ2630751FDOQ2630751

Mohamed Kamel Riahi

Publication date: 22 July 2016

Published in: Numerical Algorithms (Search for Journal in Brave)

Abstract: In this paper we present a new steepest-descent type algorithm for convex optimization problems. Our algorithm pieces the unknown into sub-blocs of unknowns and considers a partial optimization over each sub-bloc. In quadratic optimization, our method involves Newton technique to compute the step-lengths for the sub-blocs resulting descent directions. Our optimization method is fully parallel and easily implementable, we first presents it in a general linear algebra setting, then we highlight its applicability to a parabolic optimal control problem, where we consider the blocs of unknowns with respect to the time dependency of the control variable. The parallel tasks, in the last problem, turn "on" the control during a specific time-window and turn it "off" elsewhere. We show that our algorithm significantly improves the computational time compared with recognized methods. Convergence analysis of the new optimal control algorithm is provided for an arbitrary choice of partition. Numerical experiments are presented to illustrate the efficiency and the rapid convergence of the method.


Full work available at URL: https://arxiv.org/abs/1403.7254




Recommendations




Cites Work


Cited In (3)

Uses Software





This page was built for publication: A new approach to improve ill-conditioned parabolic optimal control problem via time domain decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2630751)