<p>Motivated by the optimality system associated with controlled (forward) Volterra integral equations (FVIEs, for short), the well-posedness of coupled forward-backward Volterra integral equations (FBVIEs, for short) is studied. A key feature of FBVIEs is that the unknown pair <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\({(\mathcal {X}(t,s),\mathcal {Y}(t,s))}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">(</mo> <mi mathvariant="script">X</mi> <mo stretchy="false">(</mo> <mi>t</mi> <mo>,</mo> <mi>s</mi> <mo stretchy="false">)</mo> <mo>,</mo> <mi mathvariant="script">Y</mi> <mo stretchy="false">(</mo> <mi>t</mi> <mo>,</mo> <mi>s</mi> <mo stretchy="false">)</mo> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation> depends on two arguments. By treating <i>t</i> as a parameter and <i>s</i> as a time variable, an FBVIE can be viewed as a system of ordinary differential equations (ODEs, for short) taking values in an infinite-dimensional space <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\({(\mathcal {X}(\cdot ,s),\mathcal {Y}(\cdot ,s)); s\in [0,T]}\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">(</mo> <mi mathvariant="script">X</mi> <mo stretchy="false">(</mo> <mo>·</mo> <mo>,</mo> <mi>s</mi> <mo stretchy="false">)</mo> <mo>,</mo> <mi mathvariant="script">Y</mi> <mo stretchy="false">(</mo> <mo>·</mo> <mo>,</mo> <mi>s</mi> <mo stretchy="false">)</mo> <mo stretchy="false">)</mo> <mo>;</mo> <mi>s</mi> <mo>∈</mo> <mo stretchy="false">[</mo> <mn>0</mn> <mo>,</mo> <mi>T</mi> <mo stretchy="false">]</mo> </mrow> </math></EquationSource> </InlineEquation>. To establish well-posedness, a new non-local monotonicity condition is introduced, by which a bridge in infinite-dimensional spaces is constructed. Then by extending the method of continuation developed by Hu and Peng (Probab Theory Relat Fields 103:273–283, 1995), Yong (Probab Theory Relat Fields 107:537–572, 1997) and Peng and Wu (SIAM J Control Optim 37:825–843, 1999) for differential equations, we prove the well-posedness of FBVIEs. The crucial step is to apply the chain rule to the mapping <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(t\mapsto \big [\int _\cdot ^T\langle \mathcal {Y}(s,s),\mathcal {X}(s,\cdot )\rangle ds+\langle G(\mathcal {X}(T,T)),\mathcal {X}(T,\cdot )\rangle \big ](t)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>t</mi> <mo>↦</mo> <mrow> <mo maxsize="1.2em" minsize="1.2em" stretchy="true">[</mo> </mrow> <msubsup> <mo>∫</mo> <mo>·</mo> <mi>T</mi> </msubsup> <mrow> <mo stretchy="false">⟨</mo> <mi mathvariant="script">Y</mi> <mrow> <mo stretchy="false">(</mo> <mi>s</mi> <mo>,</mo> <mi>s</mi> <mo stretchy="false">)</mo> </mrow> <mo>,</mo> <mi mathvariant="script">X</mi> <mrow> <mo stretchy="false">(</mo> <mi>s</mi> <mo>,</mo> <mo>·</mo> <mo stretchy="false">)</mo> </mrow> <mo stretchy="false">⟩</mo> </mrow> <mi>d</mi> <mi>s</mi> <mo>+</mo> <mrow> <mo stretchy="false">⟨</mo> <mi>G</mi> <mrow> <mo stretchy="false">(</mo> <mi mathvariant="script">X</mi> <mrow> <mo stretchy="false">(</mo> <mi>T</mi> <mo>,</mo> <mi>T</mi> <mo stretchy="false">)</mo> </mrow> <mo stretchy="false">)</mo> </mrow> <mo>,</mo> <mi mathvariant="script">X</mi> <mrow> <mo stretchy="false">(</mo> <mi>T</mi> <mo>,</mo> <mo>·</mo> <mo stretchy="false">)</mo> </mrow> <mo stretchy="false">⟩</mo> </mrow> <mrow> <mo maxsize="1.2em" minsize="1.2em" stretchy="true">]</mo> </mrow> <mrow> <mo stretchy="false">(</mo> <mi>t</mi> <mo stretchy="false">)</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>. This is based on the observation that in LQ problems for ODEs, <InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(\langle X(t),Y(t)\rangle \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mo stretchy="false">⟨</mo> <mi>X</mi> <mo stretchy="false">(</mo> <mi>t</mi> <mo stretchy="false">)</mo> <mo>,</mo> <mi>Y</mi> <mo stretchy="false">(</mo> <mi>t</mi> <mo stretchy="false">)</mo> <mo stretchy="false">⟩</mo> </mrow> </math></EquationSource> </InlineEquation> represents the value function, whereas for LQ problems governed by FVIEs the value function is given by <InlineEquation ID="IEq5"> <EquationSource Format="TEX">\(\int _t^T \langle \mathcal {Y}(s,s),\mathcal {X}(s,t)\rangle ds+\langle G\mathcal {X}(T,T),\mathcal {X}(T,t)\rangle \)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <msubsup> <mo>∫</mo> <mi>t</mi> <mi>T</mi> </msubsup> <mrow> <mo stretchy="false">⟨</mo> <mi mathvariant="script">Y</mi> <mrow> <mo stretchy="false">(</mo> <mi>s</mi> <mo>,</mo> <mi>s</mi> <mo stretchy="false">)</mo> </mrow> <mo>,</mo> <mi mathvariant="script">X</mi> <mrow> <mo stretchy="false">(</mo> <mi>s</mi> <mo>,</mo> <mi>t</mi> <mo stretchy="false">)</mo> </mrow> <mo stretchy="false">⟩</mo> </mrow> <mi>d</mi> <mi>s</mi> <mo>+</mo> <mrow> <mo stretchy="false">⟨</mo> <mi>G</mi> <mi mathvariant="script">X</mi> <mrow> <mo stretchy="false">(</mo> <mi>T</mi> <mo>,</mo> <mi>T</mi> <mo stretchy="false">)</mo> </mrow> <mo>,</mo> <mi mathvariant="script">X</mi> <mrow> <mo stretchy="false">(</mo> <mi>T</mi> <mo>,</mo> <mi>t</mi> <mo stretchy="false">)</mo> </mrow> <mo stretchy="false">⟩</mo> </mrow> </mrow> </math></EquationSource> </InlineEquation>.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Solvability of Coupled Forward–Backward Volterra Integral Equations

  • Wenyang Li,
  • Hanxiao Wang,
  • Jiongmin Yong

摘要

Motivated by the optimality system associated with controlled (forward) Volterra integral equations (FVIEs, for short), the well-posedness of coupled forward-backward Volterra integral equations (FBVIEs, for short) is studied. A key feature of FBVIEs is that the unknown pair \({(\mathcal {X}(t,s),\mathcal {Y}(t,s))}\) ( X ( t , s ) , Y ( t , s ) ) depends on two arguments. By treating t as a parameter and s as a time variable, an FBVIE can be viewed as a system of ordinary differential equations (ODEs, for short) taking values in an infinite-dimensional space \({(\mathcal {X}(\cdot ,s),\mathcal {Y}(\cdot ,s)); s\in [0,T]}\) ( X ( · , s ) , Y ( · , s ) ) ; s [ 0 , T ] . To establish well-posedness, a new non-local monotonicity condition is introduced, by which a bridge in infinite-dimensional spaces is constructed. Then by extending the method of continuation developed by Hu and Peng (Probab Theory Relat Fields 103:273–283, 1995), Yong (Probab Theory Relat Fields 107:537–572, 1997) and Peng and Wu (SIAM J Control Optim 37:825–843, 1999) for differential equations, we prove the well-posedness of FBVIEs. The crucial step is to apply the chain rule to the mapping \(t\mapsto \big [\int _\cdot ^T\langle \mathcal {Y}(s,s),\mathcal {X}(s,\cdot )\rangle ds+\langle G(\mathcal {X}(T,T)),\mathcal {X}(T,\cdot )\rangle \big ](t)\) t [ · T Y ( s , s ) , X ( s , · ) d s + G ( X ( T , T ) ) , X ( T , · ) ] ( t ) . This is based on the observation that in LQ problems for ODEs, \(\langle X(t),Y(t)\rangle \) X ( t ) , Y ( t ) represents the value function, whereas for LQ problems governed by FVIEs the value function is given by \(\int _t^T \langle \mathcal {Y}(s,s),\mathcal {X}(s,t)\rangle ds+\langle G\mathcal {X}(T,T),\mathcal {X}(T,t)\rangle \) t T Y ( s , s ) , X ( s , t ) d s + G X ( T , T ) , X ( T , t ) .