This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Port-Hamiltonian systems and monotonicity

M.K. Camlibel Bernoulli Institute for Mathematics, Computer Science and Artificial Intelligence, University of Groningen, The Netherlands, () [email protected]    A.J. van der Schaft Bernoulli Institute for Mathematics, Computer Science and Artificial Intelligence, University of Groningen, The Netherlands    ) [email protected]
Abstract

The relationships between port-Hamiltonian systems modeling and the notion of monotonicity are explored. The earlier introduced notion of incrementally port-Hamiltonian systems is extended to maximal cyclically monotone relations, together with their generating functions. This gives rise to new classes of incrementally port-Hamiltonian systems, with examples stemming from physical systems modeling as well as from convex optimization. An in-depth treatment is given of the composition of maximal monotone and maximal cyclically monotone relations, where in the latter case the resulting maximal cyclically monotone relation is shown to be computable through the use of generating functions. Furthermore, connections are discussed with incremental versions of passivity, and it is shown how incrementally port-Hamiltonian systems with strictly convex Hamiltonians are (maximal) equilibrium independent passive. Finally, the results on compositionality of monotone relations are employed for a convex optimization approach to the computation of the equilibrium of interconnected incrementally port-Hamiltonian systems.

1 Introduction

Port-based modeling of physical systems leads to their description as port-Hamiltonian systems. Such models have turned out to be powerful for purposes of analysis, simulation and control, see e.g. [13, 1, 2]. On the other hand, during the last decades the concept of monotonicity has attracted much attention from multiple points of view. In relation with the current paper the following two aspects of monotonicity are most relevant. First, monotonicity has been a key notion in the study of nonlinear electrical circuits and general nonlinear network dynamics; see e.g. the recent paper [3] for a historical context and references. From a systems and control point of view this view on monotonicity is strongly related to notions of incremental passivity [4] and contraction [5]. Second, monotonicity has evolved as a key concept in convex optimization (see e.g. [6] and the references therein), as well as in nonlinear analysis (see e.g. [7, 8]).

The present paper takes a closer look at the connections between port-Hamiltonian systems and monotonicity, and explores overarching notions. Already in our paper [9], inspired by [10], we defined a new class of dynamical systems, coined as incrementally port-Hamiltonian systems. This was done by replacing the composition of the Dirac structure and the energy-dissipating relation in the standard definition of port-Hamiltonian systems by a general (maximal) monotone relation. Furthermore, in [9] it was shown how monotone relations share the same compositionality property as Dirac structures, and sufficient conditions for the composition of two maximally monotone relations to be again maximally monotone were given. Moreover, the connections between incrementally port-Hamiltonian systems and the notions of incremental and differential passivity were briefly discussed. In the current paper this line of research is continued by developing a full-fledged theory of composition of maximally monotone relations. Furthermore, we take an in-depth look at (maximal) cyclically monotone relations in the context of port-Hamiltonian systems modeling. In particular, we show how, under mild technical conditions, the composition of two maximal cyclically monotone relations is again a maximal cyclically monotone relation. Maximal cyclically monotone relations are of special interest because they correspond to extended convex functions, in the sense that any maximal cyclically monotone relation is given as the subdifferential of a convex function, called the generating function of the relation. We show how the composition of two maximal cyclically monotone relations can be directly computed via their generating functions. Also, we define an appealing class of incrementally port-Hamiltonian systems which are defined by convex functions of the state and input. Obviously, this connects the theory of incrementally port-Hamiltonian systems to convex optimization. In fact, simple examples are continuous-time gradient algorithms for convex functions, and primal-dual gradient algorithms in case of minimization under affine constraints. Furthermore, we show how the equilibrium of interconnections of incrementally port-Hamiltonian systems defined by maximal cyclically monotone relations can be computed by convex optimization; thereby extending the innovative work of [11]. Finally, another connection with convex analysis appears if we assume the Hamiltonian function of the incrementally port-Hamiltonian system to be convex. This leads to shifted passivity [1] of steady states, and in particular to (maximal) equilibrium independent passivity [12, 11].

The organization of the paper is as follows. In Section 2, we quickly review the concepts of Dirac structures and standard port-Hamiltonian systems. This is followed by the definition of incrementally port-Hamiltonian systems in Section 3, and the discussion of a number of examples. In Section 4, we prove that under mild technical conditions the composition of two (maximal) (cyclically) monotone relations is (maximal) cyclically monotone, and thus the power-conserving interconnection of incrementally port-Hamiltonian systems is again an incrementally port-Hamiltonian system. In Section 5 we investigate the various relationships and differences between incrementally port-Hamiltonian and standard port-Hamiltonian systems. As a direct application of the established compositionality theory we study in Section 6 the structure of the set of steady states of incrementally port-Hamiltonian systems, and the computation of the equilibrium of interconnected maximal cyclically monotone port-Hamiltonian systems via convex optimization. Furthermore, assuming convexity of the Hamiltonian, the relations with (maximal) equilibrium independent passivity are investigated. Finally in Section  7 the relations of incrementally port-Hamiltonian systems with incremental passivity and differential passivity are discussed, continuing upon the explorations in [9]. The conclusions are in Section 8.

2 Review of port-Hamiltonian systems on linear state spaces

In order to motivate the definition of incrementally port-Hamiltonian systems we first review the definition of ‘ordinary’ port-Hamiltonian systems; cf. [2, 13, 1] for more details and ramifications.

Underlying the definition of a port-Hamiltonian system is the geometric notion of a Dirac structure, which relates the power variables of the constituting elements of the system in a power-conserving manner. Since incrementally port-Hamiltonian systems will be defined on linear state spaces we restrict as well attention to port-Hamiltonian systems on linear state spaces, and correspondingly to constant Dirac structures on linear spaces111For the extension to port-Hamiltonian systems on manifolds, and the corresponding notions of Dirac on manifolds we refer to e.g. [14, 1, 15]..

Power variables (such as voltages and currents, and forces and velocities), appear in conjugated pairs, whose products have dimension of power. They take values in dual linear spaces, with product meaning duality product. In particular, let {\mathcal{F}} be a finite-dimensional linear space and :=\mathcal{E}:=\mathcal{F}^{*} be its dual space. We call \mathcal{F} the space of flow variables, and \mathcal{E} the space of effort variables. The duality product for the pair (,)({\mathcal{E}},{\mathcal{F}}), denoted by \langle\cdot\mid\cdot\rangle, is given as

ef=eTf\langle e\mid f\rangle=e^{T}f\in\mathbb{R}

for ee\in{\mathcal{E}} and ff\in{\mathcal{F}}, and is the power associated to the pair (f,e)(f,e). Furthermore on ×\mathcal{F}\times\mathcal{E} an indefinite bilinear form is defined as

(f1,e1),(f2,e2)=e1f2+e2f1,\langle\langle(f_{1},e_{1}),(f_{2},e_{2})\rangle\rangle=\langle e_{1}\mid f_{2}\rangle+\langle e_{2}\mid f_{1}\rangle,

where (fi,ei)×(f_{i},e_{i})\in\mathcal{F}\times\mathcal{E} with i{1,2}i\in\{1,2\}. For any subspace 𝒮×\mathcal{S}\subset\mathcal{F}\times\mathcal{E}, we denote its orthogonal companion with respect to this indefinite bilinear form by 𝒮\mathcal{S}^{\perp\!\!\!\perp}.

Throughout the paper, we will work with various spaces of flow/effort variables. By convention, if \mathcal{F}_{\bullet} denotes a certain space of flow variables then :=\mathcal{E}_{\bullet}:=\mathcal{F}_{\bullet}^{*} will denote the corresponding space of effort variables.

Definition 2.1

Let \mathcal{F} be a linear space. A subspace 𝒟×\mathcal{D}\subset\mathcal{F}\times\mathcal{E} is a constant Dirac structure on \mathcal{F} if 𝒟=𝒟\mathcal{D}=\mathcal{D}^{\perp\!\!\!\perp}.

From now on in this paper a Dirac structure will simply refer to a constant Dirac structure on a linear space.

Remark 2.2

An equivalent definition is the following [15, 13, 14]. A Dirac structure is any subspace 𝒟\mathcal{D} with the property

(1) ef=0 for all (f,e)𝒟,\langle e\mid f\rangle=0\mbox{ for all }(f,e)\in\cal D,

which is maximal with respect to this property. (That is, there does not exist a subspace 𝒟\mathcal{D}^{\prime} with 𝒟𝒟\mathcal{D}\subsetneq\mathcal{D}^{\prime} such that ef=0\langle e\mid f\rangle=0 for all (f,e)𝒟(f,e)\in\mathcal{D}^{\prime}.)

In the finite-dimensional case (as will be the case throughout this paper) the maximal dimension of any subspace 𝒟\mathcal{D} satisfying (1) equals dim=dim\dim\mathcal{F}=\dim\mathcal{E}. Thus, equivalently, a Dirac structure is any subspace 𝒟\mathcal{D} satisfying (1) together with

dim𝒟=dim.\dim\mathcal{D}=\dim\mathcal{F}.

The definition of a port-Hamiltonian system on a linear space contains the following ingredients (see e.g. [16, 1, 14, 2]). First a Dirac structure 𝒟\mathcal{D} defined on the space of all flow variables, that is,

(2) 𝒟x×P×R×x×P×R\mathcal{D}\subset\mathcal{F}_{x}\times\mathcal{F}_{P}\times\mathcal{F}_{R}\times\mathcal{E}_{x}\times\mathcal{E}_{P}\times\mathcal{E}_{R}

Here (fx,ex)x×x(f_{x},e_{x})\in\mathcal{F}_{x}\times\mathcal{E}_{x} are the flow and effort variables linking to the energy-storing elements, (fR,eR)R×R(f_{R},e_{R})\in\mathcal{F}_{R}\times\mathcal{E}_{R} are the flow and effort variables linking to energy-dissipating elements, and finally (fP,eP)P×P(f_{P},e_{P})\in\mathcal{F}_{P}\times\mathcal{E}_{P} are the flow and effort port variables. The port-Hamiltonian system is defined by specifying, next to its Dirac structure 𝒟\mathcal{D}, the constitutive relations of the energy-dissipating elements, and of the energy-storing elements. An energy-dissipating relation is any subset R×R\mathcal{R}\subset\mathcal{F}_{R}\times\mathcal{E}_{R} with the property

(3) eRfR0 for all (fR,eR).\langle e_{R}\mid f_{R}\rangle\geqslant 0\mbox{ for all }(f_{R},e_{R})\in\mathcal{R}.

The constitutive relations of the energy-storing elements are specified by a Hamiltonian H:𝒳H:\mathcal{X}\to\mathbb{R}, where 𝒳=x\mathcal{X}=\mathcal{F}_{x}. Thus the total energy while at state xx is given as H(x)H(x). This defines the following constitutive relations between the state variables xx and the flow and effort vectors (fx,ex)(f_{x},e_{x}) of the energy-storing elements222Throughout this paper the vector Hx(x)\frac{\partial H}{\partial x}(x) denotes the column vector of partial derivatives; the corresponding row vector denoted as HxT(x)\frac{\partial H}{\partial x^{T}}(x).

(4) x˙=fxandex=Hx(x).\dot{x}=-f_{x}\quad\text{and}\quad e_{x}=\frac{\partial H}{\partial x}(x).
Definition 2.3

Consider a Dirac structure (2), a Hamiltonian H:𝒳H:\mathcal{X}\to\mathbb{R}, and an energy-dissipating relation R×R\mathcal{R}\subset\mathcal{F}_{R}\times\mathcal{E}_{R} as above. Then the dynamics of the corresponding port-Hamiltonian system on 𝒳\mathcal{X} is given as

(5a) (x˙(t),fP(t),fR(t),Hx(x(t)),eP(t),eR(t))𝒟,\displaystyle\left(-\dot{x}(t),f_{P}(t),-f_{R}(t),\frac{\partial H}{\partial x}\big{(}x(t)\big{)},e_{P}(t),e_{R}(t)\right)\in{\mathcal{D}},
(5b) (fR(t),eR(t))\displaystyle\big{(}f_{R}(t),e_{R}(t)\big{)}\in\mathcal{R}

at (almost) all time instants tt.

Equation (4) immediately implies the energy balance ddtH=HxT(x)x˙=exfx\frac{d}{dt}H=\frac{\partial H}{\partial x^{T}}(x)\dot{x}=-\langle e_{x}\mid f_{x}\rangle. Furthermore, the composition

𝒟:={(fx,fP,ex,eP)x×P×x×P\displaystyle\mathcal{D}\rightleftarrows\mathcal{R}:=\{(f_{x},f_{P},e_{x},e_{P})\in\mathcal{F}_{x}\times\mathcal{F}_{P}\times\mathcal{E}_{x}\times\mathcal{E}_{P}\mid
(6) (fR,eR) s.t. (fx,fP,fR,ex,eP,eR)𝒟}\displaystyle\!\!\!\!\!\!\!\exists(f_{R},e_{R})\in\mathcal{R}\mbox{ s.t. }(f_{x},f_{P},-f_{R},e_{x},e_{P},e_{R})\in\mathcal{D}\}

satisfies by the power-conserving property of the Dirac structure and (3)

(7) exTfx+ePTfP=eRTfR0e_{x}^{T}f_{x}+e_{P}^{T}f_{P}=e_{R}^{T}f_{R}\geqslant 0

for all (fx,fP,ex,eP)𝒟(f_{x},f_{P},e_{x},e_{P})\in\mathcal{D}\rightleftarrows\mathcal{R}. Taken together this implies that

(8) ddtH(x(t))ePT(t)fP(t),\frac{d}{dt}H(x(t))\leqslant e_{P}^{T}(t)f_{P}(t),

showing cyclo-passivity of any port-Hamiltonian system, and passivity if H:𝒳+H:\mathcal{X}\to\mathbb{R}_{+} [1] .

3 Incrementally port-Hamiltonian systems

The basic idea in the definition of an incrementally port-Hamiltonian system, as first introduced in [9], is to replace the composition 𝒟\mathcal{D}\rightleftarrows\mathcal{R} of a Dirac structure 𝒟\mathcal{D} and an energy-dissipating relation \mathcal{R} by a monotone relation {\mathcal{M}}. To do so, we begin with a quick review of monotone relations.

Definition 3.1

A relation ×{\mathcal{M}}\subset{\mathcal{F}}\times{\mathcal{E}} is said to be

  • monotone if

    e1e2f1f20\langle e_{1}-e_{2}\mid f_{1}-f_{2}\rangle\geqslant 0

    for all (fi,ei)(f_{i},e_{i})\in{\mathcal{M}} with i{1,2}i\in\{1,2\}.

  • cyclically monotone if

    e0f0f1+e1f1f2++em1fm1fm+emfmf00.\langle e_{0}\mid f_{0}-f_{1}\rangle+\langle e_{1}\mid f_{1}-f_{2}\rangle+\cdots+\langle e_{m-1}\mid f_{m-1}-f_{m}\rangle+\langle e_{m}\mid f_{m}-f_{0}\rangle\geqslant 0.

    for all m1m\geqslant 1 and (fi,ei)(f_{i},e_{i})\in{\mathcal{M}} with i{0,1,,m}i\in\{0,1,\ldots,m\}.

Since e0f0f1+e1f1f0=e0e1f0f1\langle e_{0}\mid f_{0}-f_{1}\rangle+\langle e_{1}\mid f_{1}-f_{0}\rangle=\langle e_{0}-e_{1}\mid f_{0}-f_{1}\rangle for all e0,f0,e1,f1e_{0},f_{0},e_{1},f_{1}, every cyclically monotone relations is automatically monotone.

A simple example of a monotone relation ×\mathcal{M}\subset\mathbb{R}\times\mathbb{R} is the graph of a monotone (i.e., non-decreasing), possibly discontinuous, function. For example, the graph of the discontinuous function θ:\theta:\mathbb{R}\to\mathbb{R} given by

(9) θ(x)={1 if x<01 if x0\theta(x)=\begin{cases}-1&\text{ if }x<0\\ 1&\text{ if }x\geqslant 0\end{cases}

is a monotone relation. This example already motivates the strengthened definition of a maximal monotone relation.

Definition 3.2

A relation ×{\mathcal{M}}\subset{\mathcal{F}}\times{\mathcal{E}} is called maximal (cyclically) monotone if it is (cyclically) monotone and the implication

 is (cyclically) monotone and ={\mathcal{M}}^{\prime}\text{ is (cyclically) monotone and }{\mathcal{M}}\subset{\mathcal{M}}^{\prime}\quad\implies\quad{\mathcal{M}}={\mathcal{M}}^{\prime}

holds.

The graph of the discontinuous function θ\theta in (9) is monotone, but not maximal monotone. In fact, its graph can be enlarged so as to obtain the following maximal monotone relation

(10) ={(x,y)y{{1} if x<0[1,1] if x=0{1} if x>0}.\mathcal{M}=\left\{(x,y)\mid y\in\begin{cases}\{-1\}&\text{ if }x<0\\ [-1,1]&\text{ if }x=0\\ \{1\}&\text{ if }x>0\end{cases}\right\}.

Note that the function θ\theta in (9) can be regarded as the description of a relay, while its closure given by the maximal monotone relation \mathcal{M} defined in (10) defines for example an ideal Coulomb friction characteristic.

A few well-known facts are noteworthy. For continuous functions, monotonicity of the graph implies maximal monotonicity (see e.g. [17]). Also, every maximal monotone relation on ×\mathbb{R}\times\mathbb{R} is maximal cyclically monotone. (Hence the above Coulomb friction characteristic in (10) is maximal cyclically monotone.) In higher dimensions, however, not every maximal monotone relation enjoys the cyclical monotonicity property. Indeed, for example the relation given by

{([xy],[yx])x,y}2×2\left\{\left(\begin{bmatrix}x\\ y\end{bmatrix},\begin{bmatrix}-y\\ x\end{bmatrix}\right)\mid x,y\in\mathbb{R}\right\}\subset\mathbb{R}^{2}\times\mathbb{R}^{2}

is maximal monotone but not cyclically monotone. More generally, later on (Proposition 5.4) we will see that Dirac structures are maximal monotone, but not cyclically monotone if they are the graph of a non-zero map.

The importance of maximal cyclically monotone relations {\mathcal{M}} lies in the fact that they correspond to extended real-valued convex functions. This will be briefly review next, for more details we refer to [17]. Let ϕ:(,+]\phi:{\mathcal{F}}\rightarrow(-\infty,+\infty] be a proper convex function. Its effective domain is defined by

domϕ:={fϕ(f)<+},\operatorname{dom}\phi:=\{f\in{\mathcal{F}}\mid\phi(f)<+\infty\},

its subdifferential of ϕ\phi at ff by

ϕ(f):={{eϕ(f¯)ϕ(f)+ef¯ff¯} if fdom(ϕ) otherwise,\partial\phi(f):=\begin{cases}\{e\in{\mathcal{E}}\mid\phi(\bar{f})\geqslant\phi(f)+\langle e\mid\bar{f}-f\rangle\,\,\,\forall\,\bar{f}\in{\mathcal{F}}\}&\text{ if }f\in\operatorname{dom}(\phi)\\ \varnothing&\text{ otherwise},\end{cases}

and its conjugate ϕ:(,+]\phi^{\star}:{\mathcal{E}}\rightarrow(-\infty,+\infty] by

ϕ(e):=sup{efϕ(f)f}.\phi^{\star}(e):=\sup\{\langle e\mid f\rangle-\phi(f)\mid f\in{\mathcal{F}}\}.

If, in addition, ϕ\phi is lower semicontinuous, then ϕ=(ϕ)\phi=(\phi^{\star})^{\star} and

(11) eϕ(f)fϕ(e).e\in\partial\phi(f)\iff f\in\partial\phi^{\star}(e).

It turns out (see [17, Thm. 12.25]) that a relation ×\mathcal{M}\subset{\mathcal{F}}\times{\mathcal{E}} is maximal cyclically monotone if and only if there exists a proper lower semicontinuous convex function ϕ\phi such that

={(f,e)eϕ(f)}={(f,e)fϕ(e)}.\mathcal{M}=\{(f,e)\mid e\in\partial\phi(f)\}=\{(f,e)\mid f\in\partial\phi^{\star}(e)\}.

In this case, we say that \mathcal{M} is generated by ϕ\phi, or that ϕ\phi is a generating function of \mathcal{M}. Note that ϕ\phi is determined by \mathcal{M} uniquely up to an additive constant.

As an example, consider the relation given by (10). One easily verifies that \mathcal{M} is generated by the convex function ϕ(x)\phi(x) given by x|x|x\mapsto|x|. Furthermore,

ϕ(y)={0if y[1,1]+if y[1,1].\phi^{\star}(y)=\begin{cases}0&\text{if }y\in[-1,1]\\ +\infty&\text{if }y\not\in[-1,1].\end{cases}

The definition of an incrementally port-Hamiltonian system as introduced in [9] is now extended as follows.

Definition 3.3

Consider a (maximal) (cyclically) monotone relation

x×x×P×P\mathcal{M}\subset\mathcal{F}_{x}\times\mathcal{E}_{x}\times\mathcal{F}_{P}\times\mathcal{E}_{P}

and a Hamiltonian H:xH:\mathcal{F}_{x}\to\mathbb{R}. Then the dynamics of the corresponding (maximal) (cyclically) monotone port-Hamiltonian system, is given by the requirement

(12) (x˙(t),fP(t),Hx(x(t)),eP(t))\big{(}-\dot{x}(t),f_{P}(t),\frac{\partial H}{\partial x}\big{(}x(t)\big{)},e_{P}(t)\big{)}\in{\mathcal{M}}\\

for all time instants tt.

Remark 3.4

Throughout the terminology incrementally port-Hamiltonian system will be used as shorthand for all systems defined with respect to monotone relations {\mathcal{M}}. Whenever we need to be more precise about the properties of the monotone relation {\mathcal{M}} we will refer to the system as a (maximal) (cyclically) monotone port-Hamiltonian system.

It follows that the dynamics of any incrementally port-Hamiltonian system satisfies the incremental dissipation inequality

(13) Hx(x1)Hx(x2)x˙1x˙2eP1eP2fP1fP2\langle\frac{\partial H}{\partial x}\big{(}x_{1}\big{)}-\frac{\partial H}{\partial x}\big{(}x_{2}\big{)}\mid\dot{x}_{1}-\dot{x}_{2}\rangle\leqslant\langle e_{P}^{1}-e_{P}^{2}\mid f_{P}^{1}-f_{P}^{2}\rangle

for all quadruples (xi,x˙i,fPi,ePi),i=1,2,(x_{i},\dot{x}_{i},f_{P}^{i},e_{P}^{i}),i=1,2, satisfying (x˙i,fPi,,Hx(xi),ePi)\big{(}-\dot{x}_{i},f_{P}^{i},,\frac{\partial H}{\partial x}\big{(}x_{i}\big{)},e_{P}^{i}\big{)}\in\mathcal{M} with i{1,2}i\in\{1,2\}. The consequences of this dynamical inequality, and especially the relation with incremental and differential passivity, will be discussed in Section 7.

Incrementally port-Hamiltonian systems are ubiquitous in physical systems modeling, as already illustrated by the following examples.

Example 3.5 (Mechanical systems with friction)

Consider a mechanical system subject to friction. The friction characteristic is given by a relation between fRf_{R}, eRe_{R}. In the case of a scalar friction characteristic of the form eR=R(fR)e_{R}=R(f_{R}) the system is port-Hamiltonian if the graph of the function R:R:\mathbb{R}\to\mathbb{R} is in the first and third quadrant. On the other hand, it is maximal cyclically monotone port-Hamiltonian if the function RR is a monotonically non-decreasing and moreover continuous, or otherwise the graph of RR is extended by the interval between the left- and right limit values at its discontinuities. (A typical example of the latter is Coulomb friction as mentioned above.)

Example 3.6 (Systems with constant sources)

Physical systems containing nonzero internal constant sources are not port-Hamiltonian but can be incrementally port-Hamiltonian. Consider for example any LC-circuit with passive resistors/conductors and constant voltage and/or current sources. The same holds for an arbitrary mechanical system with constant actuation: incrementally port-Hamiltonian but not port-Hamiltonian for nonzero constant actuation.

Example 3.7 (Van der Pol oscillator)

Consider an electrical LC-circuit (with possibly nonlinear capacitors and inductors), together with a single conductor with current fR=If_{R}=I and voltage eR=Ve_{R}=V. In case of a linear conductor I=GV,G>0I=GV,G>0, the system is both port-Hamiltonian and maximal monotone port-Hamiltonian. For a nonlinear conductor I=G(V)I=G(V) the system is port-Hamiltonian if and only the graph of the function GG is in the first and third quadrant and maximal monotone port-Hamiltonian if GG is monotonically non-decreasing and continuous, or otherwise the graph of GG is extended by the interval between the left- and right limit values at its discontinuities. For example, the conductor characteristic I=Φ(V)I=\Phi(V) where Φ(z)=γz3αz,α,γ>0,\Phi(z)=\gamma z^{3}-\alpha z,\alpha,\gamma>0, defines a system which is port-Hamiltonian but not monotone port-Hamiltonian, since the function Φ\Phi is not monotone. On the other hand, by adding a constant source voltage V0V_{0} and constant source current I0I_{0} in such a way that the tunnel diode characteristic

I=Φ(VV0)+I0,I=\Phi(V-V_{0})+I_{0},

passes through the origin the resulting system (the Van der Pol oscillator) is not port-Hamiltonian, since close to the origin the characteristic is in the second and fourth quadrant, while neither is it incrementally port-Hamiltonian.

An appealing class of maximal cyclically monotone port-Hamiltonian systems is defined as follows. Consider any Hamiltonian H:𝒳H:\mathcal{X}\to\mathbb{R}, and any convex function K:𝒳×𝒰K:\mathcal{X}^{*}\times\mathcal{U}\to\mathbb{R}. Then the system

(14) x˙=Ke(H(x),u),e=H(x):=Hx(x)y=Ku(H(x),u)\begin{array}[]{rcl}\dot{x}&=&-\frac{\partial K}{\partial e}(\nabla H(x),u),\quad e=\nabla H(x):=\frac{\partial H}{\partial x}(x)\\[5.69054pt] y&=&\frac{\partial K}{\partial u}(\nabla H(x),u)\end{array}

is a maximal cyclically monotone port-Hamiltonian system with maximal cyclically monotone relation =graph (K)\mathcal{M}=\mbox{graph }(\partial K). Special case occurs if the convex function K(e,u)K(e,u) is of the form

(15) K(e,u)=P(e)+eTBu,K(e,u)=P(e)+e^{T}Bu,

with PP a convex function of ee, and BB an n×mn\times m matrix. This yields the restricted system class

(16) x˙=Pe(H(x))Buy=BTH(x)\begin{array}[]{rcl}\dot{x}&=&-\frac{\partial P}{\partial e}(\nabla H(x))-Bu\\[5.69054pt] y&=&B^{T}\nabla H(x)\end{array}

A physical example of the form (14) is the following.

Example 3.8 (Nonlinear RC electrical circuit)

Consider an RC electrical circuit, with nonlinear conductors at the edges and grounded nonlinear capacitors at part of the nodes, while the remaining nodes are the boundary nodes (terminals). Let the circuit graph be defined by an incidence matrix DD, split according to the splitting of the capacitor and boundary nodes as

(17) D=[DcDb]D=\begin{bmatrix}D_{c}\\ D_{b}\end{bmatrix}

Furthermore, let the conductors at the edges be given as Ij=Gj(Vj)I_{j}=G_{j}(V_{j}), where Ij,VjI_{j},V_{j} are the current through, respectively, voltage, across the jj-th edge, j=1,,mj=1,\cdots,m. Assume that the conductance functions GjG_{j} are all monotone (however not necessarily in the first and third quadrant). This means that there exist convex functions K^j\hat{K}_{j} such that Gj(Vj)=dK^jdVj(Vj)G_{j}(V_{j})=\frac{d\hat{K}_{j}}{dV_{j}}(V_{j}) (if for simplicity we assume that the functions GjG_{j} are continuous, and K^j\hat{K}_{j} are differentiable). Define the convex functions

(18) K^(V1,,Vm):=j=1mK^j(Vj),K(ψ):=K^(DTψ),\hat{K}(V_{1},\ldots,V_{m}):=\sum_{j=1}^{m}\hat{K}_{j}(V_{j}),\quad K(\psi):=\hat{K}(D^{T}\psi),

where ψ\psi is the vector of node voltage potentials. (Recall that by Kirchhoff’s voltage law V=DTψV=D^{T}\psi.) It is immediately checked that Kψ=DK^V(DTψ)\frac{\partial K}{\partial\psi}=D\frac{\partial\hat{K}}{\partial V}(D^{T}\psi). Denote the vector of charges of the grounded capacitors by QQ. It follows by Kirchhoff’s current laws that the dynamics of the nonlinear RC circuit is given by

(19) Q˙=DcK^V(DTψ)Ie=DeK^V(DTψ),\begin{array}[]{rcl}\dot{Q}&=&-D_{c}\frac{\partial\hat{K}}{\partial V}(D^{T}\psi)\\[5.69054pt] I_{e}&=&D_{e}\frac{\partial\hat{K}}{\partial V}(D^{T}\psi),\end{array}

where IeI_{e} is the vector of injected currents at the boundary nodes of the electrical circuit. According to the splitting of the nodes in capacitor and boundary nodes write ψ=[ψcψe]\psi=\begin{bmatrix}\psi_{c}\\ \psi_{e}\end{bmatrix}. Then by specifying the nonlinear grounded capacitors by a Hamiltonian function H(Q)H(Q) it follows that ψc=HQ(Q)\psi_{c}=\frac{\partial H}{\partial Q}(Q).

The system (19) is a maximal cyclically monotone port-Hamiltonian system of the form (14), with inputs ψe\psi_{e}, state QQ (dimension equal to the number of capacitor nodes), and outputs IeI_{e}. The generating function of its maximal cyclically monotone relation is given by the convex function K(ψ)K(\psi). Finally note that the system equations can be also written in terms of the alternative state vector ψc\psi_{c} (under the assumption that the map QHQ(Q)Q\mapsto\frac{\partial H}{\partial Q}(Q) is invertible), by substituting ψ˙c=2HQ2(Q)Q˙\dot{\psi}_{c}=\frac{\partial^{2}H}{\partial Q^{2}}(Q)\dot{Q}.

An example of a maximal cyclically monotone port-Hamiltonian system of the form (14) that is not stemming from physical systems modeling, but instead from optimization, is the following.

Example 3.9 (Gradient algorithm in continuous time)

Consider the problem of minimizing a convex function P:nP:\mathbb{R}^{n}\to\mathbb{R}. The gradient algorithm in continuous time is given as

(20) τq˙=Pq(q)Buy=BTq,\begin{array}[]{rclrl}\tau\dot{q}&=&-\frac{\partial P}{\partial q}(q)-Bu\\[5.69054pt] y&=&B^{T}q\,,&&\end{array}

where τ\tau is a positive definite matrix determining the time-scales of the algorithm. Here, an input vector unu\in\mathbb{R}^{n} is added in order to represent possible interaction with other algorithms or dynamics (e.g., if the gradient algorithm is carried out in a distributed fashion), defining a conjugate output vector as y=BTqny=B^{T}q\in\mathbb{R}^{n}.

This defines a maximal cyclically monotone port-Hamiltonian system with state vector x:=τqx:=\tau q, quadratic Hamiltonian H(x)=12xTτ1xH(x)=\frac{1}{2}x^{T}\tau^{-1}x, and maximal cyclically monotone relation

(21) ={(fS,eS,y,u)fS=Pq(q)+Bu,y=BTeS},{\mathcal{M}}=\{(f_{S},e_{S},y,u)\mid-f_{S}=\frac{\partial P}{\partial q}(q)+Bu,y=B^{T}e_{S}\},

where eS=Hx(x)=τ1xe_{S}=\frac{\partial H}{\partial x}(x)=\tau^{-1}x.

An extended class of maximal monotone port-Hamiltonian systems is defined as

(22) x˙=JH(x)Pe(H(x))Buy=BTH(x)\begin{array}[]{rcl}\dot{x}&=&J\nabla H(x)-\frac{\partial P}{\partial e}(\nabla H(x))-Bu\\[5.69054pt] y&=&B^{T}\nabla H(x)\end{array}

where JJ is a skew-symmetric matrix, and PP a convex function as above. It will follow from Proposition 5.4 that if J0J\neq 0 then the underlying maximal monotone relation is not derivable from a convex function, and the system is not cyclically monotone port-Hamiltonian anymore. An example within this class is the following.

Example 3.10 (Primal-dual gradient algorithm [18])

Consider the constrained optimization problem

(23) minq;Aq=bP(q),\min_{q;\,Aq=b}P(q),

where P:nP:\mathbb{R}^{n}\to\mathbb{R} is a convex function, and Aq=bAq=b are affine constraints for some k×nk\times n matrix AA and vector bkb\in\mathbb{R}^{k}. The resulting Lagrangian function is defined as

(24) L(q,λ):=P(q)+λT(Aqb),λk,L(q,\lambda):=P(q)+\lambda^{T}(Aq-b),\quad\lambda\in\mathbb{R}^{k},

which is convex in qq and concave in λ\lambda. The primal-dual gradient algorithm for solving the optimization problem in continuous time is given as

(25) τqq˙=Lq(q,λ)=Pq(q)ATλ+uτλλ˙=Lλ(q,λ)=Aqby=q,\begin{array}[]{rclrl}\tau_{q}\dot{q}&=&-\frac{\partial L}{\partial q}(q,\lambda)&=&-\frac{\partial P}{\partial q}(q)-A^{T}\lambda+u\\[5.69054pt] \tau_{\lambda}\dot{\lambda}&=&\frac{\partial L}{\partial\lambda}(q,\lambda)&=&Aq-b\\[5.69054pt] y&=&q\,,&&\end{array}

where τq,τλ\tau_{q},\tau_{\lambda} are positive-definite matrices determining the time-scales of the algorithm. Again, an input vector BunBu\in\mathbb{R}^{n} is added in order to represent possible interaction with other algorithms or dynamics, defining a conjugated output vector y=GTqny=G^{T}q\in\mathbb{R}^{n}.

This defines a maximal monotone port-Hamiltonian system with state vector x=(xq,xλ):=(τqq,τλλ)x=(x_{q},x_{\lambda}):=(\tau_{q}q,\tau_{\lambda}\lambda), quadratic Hamiltonian

(26) H(x)=12xqTτq1xq+12xλτλ1xλ,H(x)=\frac{1}{2}x_{q}^{T}\tau_{q}^{-1}x_{q}+\frac{1}{2}x_{\lambda}\tau^{-1}_{\lambda}x_{\lambda},

and maximal monotone relation

(27) ={(fS,eS,y,u)fS=[0ATA0]eS[Pq(q)b]+[0B]u,y=[0BT]eS},{\mathcal{M}}=\{(f_{S},e_{S},y,u)\mid-f_{S}=\begin{bmatrix}0&A^{T}\\[5.69054pt] -A&0\end{bmatrix}e_{S}-\begin{bmatrix}\frac{\partial P}{\partial q}(q)\\[5.69054pt] b\end{bmatrix}+\begin{bmatrix}0\\[5.69054pt] B\end{bmatrix}u,y=\begin{bmatrix}0&B^{T}\end{bmatrix}e_{S}\},

where

(28) eS=H(x)=[τq1xqτλ1xλ]=[qλ]e_{S}=\nabla H(x)=\begin{bmatrix}\tau^{-1}_{q}x_{q}\\ \tau^{-1}_{\lambda}x_{\lambda}\end{bmatrix}=\begin{bmatrix}q\\ \lambda\end{bmatrix}

See for an application the optimization of social welfare in a dynamic pricing algorithm for power networks [19].

4 Composition of monotone relations

A cornerstone of port-Hamiltonian systems theory is the fact that the power-conserving interconnection of port-Hamiltonian systems defines again a port-Hamiltonian system. This in turn is based on the fact that the composition of Dirac structures is again a Dirac structure. In this section we will show that the same property holds for incrementally port-Hamiltonian systems. This follows from the corresponding compositionality property of (maximal) (cyclically) monotone relations.

Let us start by considering two monotone relations aa××a×\mathcal{M}_{a}\subset{\mathcal{F}}_{a}\times{\mathcal{F}}\times{\mathcal{E}}_{a}\times{\mathcal{E}} and bb××b×\mathcal{M}_{b}\subset{\mathcal{F}}_{b}\times{\mathcal{F}}\times{\mathcal{E}}_{b}\times{\mathcal{E}}. Define the composition of a\mathcal{M}_{a} and b\mathcal{M}_{b}, denoted as a×b\mathcal{M}_{a}\overset{\scriptscriptstyle\mathcal{F}\times\mathcal{E}}{\leftrightarrows}\mathcal{M}_{b}, as before, by

a×b:={(fa,fb,ea,eb)a×b×a×b\displaystyle\mathcal{M}_{a}\overset{\scriptscriptstyle\mathcal{F}\times\mathcal{E}}{\rightleftarrows}\mathcal{M}_{b}:=\{(f_{a},f_{b},e_{a},e_{b})\in{\mathcal{F}}_{a}\times{\mathcal{F}}_{b}\times{\mathcal{E}}_{a}\times{\mathcal{E}}_{b}\mid
(29) (f,e)× s.t. (fa,f,ea,e)a,(fb,f,eb,e)b}.\displaystyle\exists(f,e)\in{\mathcal{F}}\times{\mathcal{E}}\text{ s.t. }(f_{a},f,e_{a},e)\in\mathcal{M}_{a},(f_{b},-f,e_{b},e)\in\mathcal{M}_{b}\}.

Thus the composition of a\mathcal{M}_{a} and b\mathcal{M}_{b} is obtained by imposing the interconnection constraints

(30) f1=f2,e1=e2,f_{1}=-f_{2},\quad e_{1}=e_{2},

on the vectors (fa,f1,ea,e1)a(f_{a},f_{1},e_{a},e_{1})\in\mathcal{M}_{a} and (fb,f2,eb,e2)b(f_{b},f_{2},e_{b},e_{2})\in\mathcal{M}_{b} and looking at the resulting vectors (fa,fb,ea,eb)a×b×a×b(f_{a},f_{b},e_{a},e_{b})\in{\mathcal{F}}_{a}\times{\mathcal{F}}_{b}\times{\mathcal{E}}_{a}\times{\mathcal{E}}_{b}.

Whenever interconnection flow and effort spaces \mathcal{F} and \mathcal{E} are clear from the context, we will simply write ab\mathcal{M}_{a}\leftrightarrows\mathcal{M}_{b}. The following result is straightforward.

Proposition 4.1

Let aa××a×\mathcal{M}_{a}\subset{\mathcal{F}}_{a}\times{\mathcal{F}}\times{\mathcal{E}}_{a}\times{\mathcal{E}} and bb××b×\mathcal{M}_{b}\subset{\mathcal{F}}_{b}\times{\mathcal{F}}\times{\mathcal{E}}_{b}\times{\mathcal{E}} be (cyclically) monotone relations. Then, aba×b×a×b\mathcal{M}_{a}\rightleftarrows\mathcal{M}_{b}\subset{\mathcal{F}}_{a}\times{\mathcal{F}}_{b}\times{\mathcal{E}}_{a}\times{\mathcal{E}}_{b} is (cyclically) monotone.

Proof. Suppose that both a\mathcal{M}_{a} and b\mathcal{M}_{b} are monotone relations. Let

(fa,fb,ea,eb),(f¯a,f¯b,e¯a,e¯b)ab.(f_{a},f_{b},e_{a},e_{b}),(\bar{f}_{a},\bar{f}_{b},\bar{e}_{a},\bar{e}_{b})\in\mathcal{M}_{a}\rightleftarrows\mathcal{M}_{b}.

Then, there exist (f,e),(f¯,e¯)×(f,e),(\bar{f},\bar{e})\in{\mathcal{F}}\times{\mathcal{E}} such that (fa,f,ea,e),(f¯a,f¯,e¯a,e¯)a(f_{a},f,e_{a},e),(\bar{f}_{a},\bar{f},\bar{e}_{a},\bar{e})\in\mathcal{M}_{a} and (fb,f,eb,e),(f¯b,f¯,e¯b,e¯)b(f_{b},-f,e_{b},e),(\bar{f}_{b},-\bar{f},\bar{e}_{b},\bar{e})\in\mathcal{M}_{b}. From monotonicity of a\mathcal{M}_{a} and b\mathcal{M}_{b}, we have

[eae¯aee¯][faf¯aff¯]0and[ebe¯bee¯][fbf¯bf+f¯]0.\langle\begin{bmatrix}e_{a}-\bar{e}_{a}\\ e-\bar{e}\end{bmatrix}\mid\begin{bmatrix}f_{a}-\bar{f}_{a}\\ f-\bar{f}\end{bmatrix}\rangle\geqslant 0\quad\text{and}\quad\langle\begin{bmatrix}e_{b}-\bar{e}_{b}\\ e-\bar{e}\end{bmatrix}\mid\begin{bmatrix}f_{b}-\bar{f}_{b}\\ -f+\bar{f}\end{bmatrix}\rangle\geqslant 0.

By adding these left hand sides of these inequalities, we obtain

[eae¯aebe¯b][faf¯afbf¯b]0.\langle\begin{bmatrix}e_{a}-\bar{e}_{a}\\ e_{b}-\bar{e}_{b}\end{bmatrix}\mid\begin{bmatrix}f_{a}-\bar{f}_{a}\\ f_{b}-\bar{f}_{b}\end{bmatrix}\rangle\geqslant 0.

This means that ab\mathcal{M}_{a}\rightleftarrows\mathcal{M}_{b} is monotone. The cyclical monotone case follows in a similar fashion. \blacksquare

Also the composition of two maximal monotone relations turns out to be maximal monotone; provided certain (mild) regularity conditions are met. To elaborate on this, we first introduce some nomenclature and review some known facts about maximal monotone relations.

For a set SS\in{\mathcal{F}}, clS\operatorname{cl}S denotes its closure. The relative interior of a convex set CC\subseteq{\mathcal{F}} is denoted by rintC\operatorname{rint}C. A set SS\subseteq{\mathcal{F}} is said to be nearly convex if there exists a convex set CC\subseteq{\mathcal{F}} such that CSclCC\subseteq S\subseteq\operatorname{cl}C. For a nearly convex set SS, in general, there can be multiple convex sets CC satisfying CSclCC\subseteq S\subseteq\operatorname{cl}C. For any such set CC, however, we have that clC=clS\operatorname{cl}C=\operatorname{cl}S. As such, clS\operatorname{cl}S is convex if SS is nearly convex. Based on this observation, one can extend the notion of relative interior to nearly convex sets by defining rintS=rint(clS)\operatorname{rint}S=\operatorname{rint}(\operatorname{cl}S).

Let S1×2×1×2S\subseteq{\mathcal{F}}_{1}\times{\mathcal{F}}_{2}\times{\mathcal{E}}_{1}\times{\mathcal{E}}_{2}. The projection of SS on 1×2{\mathcal{F}}_{1}\times{\mathcal{F}}_{2}, denoted by Π(S,1×2)\Pi(S,{\mathcal{F}}_{1}\times{\mathcal{F}}_{2}), is defined as

Π(S,1×2):={(f1,f2)(e1,e2)1×2 s.t. (f1,f2,e1,e2)S}.\Pi(S,{\mathcal{F}}_{1}\times{\mathcal{F}}_{2}):=\{(f_{1},f_{2})\mid\exists\,(e_{1},e_{2})\in{\mathcal{E}}_{1}\times{\mathcal{E}}_{2}\text{ s.t. }(f_{1},f_{2},e_{1},e_{2})\in S\}.

We define projections of SS on 1×2{\mathcal{E}}_{1}\times{\mathcal{E}}_{2}, i×j{\mathcal{F}}_{i}\times{\mathcal{E}}_{j}, i{\mathcal{F}}_{i}, and j{\mathcal{E}}_{j} in a similar fashion.

Let S×𝒢S\subseteq\mathcal{F}\times\mathcal{G} be a nearly convex set. Then, both Π(S,)\Pi(S,\mathcal{F}) and Π(S,𝒢)\Pi(S,\mathcal{G}) are nearly convex sets. Furthermore, one can show that

(31) rintS={(f,g)frintΠ(S,) and grintΠ(S({f}×𝒢),𝒢)}.\operatorname{rint}S=\{(f,g)\mid f\in\operatorname{rint}\Pi(S,\mathcal{F})\text{ and }g\in\operatorname{rint}\Pi(S\cap(\{f\}\times\mathcal{G}),\mathcal{G})\}.

Let ×\mathcal{M}\subset{\mathcal{F}}\times{\mathcal{E}} be a maximal monotone relation. Then, the projections Π(,)\Pi(\mathcal{M},{\mathcal{F}}) and Π(,)\Pi(\mathcal{M},{\mathcal{E}}) are nearly convex sets [17, Thm. 12.41].

Let L:𝒢L:\mathcal{G}\rightarrow\mathcal{H} be a linear map and L:𝒢L^{*}:\mathcal{H}^{*}\rightarrow\mathcal{G}^{*} denote its adjoint. For maximal monotone relations ×\mathcal{M}\subseteq\mathcal{H}\times\mathcal{H}^{*} and 𝒩𝒢×𝒢\mathcal{N}\subseteq\mathcal{G}\times\mathcal{G}^{*}, define L𝒢×𝒢\mathcal{M}_{L}\subseteq\mathcal{G}\times\mathcal{G}^{*} and 𝒩L×{}_{L}\mathcal{N}\subseteq\mathcal{H}\times\mathcal{H}^{*} by

L={(g,Lh)(Lg,h)}\displaystyle\mathcal{M}_{L}=\{(g,L^{*}h^{*})\mid(Lg,h^{*})\in\mathcal{M}\}
𝒩L={(Lg,h)(g,Lh)𝒩}{}_{L}\mathcal{N}=\{(Lg,h^{*})\mid(g,L^{*}h^{*})\in\mathcal{N}\}

From [17, Thm. 12.43], we know that L\mathcal{M}_{L} is maximal monotone if

(32) imLrintΠ(,)\operatorname{im}L\cap\operatorname{rint}\Pi(\mathcal{M},\mathcal{H})\neq\varnothing

and 𝒩L{}_{L}\mathcal{N} is maximal monotone if

(33) imLrintΠ(𝒩,𝒢).\operatorname{im}L^{*}\cap\operatorname{rint}\Pi(\mathcal{N},\mathcal{G}^{*})\neq\varnothing.

Furthermore, if \mathcal{M} is generated by ϕ:(,+]\phi:\mathcal{H}\rightarrow(-\infty,+\infty] and

(34) imLrintdom(ϕ),\operatorname{im}L\cap\operatorname{rint}\operatorname{dom}(\phi)\neq\varnothing,

then L\mathcal{M}_{L} is generated by ϕL\phi\circ L given by hϕ(Lh)h\mapsto\phi(Lh). Dually, if 𝒩\mathcal{N} is generated by ψ:𝒢(,+]\psi:\mathcal{G}\rightarrow(-\infty,+\infty] and

(35) imLrintdom(ψ),\operatorname{im}L^{*}\cap\operatorname{rint}\operatorname{dom}(\psi^{\star})\neq\varnothing,

then 𝒩L{}_{L}\mathcal{N} is generated by the function (ψL)(\psi^{\star}\circ L^{*})^{\star}.

Theorem 4.2

Let aa××a×\mathcal{M}_{a}\subset{\mathcal{F}}_{a}\times{\mathcal{F}}\times{\mathcal{E}}_{a}\times{\mathcal{E}} and bb××b×\mathcal{M}_{b}\subset{\mathcal{F}}_{b}\times{\mathcal{F}}\times{\mathcal{E}}_{b}\times{\mathcal{E}} be maximal monotone relations. Let

Cf={(f1,f2)f1Π(a,) and f2Π(b,)}.C_{f}=\{(f_{1},f_{2})\mid f_{1}\in\Pi(\mathcal{M}_{a},{\mathcal{F}})\text{ and }f_{2}\in\Pi(\mathcal{M}_{b},{\mathcal{F}})\}.

and

Ce={(e1,e2)f s.t. (f,e1)Π(a,×) and (f,e2)Π(b,×)}.C_{e}=\{(e_{1},e_{2})\mid\exists\,f\text{ s.t. }(f,e_{1})\in\Pi(\mathcal{M}_{a},{\mathcal{F}}\times{\mathcal{E}})\text{ and }(-f,e_{2})\in\Pi(\mathcal{M}_{b},{\mathcal{F}}\times{\mathcal{E}})\}.

Suppose that there exists (f¯,e¯)×(\bar{f},\bar{e})\in{\mathcal{F}}\times{\mathcal{E}} such that

  1. (i)

    (f¯,f¯)rintCf(\bar{f},-\bar{f})\in\operatorname{rint}C_{f} and

  2. (ii)

    (e¯,e¯)rintCe(\bar{e},\bar{e})\in\operatorname{rint}C_{e}.

Then, aba×b×a×b\mathcal{M}_{a}\rightleftarrows\mathcal{M}_{b}\subset{\mathcal{F}}_{a}\times{\mathcal{F}}_{b}\times{\mathcal{E}}_{a}\times{\mathcal{E}}_{b} is a maximal monotone relation.

Proof. First, we give an alternative characterization of ab\mathcal{M}_{a}\rightleftarrows\mathcal{M}_{b}. Let a××b××a××b×\mathcal{M}\subset{\mathcal{F}}_{a}\times{\mathcal{F}}\times{\mathcal{F}}_{b}\times{\mathcal{F}}\times{\mathcal{E}}_{a}\times{\mathcal{E}}\times{\mathcal{E}}_{b}\times{\mathcal{E}} be defined by

:={(fa,f1,fb,f2,ea,e1,eb,e2)(fa,f1,ea,e1)a and (fb,f2,eb,e2)b}.\mathcal{M}:=\{(f_{a},f_{1},f_{b},f_{2},e_{a},e_{1},e_{b},e_{2})\mid(f_{a},f_{1},e_{a},e_{1})\in\mathcal{M}_{a}\text{ and }(f_{b},f_{2},e_{b},e_{2})\in\mathcal{M}_{b}\}.

Since a\mathcal{M}_{a} and b\mathcal{M}_{b} are both maximal monotone, so is \mathcal{M}. Let A:a××ba××b×A:{\mathcal{F}}_{a}\times{\mathcal{F}}\times{\mathcal{F}}_{b}\rightarrow{\mathcal{F}}_{a}\times{\mathcal{F}}\times{\mathcal{F}}_{b}\times{\mathcal{F}} be the linear map given by

(fa,f,fb)(fa,f,fb,f)(f_{a},f,f_{b})\mapsto(f_{a},f,f_{b},-f)

and B:a××ba×bB:{\mathcal{F}}_{a}\times{\mathcal{F}}\times{\mathcal{F}}_{b}\rightarrow{\mathcal{F}}_{a}\times{\mathcal{F}}_{b} be the linear map given by

(fa,f,fb)(fa,fb).(f_{a},f,f_{b})\mapsto(f_{a},f_{b}).

Note that A:a××b×a××bA^{*}:{\mathcal{E}}_{a}\times{\mathcal{E}}\times{\mathcal{E}}_{b}\times{\mathcal{E}}\rightarrow{\mathcal{E}}_{a}\times{\mathcal{E}}\times{\mathcal{E}}_{b} is given by

(ea,e1,eb,e2)(ea,e1e2,eb)(e_{a},e_{1},e_{b},e_{2})\mapsto(e_{a},e_{1}-e_{2},e_{b})

and B:a×ba××bB^{*}:{\mathcal{E}}_{a}\times{\mathcal{E}}_{b}\rightarrow{\mathcal{E}}_{a}\times{\mathcal{E}}\times{\mathcal{E}}_{b} given by

(ea,eb)(ea,0,eb).(e_{a},e_{b})\mapsto(e_{a},0,e_{b}).

Now, we claim that

ab=B(A)\mathcal{M}_{a}\rightleftarrows\mathcal{M}_{b}=_{B}(\mathcal{M}_{A})

To see this, note that

A\displaystyle\mathcal{M}_{A} ={(fa,f,fb,ea,e1e2,eb)(fa,f,fb,f,ea,e1,eb,e2)}\displaystyle=\{(f_{a},f,f_{b},e_{a},e_{1}-e_{2},e_{b})\mid(f_{a},f,f_{b},-f,e_{a},e_{1},e_{b},e_{2})\in\mathcal{M}\}
={(fa,f,fb,ea,e1e2,eb)(fa,f,ea,e1)a\displaystyle=\{(f_{a},f,f_{b},e_{a},e_{1}-e_{2},e_{b})\mid(f_{a},f,e_{a},e_{1})\in\mathcal{M}_{a}
 and (fb,f,eb,e2)b}\displaystyle\qquad\text{ and }(f_{b},-f,e_{b},e_{2})\in\mathcal{M}_{b}\}

and

(A)B{}_{B}(\mathcal{M}_{A}) ={(fa,fb,ea,eb)f s.t. (fa,f,fb,ea,0,eb)a}\displaystyle=\{(f_{a},f_{b},e_{a},e_{b})\mid\exists\,f\in{\mathcal{F}}\text{ s.t. }(f_{a},f,f_{b},e_{a},0,e_{b})\in\mathcal{M}_{a}\}
={(fa,fb,ea,eb)(f,e)× s.t. (fa,f,ea,e)a\displaystyle=\{(f_{a},f_{b},e_{a},e_{b})\mid\exists\,(f,e)\in{\mathcal{F}}\times{\mathcal{E}}\text{ s.t. }(f_{a},f,e_{a},e)\in\mathcal{M}_{a}
 and (fb,f,eb,e)b}\displaystyle\qquad\text{ and }(f_{b},-f,e_{b},e)\in\mathcal{M}_{b}\}
(36) =ab.\displaystyle=\mathcal{M}_{a}\rightleftarrows\mathcal{M}_{b}.

where A:a×𝒱a×b×𝒱ba×𝒱a×𝒱c×𝒱d×b×𝒱bA:\mathcal{F}_{a}\times\mathcal{V}_{a}\times\mathcal{F}_{b}\times\mathcal{V}_{b}\rightarrow\mathcal{F}_{a}\times\mathcal{V}_{a}\times\mathcal{V}_{c}\times\mathcal{V}_{d}\times\mathcal{F}_{b}\times\mathcal{V}_{b} is the linear map given by

(fa,va,fb,vb)(fa,va,va,vb,fb,vb)(f_{a},v_{a},f_{b},v_{b})\mapsto(f_{a},v_{a},v_{a},v_{b},f_{b},v_{b})

Since \mathcal{M} is maximal monotone, we see from (32) that A\mathcal{M}_{A} is maximal monotone if

(37) imArintΠ(,a××b×).\operatorname{im}A\cap\operatorname{rint}\Pi(\mathcal{M},{\mathcal{F}}_{a}\times{\mathcal{F}}\times{\mathcal{F}}_{b}\times{\mathcal{F}})\neq\varnothing.

From (31), it follows that

rintSA\displaystyle\operatorname{rint}S_{A} ={(fa,f1,fb,f2)(f1,f2)rintΠ(SA,×)\displaystyle=\{(f_{a},f_{1},f_{b},f_{2})\mid(f_{1},f_{2})\in\operatorname{rint}\Pi(S_{A},{\mathcal{F}}\times{\mathcal{F}})
and (fa,fb)rintΠ(SA(a×{f1}×b×{f2}),a×b)}.\displaystyle\text{ and }(f_{a},f_{b})\in\operatorname{rint}\Pi(S_{A}\cap({\mathcal{F}}_{a}\times\{f_{1}\}\times{\mathcal{F}}_{b}\times\{f_{2}\}),{\mathcal{F}}_{a}\times{\mathcal{F}}_{b})\}.

where SA=Π(,a××b×)S_{A}=\Pi(\mathcal{M},{\mathcal{F}}_{a}\times{\mathcal{F}}\times{\mathcal{F}}_{b}\times{\mathcal{F}}). By observing that Π(SA,×)=Π(,×)=Cf\Pi(S_{A},{\mathcal{F}}\times{\mathcal{F}})=\Pi(\mathcal{M},{\mathcal{F}}\times{\mathcal{F}})=C_{f}, we see that the condition (37) is equivalent to the existence of f¯\bar{f}\in{\mathcal{F}} such that (f¯,f¯)rintCf(\bar{f},-\bar{f})\in\operatorname{rint}C_{f}. Therefore, A\mathcal{M}_{A} is maximal monotone due to (i). As such, it follows from (33) that (A)B{}_{B}(\mathcal{M}_{A}), and thus ab\mathcal{M}_{a}\rightleftarrows\mathcal{M}_{b}, is maximal monotone if

(38) imBrintΠ(A,a××b).\operatorname{im}B^{*}\cap\operatorname{rint}\Pi(\mathcal{M}_{A},{\mathcal{E}}_{a}\times{\mathcal{E}}\times{\mathcal{E}}_{b})\neq\varnothing.

To verify this condition, let SB=Π(A,a××b)S_{B}=\Pi(\mathcal{M}_{A},{\mathcal{E}}_{a}\times{\mathcal{E}}\times{\mathcal{E}}_{b}) and note that

rintSB\displaystyle\operatorname{rint}S_{B} ={(ea,e,eb)erintΠ(SB,)\displaystyle=\{(e_{a},e,e_{b})\mid e\in\operatorname{rint}\Pi(S_{B},{\mathcal{E}})
 and (ea,eb)rintΠ(SB(a×{e}×b))}.\displaystyle\qquad\text{ and }(e_{a},e_{b})\in\operatorname{rint}\Pi(S_{B}\cap({\mathcal{E}}_{a}\times\{e\}\times{\mathcal{E}}_{b}))\}.

Therefore, (38) holds if and only if 0rintΠ(SB,)0\in\operatorname{rint}\Pi(S_{B},{\mathcal{E}}). Note that

Π(SB,)={e(e1,e2) s.t. e=e1e2}.\Pi(S_{B},{\mathcal{E}})=\{e\mid\exists\,(e_{1},e_{2})\text{ s.t. }e=e_{1}-e_{2}\}.

As such, (ii) is equivalent to 0rintΠ(SB,)0\in\operatorname{rint}\Pi(S_{B},{\mathcal{E}}) and hence (38). Consequently, ab\mathcal{M}_{a}\rightleftarrows\mathcal{M}_{b} is maximal monotone. \blacksquare

Furthermore, maximal cyclical monotonicity is also preserved under composition as stated in the following theorem.

Theorem 4.3

Let aa××a×\mathcal{M}_{a}\subset{\mathcal{F}}_{a}\times{\mathcal{F}}\times{\mathcal{E}}_{a}\times{\mathcal{E}} and bb××b×\mathcal{M}_{b}\subset{\mathcal{F}}_{b}\times{\mathcal{F}}\times{\mathcal{E}}_{b}\times{\mathcal{E}} be maximal cyclically monotone relations that are generated by proper lower semicontinuous convex functions ϕa:a×(,+]\phi_{a}:{\mathcal{F}}_{a}\times{\mathcal{F}}\rightarrow(-\infty,+\infty] and ϕb:b×(,+]\phi_{b}:{\mathcal{F}}_{b}\times{\mathcal{F}}\rightarrow(-\infty,+\infty], respectively. Let

Cf={(f1,f2)f1Π(domϕa,) and f2Π(domϕa,)}.C_{f}=\{(f_{1},f_{2})\mid f_{1}\in\Pi(\operatorname{dom}\phi_{a},{\mathcal{F}})\text{ and }f_{2}\in\Pi(\operatorname{dom}\phi_{a},{\mathcal{F}})\}.

and

Ce={(e1,e2)f s.t. (f,e1)domϕa and (f,e2)domϕb}.C_{e}=\{(e_{1},e_{2})\mid\exists\,f\text{ s.t. }(f,e_{1})\in\operatorname{dom}\phi_{a}\text{ and }(-f,e_{2})\in\operatorname{dom}\phi_{b}\}.

Suppose that there exists (f¯,e¯)×(\bar{f},\bar{e})\in{\mathcal{F}}\times{\mathcal{E}} such that

  1. (i)

    (f¯,f¯)rintCf(\bar{f},-\bar{f})\in\operatorname{rint}C_{f} and

  2. (ii)

    (e¯,e¯)rintCe(\bar{e},\bar{e})\in\operatorname{rint}C_{e}.

Then, aba×b×a×b\mathcal{M}_{a}\rightleftarrows\mathcal{M}_{b}\subset{\mathcal{F}}_{a}\times{\mathcal{F}}_{b}\times{\mathcal{E}}_{a}\times{\mathcal{E}}_{b} is a maximal cyclically monotone relation that is generated by θ:a×b(,+]\theta^{\star}:{\mathcal{F}}_{a}\times{\mathcal{F}}_{b}\rightarrow(-\infty,+\infty] where θ:a×b(,+]\theta:{\mathcal{E}}_{a}\times{\mathcal{E}}_{b}\rightarrow(-\infty,+\infty] is given by

θ(ea,eb)=ϕ(ea,0,eb)\theta(e_{a},e_{b})=\phi^{\star}(e_{a},0,e_{b})

and ϕ:a××b(,+]\phi:{\mathcal{F}}_{a}\times{\mathcal{F}}\times{\mathcal{F}}_{b}\rightarrow(-\infty,+\infty] is given by

ϕ(fa,f,fb)=ϕa(fa,f)+ϕb(fb,f).\phi(f_{a},f,f_{b})=\phi_{a}(f_{a},f)+\phi_{b}(f_{b},-f).

Proof. Let \mathcal{M}, AA, BB, A\mathcal{M}_{A}, and (A)B{}_{B}(\mathcal{M}_{A}) be as in the proof of Theorem 4.2. Note that \mathcal{M} is generated by the proper lower semicontinuous convex function ϕab:a××b×(,+]\phi_{ab}:{\mathcal{F}}_{a}\times{\mathcal{F}}\times{\mathcal{F}}_{b}\times{\mathcal{F}}\rightarrow(-\infty,+\infty] given by

ϕab(fa,f1,fb,f2)=ϕa(fa,f1)+ϕb(fb,f2).\phi_{ab}(f_{a},f_{1},f_{b},f_{2})=\phi_{a}(f_{a},f_{1})+\phi_{b}(f_{b},f_{2}).

For a proper convex function Ψ:𝒢(,+]\Psi:\mathcal{G}\rightarrow(-\infty,+\infty] and a linear map L:𝒢L:\mathcal{H}\rightarrow\mathcal{G}, let ψL:(,+]\psi\circ L:\mathcal{H}\rightarrow(-\infty,+\infty] denote the function given by hψ(Lh)h\mapsto\psi(Lh). It follows from the definition of A\mathcal{M}_{A} that (fa,f,fb,ea,e,eb)(f_{a},f,f_{b},e_{a},e,e_{b}) if and only if

(39) (ea,e,eb)Aϕab(A(fa,f,fb)).(e_{a},e,e_{b})\in A^{*}\partial\phi_{ab}\big{(}A(f_{a},f,f_{b})\big{)}.

Similar arguments as employed in the proof Theorem 4.2 show that (i) is equivalent to

imArintdomϕab.\operatorname{im}A\cap\operatorname{rint}\operatorname{dom}\phi_{ab}\neq\varnothing.

Then, it follows from [20, Prop. 5.4.5] that Aϕab(Ax)=(ϕabA)(x)A^{*}\partial\phi_{ab}(Ax)=\partial(\phi_{ab}\circ A)(x) for all xa××bx\in{\mathcal{F}}_{a}\times{\mathcal{F}}\times{\mathcal{F}}_{b}. Since ϕab\phi_{ab} is lower semicontinuous, so is ϕabA\phi_{ab}\circ A. As such, we see from (39) that A\mathcal{M}_{A} is maximal cyclically monotone and generated by ϕ=ϕabA\phi=\phi_{ab}\circ A. Now, it follows from (36), the definition of (A)B{}_{B}(\mathcal{M}_{A}), and (11) that (fa,fb,ea,eb)ab(f_{a},f_{b},e_{a},e_{b})\in\mathcal{M}_{a}\rightleftarrows\mathcal{M}_{b} if and only if

(40) (fa,fb)Bϕ(B(ea,eb))(f_{a},f_{b})\in B\partial\phi^{\star}\big{(}B^{*}(e_{a},e_{b})\big{)}

One can show that (ii) is equivalent to

imBrintdomϕ\operatorname{im}B^{*}\cap\operatorname{rint}\operatorname{dom}\phi^{\star}\neq\varnothing

by employing similar arguments to those in the proof of Theorem 4.2. Then, it follows from [20, Prop. 5.4.5] that Bϕ(By)=(ϕB)(y)B\partial\phi^{\star}(B^{*}y)=\partial(\phi^{\star}\circ B^{*})(y) for all ya×by\in{\mathcal{F}}_{a}\times{\mathcal{F}}_{b}. Since ϕ\phi^{\star} is lower semicontinuous, so is ϕB\phi^{\star}\circ B^{*}. Consequently, (40) and (11) imply that ab\mathcal{M}_{a}\rightleftarrows\mathcal{M}_{b} is maximal cyclically monotone and generated by (ϕB)(\phi^{\star}\circ B^{*})^{\star}. Since θ=ϕB\theta=\phi^{\star}\circ B^{*}, this concludes the proof. \blacksquare

The following adaptation of Theorem 4.3 applies to the alternative interconnection e2=f3,e3=f2e_{2}=f_{3},e_{3}=f_{2}. Consider two maximal cyclically monotone relations a,b{\mathcal{M}}_{a},{\mathcal{M}}_{b} with generating convex functions g(e1,e2)g(e_{1},e_{2}) and h(e3,e4)h(e_{3},e_{4}):

(41) a={(e1,e2,f1=e1g,f2=e2g)},b={(e3,e4,f3=e3h,f4=e4h)}{\mathcal{M}}_{a}=\{(e_{1},e_{2},f_{1}=\partial_{e_{1}}g,f_{2}=\partial_{e_{2}}g)\},\quad{\mathcal{M}}_{b}=\{(e_{3},e_{4},f_{3}=\partial_{e_{3}}h,f_{4}=\partial_{e_{4}}h)\}

Assume dime2=dime3\dim e_{2}=\dim e_{3}, and consider the positive feedback interconnection e2=f3,e3=f2e_{2}=f_{3},e_{3}=f_{2}. This yields the relation

:={(e1,e4,f1,f4)e2=f3,e3=f2 s.t. (e1,e2,f1,f2)a,(e3,e4,f3,f4)b}.{\mathcal{M}}\!:=\!\{(e_{1},e_{4},f_{1},f_{4})\!\mid\!\exists e_{2}=f_{3},e_{3}=f_{2}\mbox{ s.t. }(e_{1},e_{2},f_{1},f_{2})\!\in{\mathcal{M}}_{a},(e_{3},e_{4},f_{3},f_{4})\!\in{\mathcal{M}}_{b}\}.
Proposition 4.4

The relation {\mathcal{M}} is maximal cyclically monotone, with generating function

(42) (e1,e4)infe2,e3(g(e1,e2)+h(e3,e4)e2Te3)(e_{1},e_{4})\mapsto\inf_{e_{2},e_{3}}\left(g(e_{1},e_{2})+h(e_{3},e_{4})-e_{2}^{T}e_{3}\right)

Proof. The proof can be directly based on the proof of Theorem 4.3 formulated for the canonical interconnection f2=f3,e2=e3f_{2}=-f_{3},e_{2}=e_{3}. Define hh^{*} as the partial convex conjugate of hh with respect to e3e_{3}, i.e.,

(43) h(f3,e4)=supe3[e3Tf3h(e3,e4)]h^{*}(f_{3},e_{4})=\sup_{e_{3}}\left[e_{3}^{T}f_{3}-h(e_{3},e_{4})\right]

Note that by the definition of the partial convex conjugate

(44) f3h=e3,e4h=e4h\partial_{f_{3}}h^{*}=e_{3},\;\partial_{e_{4}}h^{*}=-\partial_{e_{4}}h

Hence {\mathcal{M}} as obtained from a,b{\mathcal{M}}_{a},{\mathcal{M}}_{b} via the interconnection equations e2=f3,e3=f2e_{2}=f_{3},e_{3}=f_{2}, can be also understood as the canonical interconnection of a{\mathcal{M}}_{a} and b{\mathcal{M}}_{b}^{*}, where

(45) b={(f3,e4,e3=f3h,f4=e4h)}{\mathcal{M}}_{b}^{*}=\{(f_{3},e_{4},e_{3}=\partial_{f_{3}}h^{*},f_{4}=-\partial_{e_{4}}h^{*})\}

Thus in view of Theorem 4.3 {\mathcal{M}} has the generating function

(46) infx[g(e1,x)h(x,e4)]\inf_{x}\left[g(e_{1},x)-h^{*}(x,e_{4})\right]

Substitution of the expression of hh^{*} is immediately seen to result in (42). \blacksquare

An application of Proposition 4.4 is the following. Consider two maximal cyclically monotone port-Hamiltonian systems of the form as given in (14), that is

(47) x˙i=Kiei(Hi(xi),ui),ei=Hi(xi)yi=Kiui(Hi(xi),ui),i=1,2\begin{array}[]{rcl}\dot{x}_{i}&=&-\frac{\partial K_{i}}{\partial e_{i}}(\nabla H_{i}(x_{i}),u_{i}),\quad e_{i}=\nabla H_{i}(x_{i})\\[5.69054pt] y_{i}&=&\frac{\partial K_{i}}{\partial u_{i}}(\nabla H_{i}(x_{i}),u_{i}),\qquad i=1,2\end{array}

Now interconnect both systems by the positive feedback u1=y2,u2=y1u_{1}=y_{2},\,u_{2}=y_{1}. By Proposition 4.4 this leads to the maximal cyclically monotone port-Hamiltonian system

(48) [x˙1x˙2]=[Ke1Ke2](H1(x1),H2(x2)),\begin{bmatrix}\dot{x}_{1}\\[5.69054pt] \dot{x}_{2}\end{bmatrix}=-\begin{bmatrix}\frac{\partial K}{\partial e_{1}}\\[5.69054pt] \frac{\partial K}{\partial e_{2}}\end{bmatrix}(\nabla H_{1}(x_{1}),\nabla H_{2}(x_{2})),

where the convex function K(e1,e2)K(e_{1},e_{2}) is given as

(49) K(e1,e2)=infu1,u2(K1(e1,u2)+K2(e2,u2)u1Tu2)K(e_{1},e_{2})=\inf_{u_{1},u_{2}}\left(K_{1}(e_{1},u_{2})+K_{2}(e_{2},u_{2})-u_{1}^{T}u_{2}\right)
Example 4.5

Consider two gradient algorithms in continuous time, i.e.,

(50) τiq˙i=Piqi(qi)Biuiyi=BiTqi,i=1,2\begin{array}[]{rcl}\tau_{i}\dot{q}_{i}&=&-\frac{\partial P_{i}}{\partial q_{i}}(q_{i})-B_{i}u_{i}\\[5.69054pt] y_{i}&=&B_{i}^{T}q_{i},\qquad i=1,2\end{array}

which converge for ui=0u_{i}=0 to the minimum of the convex functions Pi(qi)P_{i}(q_{i}). Now consider the coupled gradient algorithm that is resulting from the interconnection u1=y2,u2=y1u_{1}=y_{2},u_{2}=y_{1}. This leads to a maximal cyclically monotone port-Hamiltonian system with respect to the convex function determined as

(51) infu1,u2(P1(q1)+P1(q2)+q1TB1u1+q2TB2u2u1Tu2)\inf_{u_{1},u_{2}}\left(P_{1}(q_{1})+P_{1}(q_{2})+q_{1}^{T}B_{1}u_{1}+q_{2}^{T}B_{2}u_{2}-u_{1}^{T}u_{2}\right)

Clearly the minimum is attained for u1=B1Tq2,u2=B2Tq1u_{1}=B_{1}^{T}q_{2},u_{2}=B_{2}^{T}q_{1}, leading to the convex function

(52) P(q1,q2):=P1(q1)+P2(q2)+q1TB1B2Tq2P(q_{1},q_{2}):=P_{1}(q_{1})+P_{2}(q_{2})+q_{1}^{T}B_{1}B_{2}^{T}q_{2}

Hence the coupling of the two gradient algorithms computes the minimum of P(q1,q2)P(q_{1},q_{2}).

5 When are port-Hamiltonian systems incrementally port-Hamiltonian, and conversely

Let us first relate (maximal) (cyclically) monotone relations to the notions of Dirac structures and energy-dissipating relations as used in the definition of port-Hamiltonian systems.

We begin with showing that every Dirac structure is a maximal monotone relation, and maximal cyclically monotone if and only if it belongs to a special subclass of Dirac structures. This special subclass is defined and characterized as follows [21].

Definition 5.1

A Dirac structure 𝒟×\mathcal{D}\subset\mathcal{F}\times\mathcal{E} is separable if

(53) <eafb>=0, for all (fa,ea),(fb,eb)𝒟<e_{a}\mid f_{b}>=0\,,\quad\mbox{ for all }(f_{a},e_{a}),(f_{b},e_{b})\in\mathcal{D}

Separable Dirac structures have the following simple geometric characterization [21].

Proposition 5.2

Any separable Dirac structure 𝒟×\mathcal{D}\subset\mathcal{F}\times{\mathcal{E}} can be written as

(54) 𝒟=𝒦×𝒦\mathcal{D}=\mathcal{K}\times\mathcal{K}^{\perp}

for some subspace 𝒦\mathcal{K}\subset\mathcal{F}, where 𝒦={e<ef>=0,f𝒦}\mathcal{K}^{\perp}=\{e\in{\mathcal{E}}\mid<e\mid f>=0,\forall f\in\mathcal{K}\}. Conversely, any subspace 𝒟\mathcal{D} as in (54) for some 𝒦\mathcal{K}\subset\mathcal{F} is a separable Dirac structure.

Remark 5.3

A typical example of a separable Dirac structure is provided by Kirchhoff’s current and voltage laws of an electrical circuit. Indeed, take e.g. {\mathcal{F}} to be the space of currents, 𝒦\mathcal{K} the space of currents satisfying Kirchhoff’s current laws. Then ={\mathcal{E}}={\mathcal{F}}^{*} is the space of voltages, and 𝒦\mathcal{K}^{\perp} defines Kirchhoff’s voltage laws. Moreover, <eafb>=0<e_{a}\mid f_{b}>=0 for all (fa,ea),(fb,eb)𝒦×𝒦(f_{a},e_{a}),(f_{b},e_{b})\in\mathcal{K}\times\mathcal{K}^{\perp} expresses Tellegen’s law.

Proposition 5.4

Every Dirac structure 𝒟×\mathcal{D}\subset\mathcal{F}\times\mathcal{E} is maximal monotone. It is maximal cyclically monotone if and only if 𝒟\mathcal{D} is separable. If 𝒟\mathcal{D} is the graph of a mapping J:J:{\mathcal{E}}\to{\mathcal{F}} or J:J:{\mathcal{F}}\to{\mathcal{E}} then 𝒟{\mathcal{D}} is cyclically monotone if and only if J=0J=0.

Proof. Let 𝒟×{\mathcal{D}}\subset\mathcal{F}\times\mathcal{E} be a Dirac structure. Let (fi,ei)𝒟(f_{i},e_{i})\in{\mathcal{D}} with i=1,2i=1,2. Since ef=0\langle e\mid f\rangle=0 for all (f,e)𝒟(f,e)\in\mathcal{D} due to Remark 2.2, we obtain by linearity

e1e2f1f2=0.\langle e_{1}-e_{2}\mid f_{1}-f_{2}\rangle=0.

Therefore, 𝒟\mathcal{D} is monotone on ×\mathcal{F}\times\mathcal{E}. Let 𝒟\mathcal{D}^{\prime} be a monotone relation on ×\mathcal{F}\times\mathcal{E} such that 𝒟𝒟\mathcal{D}\subseteq\mathcal{D}^{\prime}. Let (f,e)𝒟(f^{\prime},e^{\prime})\in\mathcal{D}^{\prime} and (f,e)𝒟(f,e)\in\mathcal{D}. Since 𝒟\mathcal{D}^{\prime} is monotone, 𝒟\mathcal{D} is a subspace, and 𝒟𝒟\mathcal{D}\subseteq\mathcal{D}^{\prime}, we have

0eαefαf=efα(ef+ef)0\leqslant\langle e^{\prime}-\alpha e\mid f^{\prime}-\alpha f\rangle=\langle e^{\prime}\mid f^{\prime}\rangle-\alpha(\langle e^{\prime}\mid f\rangle+\langle e\mid f^{\prime}\rangle)

for any α\alpha\in\mathbb{R}. This means that ef+ef=0,\langle e^{\prime}\mid f\rangle+\langle e\mid f^{\prime}\rangle=0, and hence (f,e)𝒟=𝒟(f^{\prime},e^{\prime})\in{\mathcal{D}}^{\perp\!\!\!\perp}={\mathcal{D}}. Therefore, we see that 𝒟𝒟{\mathcal{D}}^{\prime}\subseteq{\mathcal{D}}, and thus 𝒟=𝒟{\mathcal{D}}^{\prime}={\mathcal{D}}. Consequently, 𝒟{\mathcal{D}} is maximal monotone.

Next, let 𝒟\mathcal{D} be separable, i.e. <eafb>=0<e_{a}\mid f_{b}>=0 for all (fa,ea),(fb,eb)𝒟(f_{a},e_{a}),(f_{b},e_{b})\in\mathcal{D}. Then it immediately follows from Definition 3.1 that 𝒟\mathcal{D} is cyclically monotone. Conversely, let 𝒟\mathcal{D} be cyclically monotone. Then take any (fi,ei)𝒟(f_{i},e_{i})\in\mathcal{D} with i{0,1,2}i\in\{0,1,2\}. It follows from Definition 3.1 that

e0f0f1+e1f1f2+e2f2f00.\langle e_{0}\mid f_{0}-f_{1}\rangle+\langle e_{1}\mid f_{1}-f_{2}\rangle+\langle e_{2}\mid f_{2}-f_{0}\rangle\geqslant 0.

Since ef=0\langle e\mid f\rangle=0 for all (f,e)𝒟(f,e)\in\mathcal{D} due to Remark 2.2, we see that

(55) e0f1+e1f2+e2f00.\langle e_{0}\mid-f_{1}\rangle+\langle e_{1}\mid-f_{2}\rangle+\langle e_{2}\mid-f_{0}\rangle\geqslant 0.

As 𝒟\mathcal{D} is a subspace, (f0,e0)𝒟(-f_{0},-e_{0})\in\mathcal{D}. Therefore, we see from (55) that

e0f1+e1f2+e2f00.\langle-e_{0}\mid-f_{1}\rangle+\langle e_{1}\mid-f_{2}\rangle+\langle e_{2}\mid f_{0}\rangle\geqslant 0.

By summing this inequality and (55), we obtain e1f20\langle e_{1}\mid-f_{2}\rangle\geqslant 0. By using the fact that 𝒟\mathcal{D} is a subspace, we see that e1f2=0\langle e_{1}\mid f_{2}\rangle=0, and thus 𝒟\mathcal{D} is separable.

Finally, let 𝒟\mathcal{D} be the graph of a mapping J:J:{\mathcal{E}}\to{\mathcal{F}}. Since 𝒟\mathcal{D} is a Dirac structure necessarily JJ is skew-symmetric. Take again any (fi,ei)𝒟(f_{i},e_{i})\in\mathcal{D} with i{0,1,2}i\in\{0,1,2\}, where now fi=Jeif_{i}=Je_{i}. Then if 𝒟\mathcal{D} is cyclically monotone

e0J(e0e1)+e1J(e1e2)+e2J(e2e0)0\langle e_{0}\mid J(e_{0}-e_{1})\rangle+\langle e_{1}\mid J(e_{1}-e_{2})\rangle+\langle e_{2}\mid J(e_{2}-e_{0})\rangle\geqslant 0

Using eiJei=0\langle e_{i}\mid Je_{i}\rangle=0 by skew-symmetry of JJ this yields e1Je20\langle e_{1}\mid Je_{2}\rangle\geqslant 0 for all e1,e2e_{1},e_{2}, which clearly implies J=0J=0. Similarly for J:J:{\mathcal{F}}\to{\mathcal{E}}. \blacksquare

Remark 5.5

As noticed before, a typical example of a separable Dirac structure is given by Kirchhoff’s current and voltage laws. In particular, it follows that for any electrical circuit there exists a convex function specifying Kirchhoff’s current and voltage laws. Indeed, consider an electrical circuit whose circuit graph is given by the incidence matrix DD. Identify as above {\mathcal{F}} with the set of currents f=If=I through the edges, and ={\mathcal{E}}={\mathcal{F}}^{*} with the set of voltages e=Ve=V across the edges. Then Kirchhoff’s current laws are given as DI=0DI=0 and Kirchhoff’s voltage laws as VimDTV\in\operatorname{im}D^{T}. The convex function generating the resulting separable Dirac structure is given by (see the proof lines of Lemma 5.6)

(56) ϕ(f)={0 if fkerD+ otherwise.\phi(f)=\begin{cases}0&\text{ if }f\in\ker D\\ +\infty&\text{ otherwise}.\end{cases}

An arbitrary energy-dissipating relation need not be a (maximal) monotone relation; as was also demonstrated by some of the examples in the previous section. A special type of energy-dissipating relation that is a maximal cyclically monotone relation is that of a linear energy-dissipating relation which is of maximal dimension. Such an energy-dissipating relation in the port-variables (f,e)×(f,e)\in\mathcal{F}\times\mathcal{E} can be represented as a subspace

(57) ={(f,e)×RffRee=0},\mathcal{R}=\{(f,e)\in{\mathcal{F}}\times{\mathcal{E}}\mid R_{f}f-R_{e}e=0\},

where the matrices Rf,ReR_{f},R_{e} satisfy the property

(58) RfReT=ReRfT0,R_{f}R_{e}^{T}=R_{e}R_{f}^{T}\geqslant 0,

together with the dimensionality condition

(59) rank[RfRe]=dim.\operatorname{rank}\begin{bmatrix}R_{f}&R_{e}\end{bmatrix}=\dim\mathcal{F}.

First of all, this is seen to define an energy-dissipating relation as follows. By the dimensionality condition (59) and the equality in (58) we can equivalently rewrite the kernel representation (57) as an image representation

(60) f=ReTλ,e=RfTλ.f=R_{e}^{T}\lambda,\quad e=R_{f}^{T}\lambda.

That is, any pair (f,e)(f,e) satisfying (57) also satisfies (60) for some λ\lambda, and conversely, every (f,e)(f,e) satisfying (60) for some λ\lambda also satisfies (57). Hence by (58) for all (f,e)(f,e) satisfying (57)

(61) eTf=(RfTλ)TReTλ=λTRfReTλ0e^{T}f=\left(R_{f}^{T}\lambda\right)^{T}R_{e}^{T}\lambda=\lambda^{T}R_{f}R_{e}^{T}\lambda\geqslant 0

A subspace ×\mathcal{R}\subset{\mathcal{F}}\times{\mathcal{E}} as in (57) where Rf,ReR_{f},R_{e} satisfy (58) and (59) is called a linear resistive structure. A linear resistive structure can be regarded as a geometric object having properties which are opposite to those of a Dirac structure, in the sense that a Dirac structure can be regarded as the generalization of a skew-symmetric map, while a linear resistive relation as the generalization of a positive semi-definite symmetric map. (Geometrically \mathcal{R} defines a Lagrangian subspace of the linear space ×\mathcal{F}\times\mathcal{E}.)

It turns out that every linear resistive structure ×\mathcal{R}\subset\mathcal{F}\times\mathcal{E} is maximal cyclically monotone. To elaborate further, note that there exists R=RT0R=R^{T}\geqslant 0 such that

(62) ReRReT=ReRfTR_{e}RR_{e}^{T}=R_{e}R_{f}^{T}

due to [22, Thm. 2.5]. In general, RR is not unique but the matrix RReTRR_{e}^{T} does not depend on the choice of R=RT0R=R^{T}\geqslant 0 satisfying (62). Now, define the extended real-valued convex function

(63) ϕ(f)={12fTRf if fimReT+ otherwise.\phi_{\mathcal{R}}(f)=\begin{cases}\frac{1}{2}f^{T}Rf&\text{ if }f\in\operatorname{im}R_{e}^{T}\\ +\infty&\text{ otherwise}.\end{cases}

With these preparations, we can state the following characterization for linear resistive structures.

Lemma 5.6

Let ×\mathcal{R}\subset\mathcal{F}\times\mathcal{E} be a linear resistive structure and 𝒟×××\mathcal{D}\subset{\mathcal{F}}^{\prime}\times\mathcal{F}\times\mathcal{E}^{\prime}\times\mathcal{E} be a Dirac structure. Then, the following statements hold:

  1. (a)

    \mathcal{R} is generated by ϕ\phi_{\mathcal{R}} and hence is maximal cyclically monotone.

  2. (b)

    The composition 𝒟\mathcal{D}\rightleftarrows\mathcal{R} is maximal monotone.

  3. (c)

    Any port-Hamiltonian system with Dirac structure and linear resistive structure is maximal monotone port-Hamiltonian.

Proof. (a): Clearly, ϕ\phi_{\mathcal{R}} is a proper lower semicontinuous function with domϕ=imReT\operatorname{dom}\phi=\operatorname{im}R_{e}^{T} and

(64) ϕ(f)={Rf+kerRe if fimReT otherwise.\partial\phi_{\mathcal{R}}(f)=\begin{cases}Rf+\ker R_{e}&\text{ if }f\in\operatorname{im}R_{e}^{T}\\ \varnothing&\text{ otherwise}.\end{cases}

Now, we claim that \mathcal{R} is generated by ϕ\phi_{\mathcal{R}} and hence maximal cyclically monotone. To verify this claim, one needs to show that

(65) ={(f,e)eϕ(f)}.\mathcal{R}=\{(f,e)\mid e\in\partial\phi_{\mathcal{R}}(f)\}.

To see this, first let (f,e)(f,e)\in\mathcal{R}. Then, we see from (60) that f=ReTλf=R_{e}^{T}\lambda and e=RfTλe=R_{f}^{T}\lambda for some λ\lambda. Note that

(66) im(RReTRfT)kerRe\operatorname{im}(RR_{e}^{T}-R_{f}^{T})\subseteq\ker R_{e}

due to (62). As such there must exist μkerRe\mu\in\ker R_{e} such that RfTλ=RReTλ+μR_{f}^{T}\lambda=RR_{e}^{T}\lambda+\mu. Therefore, it follows from (64) that eϕ(f)e\in\partial\phi_{\mathcal{R}}(f). This proves that

(67) {(f,e)eϕ(f)}.\mathcal{R}\subseteq\{(f,e)\mid e\in\partial\phi_{\mathcal{R}}(f)\}.

To see that the reverse inclusion also holds, let (f,e)(f,e) be such that eϕ(f)e\in\partial\phi_{\mathcal{R}}(f). From (64), we see that there exist λ\lambda and μkerRe\mu\in\ker R_{e} such that f=ReTλf=R_{e}^{T}\lambda and e=RReTλ+μe=RR_{e}^{T}\lambda+\mu. Since kerReRfTkerReT\ker R_{e}\subseteq R_{f}^{T}\ker R_{e}^{T} due to (57) and (60), it follows from (66) that e=RfT(λ+θ)e=R_{f}^{T}(\lambda+\theta) where θkerReT\theta\in\ker R_{e}^{T}. Note that f=ReTλ=ReT(λ+θ)f=R_{e}^{T}\lambda=R_{e}^{T}(\lambda+\theta). Consequently, we see that

(68) {(f,e)eϕ(f)}\{(f,e)\mid e\in\partial\phi_{\mathcal{R}}(f)\}\subseteq\mathcal{R}

which, together with (67), proves (65).

(b): Note first that \mathcal{R} is clearly maximal monotone. Since both 𝒟\mathcal{D} and \mathcal{R} are subspaces, the sets Π(𝒟,)\Pi(\mathcal{D},\mathcal{F}), Π(,)\Pi(\mathcal{R},\mathcal{F}), Π(𝒟,×)\Pi(\mathcal{D},\mathcal{F}\times\mathcal{E}), and Π(,×)=\Pi(\mathcal{R},\mathcal{F}\times\mathcal{E})=\mathcal{R} are all subspaces. As such, the conditions (i) and (ii) of Theorem 4.2 are trivially satisfied by the choices f¯=0=e¯\bar{f}=0=\bar{e}. Consequently, the composition 𝒟\mathcal{D}\rightleftarrows\mathcal{R} is maximal monotone.

(c): This immediately follows from the fact that the definition of a port-Hamiltonian system entails the composition 𝒟\mathcal{D}\rightleftarrows\mathcal{R} of 𝒟\mathcal{D} and \mathcal{R}. \blacksquare

Furthermore, if we replace in the definition of a port-Hamiltonian system the energy-dissipating relation \mathcal{R} by a relation \mathcal{R}^{\prime} such that -\mathcal{R}^{\prime} is monotone, then also 𝒟\mathcal{D}\rightleftarrows\mathcal{R}^{\prime} is monotone, and thus we obtain a monotone port-Hamiltonian system (which is however not necessarily port-Hamiltonian).

6 Steady state analysis of incrementally port-Hamiltonian systems

In this section we utilize the theory from the previous section to analyze the set of steady states (for non-zero constant inputs) of an incrementally port-Hamiltonian system and of interconnections of incrementally port-Hamiltonian systems. For simplicity of exposition, we will denote throughout this section 𝒴:=P,𝒰:=P\mathcal{Y}:=\mathcal{F}_{P},\mathcal{U}:=\mathcal{E}_{P}, and correspondingly set y=fP,u=ePy=f_{P},u=e_{P}.

6.1 The steady-state input-output relation

First recall the notion of
steady-state input-output relation. Consider an input-state-output system Σ\Sigma given as

(69) Σ:x˙=f(x,u),xn,umy=h(x,u),ym\Sigma:\quad\begin{array}[]{rcl}\dot{x}&=&f(x,u),\quad x\in\mathbb{R}^{n},u\in\mathbb{R}^{m}\\[5.69054pt] y&=&h(x,u),\quad y\in\mathbb{R}^{m}\end{array}

Consider any constant input vector u¯\bar{u} for which there exists an x¯n\bar{x}\in\mathbb{R}^{n} with 0=f(x¯,u¯)0=f(\bar{x},\bar{u}), and denote y¯=h(x¯,u¯)\bar{y}=h(\bar{x},\bar{u}). Then the set of all such pairs (y¯,u¯)(\bar{y},\bar{u}), i.e.,

(70) 𝒢={(y¯,u¯)x¯,0=f(x¯,u¯),y¯=h(x¯,u¯)}\mathcal{G}=\{(\bar{y},\bar{u})\mid\exists\bar{x},0=f(\bar{x},\bar{u}),\bar{y}=h(\bar{x},\bar{u})\}

is called the steady-state input-output relation of Σ\Sigma.

In the case of incrementally port-Hamiltonian systems more can be said about the structure of steady-state input-output relations. First we note the following direct applications of Theorem 4.2 and Theorem 4.3 .

Corollary 6.1

Consider an incrementally port-Hamiltonian system with underlying maximal monotone relation S×S×𝒴×𝒰\mathcal{M}\subset\mathcal{F}_{S}\times\mathcal{E}_{S}\times\mathcal{Y}\times\mathcal{U}. Assume {\mathcal{M}} satisfies

(71) 0rintΠ(,S)0\in\operatorname{rint}\Pi({\mathcal{M}},{\mathcal{F}}_{S})

and

(72)  there exists e¯ such that e¯rint{eS(0,eS)Π(,S×S}\text{ there exists }\bar{e}\text{ such that }\bar{e}\in\operatorname{rint}\{e_{S}\mid(0,e_{S})\in\Pi({\mathcal{M}},{\mathcal{F}}_{S}\times{\mathcal{E}}_{S}\}

Then

(73) s={(y,u)eS such that (0,eS,y,u)}\mathcal{M}_{s}=\{(y,u)\mid\exists e_{S}\mbox{ such that }(0,e_{S},y,u)\in\mathcal{M}\}

is also a maximal monotone relation.

Furthermore, in case the maximal monotone relation is cyclically monotone, and thus is given as the subdifferential of some convex function K(eS,u)K(e_{S},u), then

(74) s=graph (Ks),\mathcal{M}_{s}=\mbox{graph }(\partial K_{s}),

where the convex function Ks:𝒰K_{s}:\mathcal{U}\to\mathbb{R} is given as

Ks(u)=K(0,u)K_{s}(u)=K^{*}(0,u)

with K(fS,u)K^{*}(f_{S},u) the partial convex conjugate of KK with respect to eSe_{S}.

Proof. First note that s{\mathcal{M}}_{s} is the composition of \mathcal{M} with the trivial maximally monotone relation {(fS=0,eS)S×S}\{(f_{S}=0,e_{S})\in\mathcal{F}_{S}\times\mathcal{E}_{S}\}. Thus in order to apply Theorem 4.2 we need to show that there exists (f¯S,e¯S)S×S(\bar{f}_{S},\bar{e}_{S})\in{\mathcal{F}}_{S}\times{\mathcal{E}}_{S} such that (following the notation of Theorem 4.2)

(i)(f¯S,f¯S)rint𝒟f(ii)(e¯S,e¯S)rint𝒟e\begin{array}[]{l}(i)(\bar{f}_{S},-\bar{f}_{S})\in\operatorname{rint}{\mathcal{D}}_{f}\\[5.69054pt] (ii)(\bar{e}_{S},\bar{e}_{S})\in\operatorname{rint}{\mathcal{D}}_{e}\end{array}

where 𝒟f=Π(,S)×0{\mathcal{D}}_{f}=\Pi({\mathcal{M}},{\mathcal{F}}_{S})\times 0 and 𝒟e={(e1,e2)(0,e1)Π(,S×S}{\mathcal{D}}_{e}=\{(e_{1},e_{2})\mid(0,e_{1})\in\Pi({\mathcal{M}},{\mathcal{F}}_{S}\times{\mathcal{E}}_{S}\}. It is easily seen that conditions (i),(ii)(i),(ii) reduce to (71) and (72).

The rest of the proof follows from Theorem 4.3. \blacksquare

From now on we will throughout assume that the conditions (71), (72) are satisfied, implying that s{\mathcal{M}}_{s} is maximal monotone.

It is directly seen that the steady-state input-output relation 𝒢{\mathcal{G}} of the maximal monotone port-Hamiltonian system with maximal monotone relation {\mathcal{M}} is contained in the maximal monotone relation s{\mathcal{M}}_{s}. Indeed, if u¯,x¯,y¯\bar{u},\bar{x},\bar{y} is such that (0,Hx(x¯),y¯,u¯)(0,\frac{\partial H}{\partial x}(\bar{x}),\bar{y},\bar{u})\in{\mathcal{M}} (and thus (y¯,u¯)𝒢(\bar{y},\bar{u})\in{\mathcal{G}}) then clearly (0,eS,y¯,u¯)(0,e_{S},\bar{y},\bar{u})\in{\mathcal{M}}, where eS=Hx(x¯)e_{S}=\frac{\partial H}{\partial x}(\bar{x}). Consequently, 𝒢{\mathcal{G}} is at least monotone.

However s{\mathcal{M}}_{s} may be larger than 𝒢{\mathcal{G}} since there may not exist for every eSe_{S} such that (0,eS,y¯,u¯)(0,e_{S},\bar{y},\bar{u})\in{\mathcal{M}} an x¯\bar{x} such that eS=Hx(x¯)e_{S}=\frac{\partial H}{\partial x}(\bar{x}). In fact, this non-existence of x¯\bar{x} may be due to two reasons. First, the Hamiltonian HH may be such that there does not exist for any eSe_{S} an xx (not necessarily a steady state) such that eS=Hx(x)e_{S}=\frac{\partial H}{\partial x}(x). Secondly, if such an xx exists it may not be a steady state. A simple example illustrating the second reason is provided by the nonlinear integrator

x˙=u,y=Hx(x),\dot{x}=u,\,y=\frac{\partial H}{\partial x}(x),

where we assume that HH is a strictly convex function such that the mapping xHx(x)x\mapsto\frac{\partial H}{\partial x}(x) is surjective. This defines an incrementally port-Hamiltonian system with

={(fS,eS,y,u)fS=u,y=eS}\mathcal{M}=\{(f_{S},e_{S},y,u)\mid f_{S}=-u,y=e_{S}\}

Clearly, s={(y,u)u=0}{\mathcal{M}}_{s}=\{(y,u)\mid u=0\}. However the set of steady states x¯\bar{x} is either empty or is given as the singleton {x¯Hx(x¯)=0}\{\bar{x}\mid\frac{\partial H}{\partial x}(\bar{x})=0\}, implying that also 𝒢{\mathcal{G}} is a singleton, and hence not equal to s{\mathcal{M}}_{s}.

6.2 Equilibrium independent passivity

Up to now, no conditions were imposed on the Hamiltonian HH in the definition of an incrementally port-Hamiltonian system. If additionally HH is strictly convex, as well as differentiable, then for every x¯\bar{x} the function Sx¯:𝒳S_{\bar{x}}:\mathcal{X}\to\mathbb{R} defined as

(75) Hx¯(x):=H(x)HxT(x¯)(xx¯)H(x¯)H_{\bar{x}}(x):=H(x)-\frac{\partial H}{\partial x^{T}}(\bar{x})(x-\bar{x})-H(\bar{x})

(as a function of xx and x¯\bar{x} also called the Bregman divergence of HH [23], or as a function of xx alone for fixed x¯\bar{x} the shifted Hamiltonian [1]) has a strict minimum at x¯\bar{x}, and is again strictly convex. Furthermore,

Hx¯x(x)=Hx(x)Hx(x¯)\frac{\partial H_{\bar{x}}}{\partial x}(x)=\frac{\partial H}{\partial x}(x)-\frac{\partial H}{\partial x}(\bar{x})

Hence for any (u¯,y¯)(\bar{u},\bar{y}) in the steady-state input-output relation of an incrementally port-Hamiltonian system one computes

(76) ddtHx¯=Sx¯xT(x)x˙=(HxT(x)HxT(x¯))(x˙0)(yy¯)T(uu¯),\frac{d}{dt}H_{\bar{x}}=\frac{\partial S_{\bar{x}}}{\partial x^{T}}(x)\dot{x}=\left(\frac{\partial H}{\partial x^{T}}(x)-\frac{\partial H}{\partial x^{T}}(\bar{x})\right)(\dot{x}-0)\leqslant(y-\bar{y})^{T}(u-\bar{u}),

implying passivity with respect to the shifted passivity supply rate (yy¯)T(uu¯)(y-\bar{y})^{T}(u-\bar{u}). This was called shifted passivity in [1], while the property that this holds for any steady state values (u¯,x¯,y¯)(\bar{u},\bar{x},\bar{y}) was coined as equilibrium independent passivity in [12]. Summarizing

Proposition 6.2

Consider a maximal monotone port-Hamiltonian system with respect to the maximal monotone relation

n×n×m×m,\mathcal{M}\subset\mathbb{R}^{n}\times\mathbb{R}^{n}\times\mathbb{R}^{m}\times\mathbb{R}^{m},

with a strictly convex differentiable Hamiltonian H:nH:\mathbb{R}^{n}\to\mathbb{R}. Then the system is equilibrium independent passive, with static input-output relation given by the monotone relation 𝒢𝒢\mathcal{G}\subset\mathcal{G}_{\mathcal{M}}, and with storage functions Hx¯H_{\bar{x}} having a strict minimum at x¯\bar{x}. If additionally HH is such that for every e¯x\bar{e}_{x} there exists an x¯\bar{x} with e¯=Hx(x¯)\bar{e}=\frac{\partial H}{\partial x}(\bar{x}) then 𝒢=𝒢\mathcal{G}=\mathcal{G}_{\mathcal{M}}.

The case 𝒢=𝒢\mathcal{G}=\mathcal{G}_{\mathcal{M}} was called maximal equilibrium independent passivity in [11]. (Maximal) equilibrium independent passivity is a desirable property for showing (asymptotic) stability of the steady state values of a port-Hamiltonian system for different constant input values, since by (76) the shifted Hamiltonians can be employed as Lyapunov functions for u=u¯u=\bar{u}.

6.3 Determination of the steady state of the interconnection of incrementally port-Hamiltonian systems

In this subsection we analyze how the steady-state of the interconnection of multiple maximal cyclically monotone port-Hamiltonian systems can be computed, under additional assumptions, by solving a convex optimization problem. This subsection is motivated by some of the developments in [11].

Consider kk maximal monotone port-Hamiltonian systems with input and output vectors uimi,yimi,u_{i}\in\mathbb{R}^{m_{i}},y_{i}\in\mathbb{R}^{m_{i}}, and maximal monotone relations i,i=1,,k{\mathcal{M}}_{i},i=1,\cdots,k. Let, as before, ismi×mi,i=1,,k\mathcal{M}^{s}_{i}\subset\mathbb{R}^{m_{i}}\times\mathbb{R}^{m_{i}},i=1,\cdots,k be maximal monotone relations. Additionally, assume that is,i=1,,k\mathcal{M}^{s}_{i},i=1,\cdots,k are maximal cyclically monotone, and thus the graphs of subdifferentials of convex functions Ki(ui),i=1,,kK_{i}(u_{i}),i=1,\cdots,k.

Consider now an interconnection of the following general type. For any subset π{1,,k}\pi\subset\{1,\cdots,k\} define

(77) fi:=ui,iπ,fi:=yi,iπei:=yi,iπ,ei:=ui,iπ\begin{array}[]{rclrl}f_{i}&:=&u_{i},\quad i\in\pi,\quad f_{i}&:=&y_{i},\quad i\notin\pi\\[5.69054pt] e_{i}&:=&y_{i},\quad i\in\pi,\quad e_{i}&:=&u_{i},\quad i\notin\pi\end{array}

Furthermore, consider any subspace 𝒞\mathcal{C} of the linear space of variables (f1,,fk)m1×,mk(f_{1},\cdots,f_{k})\in\mathbb{R}^{m_{1}}\times\cdots,\mathbb{R}^{m_{k}}, and define interconnection constraints

(78) (f1,,fk)𝒞,(e1,,ek)𝒞(f_{1},\cdots,f_{k})\in\mathcal{C},\quad(e_{1},\cdots,e_{k})\in\mathcal{C}^{\perp}

The main message of this subsection is that finding a steady state of the interconnected system can be performed by solving a convex minimization problem. Define the convex function K:m1××mk{}K:\mathbb{R}^{m_{1}}\times\cdots\times\mathbb{R}^{m_{k}}\to\mathbb{R}\cup\{\infty\} given as

(79) K(f1,,fk):=iπKi(ui)+iπKi(yi)K(f_{1},\cdots,f_{k}):=\sum_{i\in\pi}K_{i}(u_{i})+\sum_{i\notin\pi}K_{i}^{*}(y_{i})

Now consider the minimization

(80) min(f1,,fk)𝒞K(f1,,fk)\min_{(f_{1},\cdots,f_{k})\in\mathcal{C}}K(f_{1},\cdots,f_{k})

and write 𝒞=kerC\mathcal{C}=\ker C for some constraint matrix C=col(C1,,Ck)C=\operatorname{col}(C_{1},\cdots,C_{k}). Then the minimization is equivalent to the unconstrained minimization

(81) min(f1,,fk),λK(f1,,fk)isλiTCifi\min_{(f_{1},\cdots,f_{k}),\lambda}K(f_{1},\cdots,f_{k})-\sum_{i}^{s}\lambda_{i}^{T}C_{i}f_{i}

where λ\lambda is a corresponding vector of Lagrange multipliers. This yields the first-order optimality conditions

(82) 0Kiui(ui)CiTλ,iπ0Kiyi(yi)CiTλ,iπ\begin{array}[]{l}0\in\frac{\partial K_{i}}{\partial u_{i}}(u_{i})-C_{i}^{T}\lambda,\quad i\in\pi\\[5.69054pt] 0\in\frac{\partial K^{*}_{i}}{\partial y_{i}}(y_{i})-C_{i}^{T}\lambda,\quad i\notin\pi\end{array}

Consider a solution (f¯1,,f¯k)𝒞(\bar{f}_{1},\cdots,\bar{f}_{k})\in\mathcal{C} of these first-order optimality conditions. Hence there exist e¯i=y¯iKiui(u¯i),iπ,\bar{e}_{i}=\bar{y}_{i}\in\frac{\partial K_{i}}{\partial u_{i}}(\bar{u}_{i}),i\in\pi, and e¯i=u¯iKiyi(y¯i),iπ,\bar{e}_{i}=\bar{u}_{i}\in\frac{\partial K^{*}_{i}}{\partial y_{i}}(\bar{y}_{i}),i\notin\pi, such that e¯imCT\bar{e}\in\operatorname{im}C^{T}, which is nothing else than e¯𝒞\bar{e}\in\mathcal{C}^{\perp}.

This yields the following theorem regarding the equilibrium of the interconnection of maximal cyclically monotone port-Hamiltonian systems.

Theorem 6.3

Consider kk maximal cyclically monotone port-Hamiltonian systems with input and output variables u1,,uk,y1,,yku_{1},\cdots,u_{k},y_{1},\cdots,y_{k} where uimi,yimi,i=1,,ku_{i}\in\mathbb{R}^{m_{i}},y_{i}\in\mathbb{R}^{m_{i}},i=1,\cdots,k. Assume that the maximal monotone relations 𝒢imi×mi{\mathcal{G}_{\mathcal{M}}}_{i}\subset\mathbb{R}^{m_{i}}\times\mathbb{R}^{m_{i}} are given as the graph of subdifferentials Ki\partial K_{i} for convex functions Ki,i=1,,kK_{i},i=1,\cdots,k. Furthermore, let π{1,,k}\pi\subset\{1,\cdots,k\} be an index set and consider any constraint subspace 𝒞m1×,mk\mathcal{C}\subset\mathbb{R}^{m_{1}}\times\cdots,\mathbb{R}^{m_{k}} leading to the interconnection

(f1,,fk)𝒞,(e1,,ek)𝒞(f_{1},\cdots,f_{k})\in\mathcal{C},(e_{1},\cdots,e_{k})\in\mathcal{C}^{\perp}

Then if (f¯1,,f¯k)𝒞(\bar{f}_{1},\cdots,\bar{f}_{k})\in\mathcal{C} is a solution of the minimization

min(f1,,fk)𝒞K(f1,,fk)\min_{(f_{1},\cdots,f_{k})\in\mathcal{C}}K(f_{1},\cdots,f_{k})

then there exists (e¯1,,e¯k)𝒞(\bar{e}_{1},\cdots,\bar{e}_{k})\in\mathcal{C}^{\perp}.

Note that once we have computed (e¯1,,e¯k)(\bar{e}_{1},\cdots,\bar{e}_{k}) and there exists (x¯1,,x¯k)(\bar{x}_{1},\cdots,\bar{x}_{k}) such that Hixi(x¯i)=e¯i,i=1,,k\frac{\partial H_{i}}{\partial x_{i}}(\bar{x}_{i})=\bar{e}_{i},i=1,\cdots,k, then this means that (x¯1,,x¯k)(\bar{x}_{1},\cdots,\bar{x}_{k}) is an equilibrium of the interconnected system. Furthermore, if we additionally assume that the Hamiltonians HiH_{i} are strictly convex, it follows that this equilibrium is stable.

Finally, note that the interconnection constraints can be equivalently formulated as the solution of the dual minimization problem

(83) min(e1,,ek)𝒞K(e1,,ek)\min_{(e_{1},\cdots,e_{k})\in\mathcal{C}^{\perp}}K^{*}(e_{1},\cdots,e_{k})

where

(84) K(e1,,ek):=iπKi(yi)+iπKi(ui)K^{*}(e_{1},\cdots,e_{k}):=\sum_{i\in\pi}K^{*}_{i}(y_{i})+\sum_{i\notin\pi}K_{i}(u_{i})

7 Connections with other passivity notions

In the previous section we already observed that the notion of incrementally port-Hamiltonian systems is closely related to shifted passivity and equilibrium independent passivity. In this section we will discuss how it is closely related to incremental passivity and differential passivity as well; at least in case the Hamiltonian is quadratic-affine. Thus let H(x)=12xTQx+Ax+cH(x)=\frac{1}{2}x^{T}Qx+Ax+c for some symmetric positive semi-definite matrix QQ, matrix AA and constant cc. In this case, the inequality (13) reduces to

(85) Q(x1x2)x˙1x˙2eP1eP2fP1fP2\langle Q(x_{1}-x_{2})\mid\dot{x}_{1}-\dot{x}_{2}\rangle\leqslant\langle e_{P}^{1}-e_{P}^{2}\mid f_{P}^{1}-f_{P}^{2}\rangle

which is equivalent to

(86) ddt12(x1(t)x2(t))TQ(x1(t)x2(t))(eP1(t)eP2(t))T(fP1(t)fP2(t))\frac{d}{dt}\frac{1}{2}(x_{1}(t)-x_{2}(t))^{T}Q(x_{1}(t)-x_{2}(t))\leqslant(e_{P}^{1}(t)-e_{P}^{2}(t))^{T}(f_{P}^{1}(t)-f_{P}^{2}(t))

Recall [4, 24, 25] that a system x˙=f(x,u),y=h(x,u)\dot{x}=f(x,u),y=h(x,u) with xn,u,ymx\in\mathbb{R}^{n},u,y\in\mathbb{R}^{m} is called incrementally passive if there exists a nonnegative function V:n×nV:\mathbb{R}^{n}\times\mathbb{R}^{n}\to\mathbb{R} such that

(87) ddtV(x1,x2)(u1u2)T(y1y2)\frac{d}{dt}V(x_{1},x_{2})\leqslant(u_{1}-u_{2})^{T}(y_{1}-y_{2})

for all (xi,ui,yi),i=1,2(x_{i},u_{i},y_{i}),i=1,2 satisfying x˙=f(x,u),y=h(x,u)\dot{x}=f(x,u),y=h(x,u). We immediately obtain the following result.

Proposition 7.1

Any incrementally port-Hamiltonian system with quadratic-affine Hamiltonian H(x)=12xTQx+Ax+cH(x)=\frac{1}{2}x^{T}Qx+Ax+c with Q0Q\geqslant 0 is incrementally passive.

Proof. The function V(x1,x2)=12(x1x2)TQ(x1x2)V(x_{1},x_{2})=\frac{1}{2}(x_{1}-x_{2})^{T}Q(x_{1}-x_{2}) is immediately seen to define an incremental storage function for incremental passivity. \blacksquare

Recall furthermore from [26, 27, 28] the following definition of differential passivity.

Definition 7.2

Consider a nonlinear control system Σ\Sigma with state space 𝒳{\mathcal{X}}, affine in the inputs uu, and with an equal number of outputs yy, given as

(88) Σ:x˙=f(x)+j=1mujgj(x),yj=Hj(x),j=1,,m,\Sigma:\left.\begin{array}[]{l}\displaystyle{\dot{x}=f(x)+\sum_{j=1}^{m}u_{j}g_{j}(x)}\,,\\ y_{j}=H_{j}(x)\,,\quad j=1,\ldots,m\,,\end{array}\right.

The variational system along any input-state-output trajectory

t[0,T](x(t),u(t),y(t))t\in[0,T]\mapsto(x(t),u(t),y(t))

is given by the following time-varying system, cf. [29]

(89) δx˙(t)=fx(x(t))δx(t)+j=1muj(t)gjx(x(t))δx(t)+j=1mδujgj(x(t))δyj(t)=Hjx(x(t))δx(t),j=1,,m,\begin{array}[]{rcl}\dot{\delta x}(t)&=&\frac{\partial f}{\partial x}(x(t))\delta x(t)+\\[5.69054pt] &&\sum_{j=1}^{m}u_{j}(t)\frac{\partial g_{j}}{\partial x}(x(t))\delta x(t)+\sum_{j=1}^{m}\delta u_{j}g_{j}(x(t))\\[5.69054pt] \delta y_{j}(t)&=&\frac{\partial H_{j}}{\partial x}(x(t))\delta x(t)\,,\quad j=1,\ldots,m\,,\end{array}

with state δxn\delta x\in{}^{n}, where δu=(δu1,,δum)\delta u=(\delta u_{1},\ldots,\delta u_{m}), δy=(δy1,,δym)\delta y=(\delta y_{1},\ldots,\delta y_{m}) denote the inputs and the outputs of the variational system. Then Σ\Sigma is called differentially passive if the system together with all its variational systems is dissipative with respect to the supply rate δuTδy\delta u^{T}\delta y, that is, if there exists a function P:T𝒳+P:T{\mathcal{X}}\to\mathbb{R}^{+} (called the differential storage function) satisfying

(90) ddtPδuTδy\frac{d}{dt}P\leqslant\delta u^{T}\delta y

for all x,u,δux,u,\delta u.

Similar to incremental passivity we obtain

Proposition 7.3

A monotone port-Hamiltonian system with quadratic-affine Hamiltonian H(x)=12xTQx+Ax+cH(x)=\frac{1}{2}x^{T}Qx+Ax+c with Q0Q\geqslant 0 is differentially passive.

Proof. Consider the infinitesimal version of (13). In fact, let (fP1,eP1,x1)(f_{P}^{1},e_{P}^{1},x_{1}) and (fP2,eP2,x2)(f_{P}^{2},e_{P}^{2},x_{2}) be two triples of system trajectories arbitrarily near each other. Taking the limit we deduce from (13)

(91) δxT2Hx2(x)δx˙δePTδfP\delta x^{T}\frac{\partial^{2}H}{\partial x^{2}}(x)\delta\dot{x}\leqslant\delta e_{P}^{T}\delta f_{P}

where δx\delta x denotes the variational state, and fP,eP\partial f_{P},\partial e_{P} the variational inputs and outputs). If the Hamiltonian HH is a quadratic function H(x)=12xTQx+Ax+cH(x)=\frac{1}{2}x^{T}Qx+Ax+c then the left-hand side of the inequality (91) is equal to ddt12δxTQδx\frac{d}{dt}\frac{1}{2}\delta x^{T}Q\delta x, and hence amounts to the differential dissipativity inequality

(92) ddt12δxTQδxδePTδfP,\frac{d}{dt}\frac{1}{2}\delta x^{T}Q\delta x\leqslant\delta e_{P}^{T}\delta f_{P},

implying that the monotone port-Hamiltonian system is differentially passive, with differential storage function 12δxTQδx\frac{1}{2}\delta x^{T}Q\delta x. \blacksquare

Of course, the assumption of a quadratic-affine Hamiltonian H(x)=12xTQx+Ax+cH(x)=\frac{1}{2}x^{T}Qx+Ax+c in order to let the monotone port-Hamiltonian system be incrementally passive and differentially passive is restrictive. On the other hand, it is known from the literature [30, 3] that for ’unconditional’ incremental properties such an assumption may be necessary as well. For example we can formulate the following simple result. Consider a scalar nonlinear integrator system

(93) x˙=u,y=dHdx(x)\dot{x}=u,\quad y=\frac{dH}{dx}(x)

In order to evaluate its incremental properties consider two copies

(94) x˙1=u1,x˙2=u2,y1=dHdx1(x1),y2=dHdx2(x2)\dot{x}_{1}=u_{1},\dot{x}_{2}=u_{2},\quad y_{1}=\frac{dH}{dx_{1}}(x_{1}),y_{2}=\frac{dH}{dx_{2}}(x_{2})

Then the system (93) is incrementally passive iff there exists S(x1,x2)0S(x_{1},x_{2})\geqslant 0 satisfying

(95) Sx1(x1)u1+Sx2(x2)u2(u1u2)(dHdx1(x1)dHdx2(x2))\frac{\partial S}{\partial x_{1}}(x_{1})u_{1}+\frac{\partial S}{\partial x_{2}}(x_{2})u_{2}\leqslant\big{(}u_{1}-u_{2}\big{)}\big{(}\frac{dH}{dx_{1}}(x_{1})-\frac{dH}{dx_{2}}(x_{2})\big{)}

for all x1,x2,u1,u2x_{1},x_{2},u_{1},u_{2} related by (94). This is equivalent to

(96) Sx1(x1,x2)=dHdx1(x1)dHdx2(x2)=Sx2(x1,x2)\frac{\partial S}{\partial x_{1}}(x_{1},x_{2})=\frac{dH}{dx_{1}}(x_{1})-\frac{dH}{dx_{2}}(x_{2})=-\frac{\partial S}{\partial x_{2}}(x_{1},x_{2})

for all x1,x2x_{1},x_{2}. Differentiation of the first equality with respect to x2x_{2}, and of the second equality with respect to x1x_{1}, yields

(97) d2Hdx22(x2)=2Sx1x2(x1,x2)=d2Hdx12(x1),-\frac{d^{2}H}{dx^{2}_{2}}(x_{2})=\frac{\partial^{2}S}{\partial x_{1}\partial x_{2}}(x_{1},x_{2})=-\frac{d^{2}H}{dx^{2}_{1}}(x_{1}),

implying that d2Hdx2(x)\frac{d^{2}H}{dx^{2}}(x) is a constant; i.e., H(x)H(x) must be a quadratic-affine function H(x)=12qx2+ax+cH(x)=\frac{1}{2}qx^{2}+ax+c, for some constants q,a,cq,a,c. Hence the (93) is incrementally passive if and only if HH is quadratic-affine (in which case the integrator is actually linear). This example is easily extendable to more general situations, basically implying that unconditional incremental passivity implies a quadratic-affine storage function.

8 Conclusions

The notion of an incrementally port-Hamiltonian system was first introduced in [9]; basically replacing the composition of a Dirac structure and an energy-dissipation relation in a standard port-Hamiltonian system by a general monotone relation. The present paper discusses the properties of incrementally port-Hamiltonian systems in much more detail; including a wealth of examples and the formulation of specific system subclasses. In particular, the current paper studies the class of maximal cyclically monotone port-Hamiltonian systems and its connection to convex generating functions. From a mathematical point of view a key contribution of the present paper is a detailed treatment of composition of maximal (cyclically) monotone relations, and its implications for the interconnection of incrementally port-Hamiltonian systems. Indeed, it is shown that under mild technical conditions the composition of maximal (cyclically) monotone relations defines a maximal (cyclically) monotone relation.

Apart from the abundance of physical examples, this relates incrementally port-Hamiltonian systems to convex optimization as well. Such relations are multi-faceted; from the formulation of gradient and primal-dual gradient algorithms in continuous time as incrementally port-Hamiltonian systems to the computation of the equilibrium of interconnected incrementally port-Hamiltonian systems via convex optimization. Furthermore, apart from the convex generating functions of maximal cyclically monotone relations, another use of convexity in this incrementally port-Hamiltonian framework is the consideration of convex Hamiltonian functions. The use of the Bregman divergence of a convex function already turns out to be natural in assessing the stability of steady states of (interconnected) incrementally port-Hamiltonian systems, but much more connections between port-Hamiltonian theory and convex analysis are still to be explored.

The precise dynamical properties of incrementally port-Hamiltonian systems still remain somewhat illusive. The dynamical implications of the key inequality 13 are only fully clear if the Hamiltonian HH is a quadratic-affine function in suitable coordinates. Indeed, in this case the incrementally port-Hamiltonian system is incrementally and differentially passive. On the other hand, as shown in [30] and in the example of a scalar integrator discussed at the end of the previous section, unconditional incremental properties are typically very demanding (see also the theory of contractive systems [5]), and one could argue that the notion of incrementally port-Hamiltonian systems is less restrictive (although yet less clear from a dynamical perspective).

References

  • [1] A. J. van der Schaft, L2-Gain and Passivity Techniques in Nonlinear Control, Communications and Control Engineering. Springer International Publishing, Cham, Switzerland, 3rd edition edition, 2017.
  • [2] A.J. van der Schaft and D. Jeltsema, Port-Hamiltonian Systems Theory: An Introductory Overview, Foundations and Trends in Systems and Control. now Publishers, 2014.
  • [3] T. Chaffey and R. Sepulchre, “Monotone one-port circuits,” https://arxiv.org/pdf/2111.15407.pdf, 2021.
  • [4] C.A. Desoer and M. Vidyasagar, Feedback Systems: Input-Output Properties, Classics in Applied Mathematics. Society for Industrial and Applied Mathematics, Philadelphia, USA, 1975.
  • [5] W. Lohmiller and J.E. Slotine, “On contraction analysis for non-linear systems,” Automatica, vol. 34, pp. 683–696, 1998.
  • [6] N. Parikh and S. Boyd, Proximal Algorithms, Foundations and Trends in Systems and Control. now Publishers, 2013.
  • [7] H. Brézis, Operateurs Maximaux Monotones, North-Holland, 1973.
  • [8] H. H. Bauschke and P. L. Combettes, Convex Analysis and Monotone Operator Theory in Hilbert Spaces, CMS Books in Mathematics. Springer, 2011.
  • [9] M. K. Camlibel and A. J. van der Schaft, “Incrementally port-Hamiltonian systems,” in 52th IEEE Conference on Decision and Control, Florence, Italy, 2013.
  • [10] M. K. Camlibel and J. M. Schumacher, “Linear passive systems and maximal monotone mappings,” Mathematical Programming, vol. 157, no. 2, pp. 397–420, 2016.
  • [11] M. Burger, D. Zelazo, and F. Allgower, “Duality and network theory in passivity-based cooperative control,” Automatica, vol. 50, no. 8, pp. 2051–2061, 2014.
  • [12] G. H. Hines, M. Arcak, and A. K. Packard, “Equilibrium-independent passivity: A new definition and numerical certification,” Automatica, vol. 47, no. 9, pp. 1949–1956, 2011.
  • [13] V. Duindam, A. Macchelli, and S. Stramigioli, Eds., Modeling and Control of Complex Physical Systems: The Port-Hamiltonian Approach, Springer London, Limited, 2009.
  • [14] M. Dalsmo and A.J. van der Schaft, “On representations and integrability of mathematical structures in energy-conserving physical systems,” SIAM J. Control and Optimization, vol. 37, no. 1, pp. 54–91, 1999.
  • [15] T. J. Courant, “Dirac manifolds,” Trans. Amer. Math. Soc., vol. 319, no. 2, pp. 631–661, 1990.
  • [16] A.J. van der Schaft and B.M. Maschke, “The Hamiltonian formulation of energy conserving physical systems with external ports,” Archiv für Elektronik und Übertragungstechnik, vol. 49, pp. 362–371, 1995.
  • [17] R. T. Rockafellar and J. B. Wets, Variational Analysis, A Series of Comprehensive Studies in Mathematics 317. Springer, 1998.
  • [18] K. J. Arrow, L. Hurwicz, and H. Uzawa, Studies in Linear and Non-linear Programming, vol. 2 of Stanford Mathematical Studies in the Social Sciences, Stanford University Press, 1958.
  • [19] T. W. Stegink, C. De Persis, and A. J. van der Schaft, “A unifying energy-based approach to stability of power grids with market dynamics,” IEEE Transactions Automatic Control, vol. 62, no. 6, pp. 2612–2622, 2017.
  • [20] D.P. Bertsekas, Convex Optimization Theory, Athena Scientific, 2009.
  • [21] A.J. van der Schaft and B. Maschke, “Port-Hamiltonian systems on graphs,” SIAM J. Control Optim., vol. 51, no. 2, pp. 906–937, 2013.
  • [22] C.G. Khatri and S.K. Mitra, “Hermitian and nonnegative definite solutions of linear matrix equations,” SIAM J. Appl. Math., vol. 31, pp. 579–585, 1976.
  • [23] L. M. Bregman, “The relaxation method of finding the common points of convex sets and its application to the solution of problems in convex programming,” USSR Computational Mathematics and Mathematical Physics, vol. 7, no. 3, pp. 200–217, 1967.
  • [24] A. Pavlov and L. Marconi, “Incremental passivity and output regulation,” Systems and Control Letters,, vol. 57, no. 5, pp. 400–409, 2008.
  • [25] D. Angeli, “A Lyapunov approach to incremental stability properties,” IEEE Transactions Automatic Control, vol. 47, no. 2, pp. 410–421, 2000.
  • [26] F. Forni and R. Sepulchre, “On differentially dissipative dynamical systems,” in 9th IFAC Symposium on Nonlinear Control Systems, Toulouse, 2013, pp. 4–6.
  • [27] A.J. van der Schaft, “On differential passivity,” in 9th IFAC Symposium on Nonlinear Control Systems, Toulouse, 2013, pp. 21–25.
  • [28] F. Forni, R. Sepulchre, and A.J. van der Schaft, “On differential passivity of physical systems,” in 52nd IEEE Conference on Decision and Control, Florence, Italy, 2013, pp. 6580–6585.
  • [29] P.E. Crouch and A.J. van der Schaft, Variational and Hamiltonian control systems, Lectures Notes in Control and Inf. Sciences 101. Springer-Verlag, New York, 1987.
  • [30] V. V. Kulkarni and M. G. Safonov, “Incremental positivity non-preservation by stability multipliers,” in 40th IEEE Conf. on Decision and Control, Orlando, USA, 2001, pp. 33–38.