Moment and SDP relaxation techniques for smooth approximations of problems involving nonlinear differential equations

Combining recent moment and sparse semidefinite programming (SDP) relaxation techniques, we propose an approach to find smooth approximations for solutions of problems involving nonlinear differential equations. Given a system of nonlinear differential equations, we apply a technique based on finite differences and sparse SDP relaxations for polynomial optimization problems (POP) to obtain a discrete approximation of its solution. In a second step we apply maximum entropy estimation (using moments of a Borel measure associated with the discrete solution) to obtain a smooth closed-form approximation. The approach is illustrated on a variety of linear and nonlinear ordinary differential equations (ODE), partial differential equations (PDE) and optimal control problems (OCP), and preliminary numerical results are reported

Optimal control of a nonconserved phase field model of Caginalp type with thermal memory and double obstacle potential

In this paper, we investigate optimal control problems for a nonlinear state system which constitutes a version of the Caginalp phase field system modeling nonisothermal phase transitions with a nonconserved order parameter that takes thermal memory into account. The state system, which is a first-order approximation of a thermodynamically consistent system, is inspired by the theories developed by Green and Naghdi. It consists of two nonlinearly coupled partial differential equations that govern the phase dynamics and the universal balance law for internal energy, written in terms of the phase variable and the so-called thermal displacement, i.e., a primitive with respect to time of temperature. We extend recent results obtained for optimal control problems in which the free energy governing the phase transition was differentiable (i.e., of regular or logarithmic type) to the nonsmooth case of a double obstacle potential. As is well known, in this nondifferentiable case standard methods to establish the existence of appropriate Lagrange multipliers fail. This difficulty is overcome utilizing of the so-called deep quench approach. Namely, the double obstacle potential is approximated by a family of (differentiable) logarithmic ones for which the existence of optimal controls and first-order necessary conditions of optimality in terms of the adjoint state variables and a variational inequality are known. By proving appropriate bounds for the adjoint states of the approximating systems, we can pass to the limit in the corresponding first-order necessary conditions, thereby establishing meaningful first-order necessary optimality conditions also for the case of the double obstacle potential

Galerkin approximations for the optimal control of nonlinear delay differential equations

Optimal control problems of nonlinear delay differential equations (DDEs) are considered for which we propose a general Galerkin approximation scheme built from Koornwinder polynomials. Error estimates for the resulting Galerkin-Koornwinder approximations to the optimal control and the value function, are derived for a broad class of cost functionals and nonlinear DDEs. The approach is illustrated on a delayed logistic equation set not far away from its Hopf bifurcation point in the parameter space. In this case, we show that low-dimensional controls for a standard quadratic cost functional can be efficiently computed from Galerkin-Koornwinder approximations to reduce at a nearly optimal cost the oscillation amplitude displayed by the DDE's solution. Optimal controls computed from the Pontryagin's maximum principle (PMP) and the Hamilton-Jacobi-Bellman equation (HJB) associated with the corresponding ODE systems, are shown to provide numerical solutions in good agreement. It is finally argued that the value function computed from the corresponding reduced HJB equation provides a good approximation of that obtained from the full HJB equation.Comment: 29 pages. This is a sequel of the arXiv preprint arXiv:1704.0042

Koopman operator-based model reduction for switched-system control of PDEs

We present a new framework for optimal and feedback control of PDEs using Koopman operator-based reduced order models (K-ROMs). The Koopman operator is a linear but infinite-dimensional operator which describes the dynamics of observables. A numerical approximation of the Koopman operator therefore yields a linear system for the observation of an autonomous dynamical system. In our approach, by introducing a finite number of constant controls, the dynamic control system is transformed into a set of autonomous systems and the corresponding optimal control problem into a switching time optimization problem. This allows us to replace each of these systems by a K-ROM which can be solved orders of magnitude faster. By this approach, a nonlinear infinite-dimensional control problem is transformed into a low-dimensional linear problem. In situations where the Koopman operator can be computed exactly using Extended Dynamic Mode Decomposition (EDMD), the proposed approach yields optimal control inputs. Furthermore, a recent convergence result for EDMD suggests that the approach can be applied to more complex dynamics as well. To illustrate the results, we consider the 1D Burgers equation and the 2D Navier--Stokes equations. The numerical experiments show remarkable performance concerning both solution times and accuracy.Comment: arXiv admin note: text overlap with arXiv:1801.0641

On the Rate of Convergence for the Pseudospectral Optimal Control of Feedback Linearizable Systems

In this paper, we prove a theorem on the rate of convergence for the optimal cost computed using PS methods. It is a first proved convergence rate in the literature of PS optimal control. In addition to the high-order convergence rate, two theorems are proved for the existence and convergence of the approximate solutions. This paper contains several essential differences from existing papers on PS optimal control as well as some other direct computational methods. The proofs do not use necessary conditions of optimal control. Furthermore, we do not make coercivity type of assumptions. As a result, the theory does not require the local uniqueness of optimal solutions. In addition, a restrictive assumption on the cluster points of discrete solutions made in existing convergence theorems are removed.Comment: 28 pages, 3 figures, 1 tabl

A unified framework for solving a general class of conditional and robust set-membership estimation problems

In this paper we present a unified framework for solving a general class of problems arising in the context of set-membership estimation/identification theory. More precisely, the paper aims at providing an original approach for the computation of optimal conditional and robust projection estimates in a nonlinear estimation setting where the operator relating the data and the parameter to be estimated is assumed to be a generic multivariate polynomial function and the uncertainties affecting the data are assumed to belong to semialgebraic sets. By noticing that the computation of both the conditional and the robust projection optimal estimators requires the solution to min-max optimization problems that share the same structure, we propose a unified two-stage approach based on semidefinite-relaxation techniques for solving such estimation problems. The key idea of the proposed procedure is to recognize that the optimal functional of the inner optimization problems can be approximated to any desired precision by a multivariate polynomial function by suitably exploiting recently proposed results in the field of parametric optimization. Two simulation examples are reported to show the effectiveness of the proposed approach.Comment: Accpeted for publication in the IEEE Transactions on Automatic Control (2014

Nonlinear Parabolic Equations arising in Mathematical Finance

This survey paper is focused on qualitative and numerical analyses of fully nonlinear partial differential equations of parabolic type arising in financial mathematics. The main purpose is to review various non-linear extensions of the classical Black-Scholes theory for pricing financial instruments, as well as models of stochastic dynamic portfolio optimization leading to the Hamilton-Jacobi-Bellman (HJB) equation. After suitable transformations, both problems can be represented by solutions to nonlinear parabolic equations. Qualitative analysis will be focused on issues concerning the existence and uniqueness of solutions. In the numerical part we discuss a stable finite-volume and finite difference schemes for solving fully nonlinear parabolic equations.Comment: arXiv admin note: substantial text overlap with arXiv:1603.0387