arXiv is now an independent nonprofit! Learn more
License: CC BY-NC-ND 4.0
arXiv:2511.20209v2 [math.OC] 21 Aug 2026

Scaled relative graphs for pairs of operators beyond classical monotonicity Thanks:  This work was supported by the Research Foundation Flanders (FWO) PhD grant 11A8T26N and research projects G081222N, G033822N, and G0A0920N; Research Council KUL grant C14/24/103.

Jan Quan and Alexander Bodard and Konstantinos Oikonomidis and Panagiotis Patrinos Thanks:  KU Leuven, Department of Electrical Engineering ESAT-STADIUS – Kasteelpark Arenberg 10, box 2446, 3001 Leuven, Belgium jan.quan@kuleuven.be
Abstract

We introduce a generalization of the scaled relative graph (SRG) to pairs of operators, enabling the visualization of their relative incremental properties. This novel SRG framework provides the geometric counterpart for the study of nonlinear resolvents based on paired monotonicity conditions. We demonstrate that these conditions apply to linear operators composed with monotone mappings, a class that notably includes NPN transistors, allowing us to compute the response of multivalued, nonsmooth, and highly nonmonotone electrical circuits.

I Introduction

Understanding the input-output behavior of systems and their underlying operators is a central problem in the study of dynamical systems and control algorithms. In this context, classical monotone operator theory provides a unifying mathematical framework for modeling feedback interconnections, optimization dynamics, and equilibrium systems. Moreover, monotonicity is a fundamental property for ensuring stability and convergence in many settings, from proximal algorithms to feedback systems governed by maximal monotone mappings. However, many relevant control and learning systems are described by nonmonotone operators and thus require a different approach.

A new concept, pair monotonicity, which is a specialization of the TT-monotonicity concept from [4, Def. 3], has been introduced in order to better analyze the differential inclusions of sweeping processes in [1]. Notably, a set-valued variant of this monotonicity property was also used in [16] to characterize the firm nonexpansiveness of generalized resolvent operators. Departing from standard monotonicity that links the inputs and outputs of an operator, pair monotonicity describes the incremental properties of the output of one operator compared to the output of another, thus making it useful for characterizing highly nonmonotone systems. Pair monotonicity provides a powerful way to incorporate prior knowledge by choosing the second operator judiciously. As this approach is purely algebraic, this choice may be quite difficult in practice.

Rather than relying on algebra, graphical tools are invaluable for building intuition. To this end, the scaled relative graph (SRG) [22] has emerged as a powerful framework by mapping the action of operators onto the (extended) complex plane. Serving as a nonlinear generalization of the classical Nyquist diagram, this tool has since seen applications in various systems and control contexts, such as graphical system analysis [7, 2, 9, 13] and reset control systems [23], and has proven useful in the convergence analysis of various algorithms [17, 22].

Originally, the SRG was used for the analysis of operator properties, where the high-level approach is shown in Figure 1. Of particular interest is showing that operators are firmly nonexpansive or contractive, upon which convergence of the associated fixed-point iteration can be shown using the Krasnosel’skiǐ–Mann [3, Cor. 5.17] and Banach fixed-point theorem [3, Thm. 1.50], respectively. With the emergence of the new pair monotonicity, it is natural to ask how the SRG can be extended to handle these novel properties. This is the main subject of study in this paper.

A𝒜A\in\mathcal{A}BB\in\mathcal{B}𝒢(A,id)\mathcal{G}(A,\id)𝒢(B,id)\mathcal{G}(B,\id)AlgebraGeometry𝒢(,id)\mathcal{G}(\cdot,\id)SRG-full
Fig. 1: We can derive properties of BB from properties of AA by transforming the SRG of AA (denoted as 𝒢(A,id)\mathcal{G}(A,\id)) into the SRG of BB, and then using SRG-fullness. This offers a geometric alternative to the classical algebraic approach.

Concretely, our contribution is threefold.

  1. (i)

    We introduce a scaled relative graph for pairs of operators and establish important calculus rules. Furthermore, we extend the notions of SRG-fullness and semimonotonicity to this setting, thereby extending classical monotonicity.

  2. (ii)

    We apply this novel tool to provide purely geometric proofs for the core properties of two nonlinear resolvents that have been used to solve inclusion problems with pairs of monotone operators.

  3. (iii)

    We show the practical utility of this paired monotonicity condition by analyzing operators that can be written as the composition of a linear operator with a monotone mapping, a class that includes nonlinear transistor models. Leveraging this property, we are able to compute the response of a nonmonotone common-emitter amplifier circuit.

I-A Notation

In the following, \mathcal{H} denotes a real Hilbert space with inner product ,\langle\cdot,\cdot\rangle and induced norm \|\cdot\|. We denote the sets of complex and extended-complex numbers by \mathbb{C} and ¯{}\overline{\mathbb{C}}\coloneq\mathbb{C}\cup\{\infty\}, respectively. As in [22], we avoid +\infty+\infty, 0/00/0, /\infty/\infty, 00\cdot\infty and otherwise adopt the convention z+=z+\infty=\infty, z/=0z/\infty=0, z/0=z/0=\infty, and z=z\cdot\infty=\infty. For subsets S,T¯S,T\subseteq\overline{\mathbb{C}}, set addition is understood as S+T={s+t:sS,tT}{:S or T}S+T=\{s+t:s\in S\cap\mathbb{C},t\in T\cap\mathbb{C}\}\cup\{\infty:\ \infty\in S\textnormal{ or }\infty\in T\}. Scalar multiplication by λ{0}\lambda\in\mathbb{C}\setminus\{0\} is defined by λS={λs:sS}{:S}\lambda S=\{\lambda s:s\in S\cap\mathbb{C}\}\cup\{\infty:\infty\in S\}. For zz\in\mathbb{C}, zz^{*} denotes its complex conjugate whereas, for a bounded, linear operator MM, MM^{*} denotes its adjoint. We use \oplus to denote the direct sum. For a set-valued mapping A:A:\mathcal{H}\rightrightarrows\mathcal{H}, we define its domain domA{xA(x)}\dom A\coloneq\{x\in\mathcal{H}\mid A(x)\neq\emptyset\}, its range ranA{uuA(x) for some x}\ran A\coloneq\{u\in\mathcal{H}\mid u\in A(x)\text{ for some }x\in\mathcal{H}\} and its graph gphA{(x,u)×uA(x)}\graph A\coloneq\{(x,u)\in\mathcal{H}\times\mathcal{H}\mid u\in A(x)\}. The inverse mapping A1:A^{-1}:\mathcal{H}\rightrightarrows\mathcal{H}, which always exists, is defined by A1(u){xuA(x)}A^{-1}(u)\coloneq\{x\in\mathcal{H}\mid u\in A(x)\}. The set of zeros is denoted by Zer(A)A1(0)={x0A(x)}\zer(A)\coloneq A^{-1}(0)=\{x\in\mathcal{H}\mid 0\in A(x)\} and the set of fixed points by Fix(A){xxA(x)}\fix(A)\coloneq\{x\in\mathcal{H}\mid x\in A(x)\}. AA is firmly nonexpansive if xx¯,uu¯uu¯2\langle x-\bar{x},u-\bar{u}\rangle\geq\|u-\bar{u}\|^{2}, (x,u),(x¯,u¯)gphA\forall(x,u),(\bar{x},\bar{u})\in\graph A, LL-Lipschitz with L>0L>0 if uu¯Lxx¯\|u-\bar{u}\|\leq L\|x-\bar{x}\|, (x,u),(x¯,u¯)gphA\forall(x,u),(\bar{x},\bar{u})\in\graph A and contractive if it is LL-Lipschitz with L<1L<1. The composition of two set-valued mappings A,B:A,B:\mathcal{H}\rightrightarrows\mathcal{H} is defined by (AB)(x)=yB(x)A(y)(A\circ B)(x)=\bigcup_{y\in B(x)}A(y) for xx\in\mathcal{H}. We denote the identity operator by id\id. The closed disk with center cc\in\mathbb{C} and radius r>0r>0 is defined as D(c,r){z:|zc|r}D(c,r)\coloneq\{z\in\mathbb{C}:|z-c|\leq r\}. We denote the half-plane α{zRe(z)α}{}\mathbb{C}_{\geq\alpha}\coloneq\{z\in\mathbb{C}\mid\realpart(z)\geq\alpha\}\cup\{\infty\} with α\alpha\in\mathbb{R}. Lastly, a set S¯S\subseteq\overline{\mathbb{C}} is said to satisfy the chord property if zS{}{θz+(1θ)z:θ(0,1)}Sz\in S\setminus\{\infty\}\implies\{\theta z+(1-\theta)z^{*}:\theta\in(0,1)\}\subseteq S, cf. [22, Fig. 6].

II Scaled relative graphs of operator pairs

We aim to study the relative incremental properties of an operator A:A:\mathcal{H}\rightrightarrows\mathcal{H} compared to another operator B:B:\mathcal{H}\rightrightarrows\mathcal{H}. One possible approach is to analyze the composed operator AB1A\circ B^{-1}. However, this perspective has several disadvantages: it requires working with explicit operator inverses and compositions, it is more difficult to derive calculus rules, and it may be difficult to preserve problem structure. We therefore take a second approach and study relative incremental properties of operator pairs (A,B)(A,B).

To this end, we introduce the notion of scaled relative graphs for pairs of operators (A,B)(A,B), which we show is equivalent to the classical scaled relative graph [22] of AB1A\circ B^{-1}. In particular, let (x,u),(x¯,u¯)×(x,u),(\bar{x},\bar{u})\in\mathcal{H}\times\mathcal{H} with xx¯x\neq\bar{x} and define the corresponding complex-conjugate pair

z±(uu¯,xx¯)uu¯xx¯exp(±i(xx¯,uu¯)),z_{\pm}(u-\bar{u},x-\bar{x})\coloneq\frac{\|u-\bar{u}\|}{\|x-\bar{x}\|}\exp(\pm i\angle(x-\bar{x},u-\bar{u})),

where the angle (xx¯,uu¯)[0,π]\angle(x-\bar{x},u-\bar{u})\in[0,\pi] is defined as arccos(xx¯,uu¯xx¯uu¯)\arccos\left(\tfrac{\langle x-\bar{x},u-\bar{u}\rangle}{\|x-\bar{x}\|\|u-\bar{u}\|}\right) if xx¯x\neq\bar{x} and uu¯u\neq\bar{u}, and 00 otherwise. The SRG of a pair of operators then consists of the union of these pairs, where AA and BB are evaluated at the same inputs.

Definition II.1 (SRG of a pair of operators).

For A,B:A,B:\mathcal{H}\rightrightarrows\mathcal{H}, the scaled relative graph of a pair of operators (A,B)(A,B) is

𝒢(A,B){z±(uAu¯A,uBu¯B)|uAA(x),u¯AA(x¯)uBB(x),u¯BB(x¯)}\mathcal{G}(A,B)\coloneq\left\{z_{\pm}(u_{A}-\bar{u}_{A},u_{B}-\bar{u}_{B})\;\Big|\;\begin{subarray}{c}u_{A}\in A(x),\bar{u}_{A}\in A(\bar{x})\\ u_{B}\in B(x),\bar{u}_{B}\in B(\bar{x})\end{subarray}\right\}

for all x,x¯domAdomBx,\bar{x}\in\dom A\cap\dom B such that uBu¯Bu_{B}\neq\bar{u}_{B}. Additionally, 𝒢(A,B)\mathcal{G}(A,B) includes \infty if there exist (x,uA),(x¯,u¯A)gphA(x,u_{A}),(\bar{x},\bar{u}_{A})\in\graph A and (x,uB),(x¯,u¯B)gphB(x,u_{B}),(\bar{x},\bar{u}_{B})\in\graph B such that uB=u¯Bu_{B}=\bar{u}_{B} (including when x=x¯x=\bar{x}) and uAu¯Au_{A}\neq\bar{u}_{A}. Furthermore, we define the SRG of a class of operator pairs 𝒫\mathcal{P} as 𝒢(𝒫)(A,B)𝒫𝒢(A,B)\mathcal{G}(\mathcal{P})\coloneq\cup_{(A,B)\in\mathcal{P}}\mathcal{G}(A,B).

Remark II.1.

The classical scaled relative graph [22] of AA is recovered for B=idB=\id.

Remark II.2.

A related notion has been introduced in [17, Eq. (2.1)], where BB is restricted to a selection [17, p. 279].

We now derive some basic identities that follow from the definition and similar proof techniques as in [22]. The main difference arises from BB not necessarily being bijective, so handling the \infty case requires extra care.

Proposition II.1 (Basic calculus).

Let A,B,C:A,B,C:\mathcal{H}\rightrightarrows\mathcal{H}, and α,β{0}\alpha,\beta\in\mathbb{R}\setminus\{0\}. Then,

  1. (i)

    𝒢(A,B)=𝒢(AB1,id)\mathcal{G}(A,B)=\mathcal{G}(A\circ B^{-1},\id).

  2. (ii)

    𝒢(αA,βB)=(α/β)𝒢(A,B).\mathcal{G}(\alpha A,\beta B)=(\alpha/\beta)\mathcal{G}(A,B).

  3. (iii)

    𝒢(B,A)=(𝒢(A,B))1{(z1)z𝒢(A,B)}\mathcal{G}(B,A)=(\mathcal{G}(A,B))^{-1}\coloneq\{(z^{-1})^{*}\mid z\in\mathcal{G}(A,B)\}.

  4. (iv)

    𝒢(id,A)=(𝒢(A,id))1=𝒢(A1,id)\mathcal{G}(\id,A)=(\mathcal{G}(A,\id))^{-1}=\mathcal{G}(A^{-1},\id).

  5. (v)

    If either 𝒢(A,C)\mathcal{G}(A,C) or 𝒢(B,C)\mathcal{G}(B,C) satisfies the chord property, then 𝒢(A+B,C)𝒢(A,C)+𝒢(B,C)\mathcal{G}(A+B,C)\subseteq\mathcal{G}(A,C)+\mathcal{G}(B,C).

  6. (vi)

    If either 𝒢(B,A)\mathcal{G}(B,A) or 𝒢(C,A)\mathcal{G}(C,A) satisfies the chord property, then 𝒢(A,B+C)(𝒢(A,B)1+𝒢(A,C)1)1\mathcal{G}(A,B+C)\subseteq(\mathcal{G}(A,B)^{-1}+\mathcal{G}(A,C)^{-1})^{-1}.

If one of the operators is single-valued or satisfies some mild additional properties, even more calculus rules can be established.

Proposition II.2 (Additional calculus).

Let A,B:A,B:\mathcal{H}\rightrightarrows\mathcal{H} and suppose F:F:\mathcal{H}\to\mathcal{H} is single-valued. Then,

  1. (i)

    If FF is not constant, then 𝒢(F,F)={1}\mathcal{G}(F,F)=\{1\}.

  2. (ii)

    𝒢(A+F,F)=1+𝒢(A,F)\mathcal{G}(A+F,F)=1+\mathcal{G}(A,F).

  3. (iii)

    𝒢(F(A+F)1,id)=𝒢(F,A+F)\mathcal{G}(F\circ(A+F)^{-1},\id)=\mathcal{G}(F,A+F).

  4. (iv)

    𝒢(AF,BF)𝒢(A,B)\mathcal{G}(A\circ F,B\circ F)\subseteq\mathcal{G}(A,B) with equality if FF is surjective.

  5. (v)

    If 𝒢(F,id)D(0,L)\mathcal{G}(F,\id)\subseteq D(0,L) and 𝒢(A,B)D(0,l)\mathcal{G}(A,B)\subseteq D(0,l) for some L,l>0L,l>0, then 𝒢(FA,B)D(0,Ll)\mathcal{G}(F\circ A,B)\subseteq D(0,Ll).

  6. (vi)

    If 𝒢(A,F)D(0,L)\mathcal{G}(A,F)\subseteq D(0,L) and 𝒢(F,id)D(0,l)\mathcal{G}(F,\id)\subseteq D(0,l) for some L,l>0L,l>0, then 𝒢(A,id)D(0,Ll)\mathcal{G}(A,\id)\subseteq D(0,Ll).

  7. (vii)

    If MM is a bounded, invertible linear operator on \mathcal{H} and 𝒢(A,B)0\mathcal{G}(A,B)\subseteq\mathbb{C}_{\geq 0}, then 𝒢((M1)A,MB)0\mathcal{G}((M^{-1})^{*}\circ A,M\circ B)\subseteq\mathbb{C}_{\geq 0}.

Remark II.3.

Let A:A:\mathcal{H}\rightrightarrows\mathcal{H} and F:F:\mathcal{H}\to\mathcal{H}. We have by II.1(i) that 𝒢(A,F)=𝒢(AF1,id)\mathcal{G}(A,F)=\mathcal{G}(A\circ F^{-1},\id). In particular, consider =n\mathcal{H}=\mathbb{R}^{n} and a positive definite matrix Wn×nW\in\mathbb{R}^{n\times n}, which admits a decomposition W=XXW=X^{\top}X with Xn×nX\in\mathbb{R}^{n\times n} nonsingular by [12, Thm. 7.2.7]. Then, 𝒢(XA,X)=𝒢(XAX1,id)\mathcal{G}(X\circ A,X)=\mathcal{G}(X\circ A\circ X^{-1},\id) corresponds to the incremental variant of the weighted scaled graph from [9].

A crucial property in the context of the original SRG is the concept of SRG-fullness of operator classes [22, Sec. 3.3], since these allow for membership checking based on geometric containment of the SRG, which forms the final step of the approach shown in Figure 1. A generalization to our framework is straightforward.

Definition II.2 (SRG-full operator classes of pairs).

A class 𝒫\mathcal{P} of operator pairs is SRG-full if

(A,B)𝒫𝒢(A,B)𝒢(𝒫).(A,B)\in\mathcal{P}\iff\mathcal{G}(A,B)\subseteq\mathcal{G}(\mathcal{P}).

Similar to [22, Thm. 2], classes defined through some nonnegatively homogeneous function h:3h:\mathbb{R}^{3}\to\mathbb{R}, i.e., h(κa,κb,κc)=κh(a,b,c)h(\kappa a,\kappa b,\kappa c)=\kappa h(a,b,c) for all κ0\kappa\geq 0, satisfy this desirable property. In fact, if 𝒫\mathcal{P} is SRG-full, then such a nonnegatively homogeneous function always exists.

Proposition II.3.

Let 𝒫\mathcal{P} be a class of operator pairs. Then 𝒫\mathcal{P} is SRG-full if and only if there exists some nonnegatively homogeneous function h:3h:\mathbb{R}^{3}\to\mathbb{R} such that (A,B)𝒫(A,B)\in\mathcal{P} if and only if (x,uA),(x¯,u¯A)gphA,(x,uB),(x¯,u¯B)gphB\forall(x,u_{A}),(\bar{x},\bar{u}_{A})\in\graph A,(x,u_{B}),(\bar{x},\bar{u}_{B})\in\graph B:

h(uAu¯A2,uBu¯B2,uAu¯A,uBu¯B)0.h(\|u_{A}-\bar{u}_{A}\|^{2},\|u_{B}-\bar{u}_{B}\|^{2},\langle u_{A}-\bar{u}_{A},u_{B}-\bar{u}_{B}\rangle)\leq 0. (1)
Remark II.4.

Note that the choice of hh representing a class is not unique, and that there may exist representations that are not nonnegatively homogeneous, e.g., h1(a,b,c)=ch_{1}(a,b,c)=-c, h2(a,b,c)=2ch_{2}(a,b,c)=-2c, and h3(a,b,c)=c3h_{3}(a,b,c)=-c^{3} all represent (pair of) monotone operators, but h3h_{3} clearly violates the preceding homogeneity condition.

In the context of the original SRG, one particularly interesting SRG-full class is the one defined by h:(a,b,c)ρa+μbch:(a,b,c)\mapsto\rho a+\mu b-c, which covers (μ,ρ)(\mu,\rho)-semimonotone operators, see [20, Prop. 3.2], a class that was introduced in [11, Def. 4.1]. In the following, we generalize this class to the setting of operator pairs, inspired by the operator-pair monotonicity introduced in [4, Def. 3], [16, Eq. (5)]. Note that classical (μ,ρ)(\mu,\rho)-semimonotonicity is recovered by taking B=idB=\id.

Definition II.3 (Semimonotone operator pairs).

Let A,B:A,B:\mathcal{H}\rightrightarrows\mathcal{H} and μ,ρ\mu,\rho\in\mathbb{R}. Then (A,B)(A,B) is (μ,ρ)(\mu,\rho)-semimonotone if (x,uA),(x¯,u¯A)gphA,(x,uB),(x¯,u¯B)gphB:\forall(x,u_{A}),(\bar{x},\bar{u}_{A})\in\graph A,(x,u_{B}),(\bar{x},\bar{u}_{B})\in\graph B: uAu¯A,uBu¯BμuBu¯B2+ρuAu¯A2.\langle u_{A}-\bar{u}_{A},u_{B}-\bar{u}_{B}\rangle\geq\mu\|u_{B}-\bar{u}_{B}\|^{2}+\rho\|u_{A}-\bar{u}_{A}\|^{2}. The class of all (μ,ρ)(\mu,\rho)-semimonotone operator pairs is denoted by 𝒮μ,ρ\mathcal{S}_{\mu,\rho}.

We also denote μ𝒮μ,0\mathcal{M}_{\mu}\coloneq\mathcal{S}_{\mu,0} for the μ\mu-monotone pairs of operators. When B=idB=\id and μ>0\mu>0, we recover the class of μ\mu-strongly monotone operators, while we recover the class of |μ||\mu|-hypomonotone operators when μ<0\mu<0, similarly to [11, Rem. 4.2]. The SRG of the class of (μ,ρ)(\mu,\rho)-semimonotone operator pairs is now shown to be exactly the same as in [20, Prop. 3.4], for which we moreover derive an alternative representation.

Proposition II.4 (SRG of semimonotone operator pairs).

Let μ,ρ\mu,\rho\in\mathbb{R}. Then, 𝒮μ,ρ\mathcal{S}_{\mu,\rho} is SRG-full. Moreover,

𝒢(𝒮μ,ρ)={zRe(z)μ+ρ|z|2}({} if ρ0)CLOSE.\mathcal{G}(\mathcal{S}_{\mu,\rho})=\{z\in\mathbb{C}\mid\realpart(z)\geq\mu+\rho|z|^{2}\}\,(\cup\{\infty\}\textnormal{ if $\rho\leq 0$)}.

In particular,

𝒢(μ)={zRe(z)μ}{}.\mathcal{G}(\mathcal{M}_{\mu})=\{z\in\mathbb{C}\mid\realpart(z)\geq\mu\}\cup\{\infty\}. (2)
Proof sketch.

The forward inclusion is shown using the definition of semimonotone operator pairs, while the reverse inclusion follows because classical semimonotone operators (i.e., with B=idB=\id) are contained in 𝒮μ,ρ\mathcal{S}_{\mu,\rho}, so that [20, Prop. 3.4] applies. ∎

Example II.1.

Consider the linear operator Alin=[1/221/21/2][2]A_{\rm lin}=\begin{bmatrix}1/2&2\\ -1/2&1/2\end{bmatrix}\oplus[2] from [22, Fig. 5]. Figure 2 visualizes, for different operators BB, the numerical SRG of the pair (Alin,B)(A_{\rm lin},B). Here and henceforth, numerical SRGs are computed with each coordinate sampled independently and uniformly from [1000,1000][-1000,1000]. For B=idB=\id, this reduces to the standard SRG of AlinA_{\rm lin}. Inspired by [16, Lem. 5.1], we also consider the choice B=Alin+2κidB=A_{\rm lin}+2\kappa\id, where κ=0.45|α|\kappa=0.45|\alpha| and |α||\alpha| is the smallest eigenvalue of AlinA_{\rm lin} in absolute value. Finally, we also consider B=2AlinB=2A_{\rm lin}^{-\top}.

It is clear that (Alin,id)(A_{\rm lin},\id) is not monotone by (2). Further, the second and third SRGs suggest that (Alin,Alin+2κid),(Alin,2Alin)0(A_{\rm lin},A_{\rm lin}+2\kappa\id),(A_{\rm lin},2A_{\rm lin}^{-\top})\in\mathcal{M}_{0}, though this cannot be concluded by sampling alone. That they indeed have this property follows from [16, Lem. 5.1] and IV.1(i), respectively.

(a) B=idB=\id
(b) B=Alin+2κidB=A_{\rm lin}+2\kappa\id
(c) B=2AlinB=2A_{\rm lin}^{-\top}
Fig. 2: Numerical SRG of (Alin,B)(A_{\rm lin},B).
Example II.2.

Let ANPNA_{\rm NPN} be the NPN transistor modeled by the Ebers–Moll model, see [20, Sec. 4.2],

ANPN[v1v2]{R[u1u2]|u1AD(v1)u2AD(v2)}A_{\rm NPN}\begin{bmatrix}v_{1}\\ v_{2}\end{bmatrix}\coloneq\left\{R\begin{bmatrix}u_{1}\\ u_{2}\end{bmatrix}\mathrel{\bigg|}\begin{aligned} &u_{1}{}\in{}A_{\rm D}(v_{1})\\ &u_{2}{}\in{}A_{\rm D}(v_{2})\end{aligned}\right\}

where R[1αRαF1]R\coloneq\left[\begin{smallmatrix}1&-\alpha_{R}\\ -\alpha_{F}&1\end{smallmatrix}\right], 0αR,αF<10\leq\alpha_{R},\alpha_{F}<1, and ADA_{\rm D} is a diode model satisfying (AD,id)0(A_{\rm D},\id)\in\mathcal{M}_{0}. Figure 3 shows, for different operators BB, the numerical SRGs of the pairs (ANPN,B)(A_{\rm NPN},B). For B=idB=\id, we observe that the NPN transistor is angle-bounded [20, Def. 3.6], as proven in [20, Prop. 4.4], and that it is not monotone by (2). Unlike in example II.1, the choice B=ANPN+2κidB=A_{\rm NPN}+2\kappa\id, where κ=0.45|α|\kappa=0.45|\alpha| and |α||\alpha| is the smallest eigenvalue of RR in absolute value [16, Lem. 5.1], does not yield a monotone pair of operators. Finally, for B=det(R)RB=\det(R)R^{-\top}, the sampled SRG suggests monotonicity of the pair (ANPN,det(R)R)(A_{\rm NPN},\det(R)R^{-\top}), which Corollary IV.1 later establishes formally.

(a) B=idB=\id
(b) B=ANPN+2κidB=A_{\rm NPN}+2\kappa\id
(c) B=det(R)RB=\det(R)R^{-\top}
Fig. 3: Numerical SRG of (ANPN,B)(A_{\rm NPN},B).

III Properties of nonlinear resolvents

Let A:A:\mathcal{H}\rightrightarrows\mathcal{H} and consider the zero inclusion problem

0A(x)0\in A(x)

that arises ubiquitously in optimization and systems theory. A classical way to solve this problem is to pose it as finding a fixed point of a related operator. The most well-known example is the resolvent JγA=(γA+id)1J_{\gamma A}=(\gamma A+\id)^{-1}, which leads to the celebrated proximal point algorithm. Often, this fixed point operator is shown to be firmly nonexpansive or contractive, from which convergence readily follows by the Krasnosel’skiǐ–Mann or Banach fixed-point theorem.

We now recall two nonlinear resolvents called the warped resolvent [5] and the transformed resolvent [16].

Definition III.1 (Nonlinear resolvents).

Let A:A:\mathcal{H}\rightrightarrows\mathcal{H} and suppose F:F:\mathcal{H}\to\mathcal{H} is single-valued. The transformed resolvent of AA with respect to FF is defined as TAFF(A+F)1T_{A}^{F}\coloneq F\circ(A+F)^{-1}. The warped resolvent of AA with respect to FF is defined as JAF(A+F)1FJ_{A}^{F}\coloneq(A+F)^{-1}\circ F, provided that ranFran(A+F)\ran F\subseteq\ran(A+F).

These resolvents are useful since FixTγAF=F(ZerA)\fix T_{\gamma A}^{F}=F(\zer A) and FixJγAF=ZerA\fix J_{\gamma A}^{F}=\zer A in light of [16, Prop. 3.2]. Therefore, if we can show firm nonexpansiveness or contraction, then standard theory shows convergence, as described above. These properties have indeed been shown under the pair of monotonicity framework in [16]. For the remainder of this paper, we assume that the considered resolvents are everywhere defined on the relevant space.

We now provide the geometric picture of these derivations by giving purely SRG-based proofs. This approach yields concise proofs that capture the core insights and also allow us to see that the established results are tight.

First, we show that if a pair of operators is α\alpha-monotone for some α0\alpha\geq 0, then the transformed resolvent is firmly nonexpansive or even contractive. We then show a similar result for the warped resolvent, under some additional assumptions on FF.

Proposition III.1 (Properties transformed resolvent).

Let A:A:\mathcal{H}\rightrightarrows\mathcal{H}, γ>0\gamma>0, and suppose F:F:\mathcal{H}\to\mathcal{H} is single-valued. If (A,F)α(A,F)\in\mathcal{M}_{\alpha} with α0\alpha\geq 0, then the transformed resolvent TγAFT_{\gamma A}^{F} has 𝒢(TγAF,id)D(1/(2+2γα),1/(2+2γα))\mathcal{G}(T_{\gamma A}^{F},\id)\subseteq D(1/(2+2\gamma\alpha),1/(2+2\gamma\alpha)). In particular, if α=0\alpha=0, then the transformed resolvent is firmly nonexpansive. If α>0\alpha>0, then the transformed resolvent is Lipschitz continuous with constant 1/(1+αγ)<11/(1+\alpha\gamma)<1, i.e., contractive.

Proof.

The geometry of this proof is shown in Figure 4.

Since (A,F)α(A,F)\in\mathcal{M}_{\alpha}, we find from (2) that 𝒢(A,F)α\mathcal{G}(A,F)\subseteq\mathbb{C}_{\geq\alpha}. Then, by II.1(ii), we obtain 𝒢(γA,F)γα\mathcal{G}(\gamma A,F)\subseteq\mathbb{C}_{\geq\gamma\alpha}. Further, from the single-valuedness of FF, II.2(ii) ensures that 𝒢(γA+F,F)1+γα\mathcal{G}(\gamma A+F,F)\subseteq 1+\mathbb{C}_{\geq\gamma\alpha}. Lastly, the property II.2(iii) and the inversion rule II.1(iii) yield that 𝒢(TγAF,id)=𝒢(F,γA+F)(1+γα)1=D(1/(2+2γα),1/(2+2γα))\mathcal{G}(T_{\gamma A}^{F},\id)=\mathcal{G}(F,\gamma A+F)\subseteq(1+\mathbb{C}_{\geq\gamma\alpha})^{-1}=D(1/(2+2\gamma\alpha),1/(2+2\gamma\alpha)).

Since 𝒢(TγAF,id)\mathcal{G}(T_{\gamma A}^{F},\id) is the standard SRG of TγAFT_{\gamma A}^{F}, it follows from [22, Prop. 1 and Thm. 2] that TγAFT_{\gamma A}^{F} is firmly nonexpansive if α=0\alpha=0 and Lipschitz continuous with factor 1/(1+αγ)<11/(1+\alpha\gamma)<1 if α>0\alpha>0. ∎

(a)
(b)
(c)
Fig. 4: Geometry of proof Proposition III.1.
Proposition III.2 (Lipschitz continuity warped resolvent).

Let A:A:\mathcal{H}\rightrightarrows\mathcal{H}, γ>0\gamma>0, and suppose F:F:\mathcal{H}\to\mathcal{H} is single-valued. If (A,F)α(A,F)\in\mathcal{M}_{\alpha} with α0\alpha\geq 0, then the warped resolvent satisfies 𝒢(FJγAF,F)D(1/(2+2γα),1/(2+2γα))\mathcal{G}(F\circ J_{\gamma A}^{F},F)\subseteq D(1/(2+2\gamma\alpha),1/(2+2\gamma\alpha)). If, moreover F1F^{-1} is well-defined and ll-Lipschitz, and FF is LL-Lipschitz, then 𝒢(JγAF,id)D(0,Ll/(1+γα))\mathcal{G}(J_{\gamma A}^{F},\id)\subseteq D(0,Ll/(1+\gamma\alpha)).

(a)
(b)
(c)
Fig. 5: Geometry of proof Proposition III.2.
Proof.

The geometry of the proof is shown in Figure 5.

Since FJγAF=TγAFFF\circ J_{\gamma A}^{F}=T_{\gamma A}^{F}\circ F, Proposition III.1 and the precomposition rule II.2(iv) ensure that 𝒢(FJγAF,F)D(1/(2+2γα),1/(2+2γα))\mathcal{G}(F\circ J_{\gamma A}^{F},F)\subseteq D(1/(2+2\gamma\alpha),1/(2+2\gamma\alpha)). If, moreover F1F^{-1} is well-defined and ll-Lipschitz, then 𝒢(F1,id)D(0,l)\mathcal{G}(F^{-1},\id)\subseteq D(0,l) by [22, Prop. 1]. From II.2(v) and the fact that D(1/(2+2γα),1/(2+2γα))D(0,1/(1+γα))D(1/(2+2\gamma\alpha),1/(2+2\gamma\alpha))\subseteq D(0,1/(1+\gamma\alpha)), it then follows that 𝒢(F1FJγAF,F)=𝒢(JγAF,F)lD(0,1/(1+γα))=D(0,l/(1+γα))\mathcal{G}(F^{-1}\circ F\circ J_{\gamma A}^{F},F)=\mathcal{G}(J_{\gamma A}^{F},F)\subseteq lD(0,1/(1+\gamma\alpha))=D(0,l/(1+\gamma\alpha)). Lastly, by II.2(vi) and the fact that 𝒢(F,id)D(0,L)\mathcal{G}(F,\id)\subseteq D(0,L) from [22, Prop. 1], we conclude that 𝒢(JγAF,id)D(0,Ll/(1+γα))\mathcal{G}(J_{\gamma A}^{F},\id)\subseteq D(0,Ll/(1+\gamma\alpha)). ∎

Remark III.1.

In [16], strong monotonicity of pairs of operators is defined differently from our α\mathcal{M}_{\alpha}. Nevertheless, if (A,B)(A,B) satisfies [16, Eq. (6)], i.e., (x,uA),(x¯,u¯A)gphA\forall(x,u_{A}),(\bar{x},\bar{u}_{A})\in\graph A, (x,uB),(x¯,u¯B)gphB(x,u_{B}),(\bar{x},\bar{u}_{B})\in\graph B,

uAu¯A,uBu¯Bαxx¯2\langle u_{A}-\bar{u}_{A},u_{B}-\bar{u}_{B}\rangle\geq\alpha\|x-\bar{x}\|^{2}

and BB is LL-Lipschitz continuous, then xx¯2L2uBu¯B2\|x-\bar{x}\|^{2}\geq L^{-2}\|u_{B}-\bar{u}_{B}\|^{2} and it follows that (A,B)αL2(A,B)\in\mathcal{M}_{\alpha L^{-2}} by Definition II.3, so Proposition III.1 exactly recovers [16, Prop. 3.4].

Example III.1.

Note that the definition of semimonotone operator pairs allows for great flexibility in the choice of (A,F)(A,F). For μ=ρ=0\mu=\rho=0 and F=idAF=\id-A, definition II.3 recovers the class of firmly nonexpansive operators:

A(x)A(x¯),xA(x)(x¯A(x¯))0\displaystyle\langle A(x)-A(\bar{x}),x-A(x)-(\bar{x}-A(\bar{x}))\rangle\geq 0
\displaystyle\iff A(x)A(x¯),xx¯A(x)A(x¯)2,\displaystyle\langle A(x)-A(\bar{x}),x-\bar{x}\rangle\geq\|A(x)-A(\bar{x})\|^{2},

for all x,x¯domAx,\bar{x}\in\dom A. In that case, the transformed resolvent becomes TAF=F=idAT_{A}^{F}=F=\id-A, i.e., the standard forward step.

Example III.2.

We can recover more relaxed conditions by using the so-called nonlinear preconditioning technique [18, 15, 14, 19]: choosing F=idψAF=\id-\nabla\psi\circ A where ψ\nabla\psi is the gradient of a Legendre function [15, p. 6] and ranAdomψ\ran A\subseteq\dom\nabla\psi. In that case, the semimonotonicity inequality with μ=ρ=0\mu=\rho=0 takes the form A(x)A(x¯),xx¯ψ(A(x))ψ(A(x¯)),A(x)A(x¯).\langle A(x)-A(\bar{x}),x-\bar{x}\rangle\geq\langle\nabla\psi(A(x))-\nabla\psi(A(\bar{x})),A(x)-A(\bar{x})\rangle.

Clearly, this implies that AA is a monotone operator while if ψ=122\psi=\tfrac{1}{2}\|\cdot\|^{2}, we recover Example III.1. We remark that by choosing a suitable ψ\psi, we can make the inequality above less restrictive than the one in Example III.1 as shown in [19]. The corresponding transformed resolvent becomes TAF=(idψA)((idψ)A+id)1T_{A}^{F}=(\id-\nabla\psi\circ A)\circ((\id-\nabla\psi)\circ A+\id)^{-1}.

Example III.3.

As in example III.1, let F=idAF=\id-A. Suppose that A=γψfA=\gamma\nabla\psi\circ\nabla f, where f:2:x14i=12xi4f:\mathbb{R}^{2}\to\mathbb{R}:x\mapsto\frac{1}{4}\sum_{i=1}^{2}x_{i}^{4} and γ=0.1\gamma=0.1 is a fixed step size. Then, the transformed resolvent reduces to a nonlinearly preconditioned forward step TAF=idγψfT_{A}^{F}=\id-\gamma\nabla\psi\circ\nabla f [19]. Typically, ψ\nabla\psi satisfies ψ(y)=0\nabla\psi(y)=0 if and only if y=0y=0, in which case the zeros of AA correspond to the stationary points of ff.

Figure 6 visualizes the numerical SRG of the pair (A,F)(A,F) for different separable nonlinear preconditioners of the form ψ=(h(y1),h(y2))\nabla\psi=(h^{\prime}(y_{1}),h^{\prime}(y_{2})). Without preconditioning, i.e., for h(y)=yh^{\prime}(y)=y, the pair is clearly not monotone. For hard clipping h(y)=Π[1,1](y)h^{\prime}(y)=\Pi_{[-1,1]}(y), and for h(y)=arcsinh(y)h^{\prime}(y)=\arcsinh(y) the numerical SRG suggests monotonicity of the pair (A,F)(A,F).

(a) h(y)=yh^{\prime}(y)=y
(b) h(y)=Π(y)h^{\prime}(y)=\Pi(y)
(c) h(y)=arcsinh(y)h^{\prime}(y)=\arcsinh(y)
Fig. 6: Numerical SRG of (γψf,idγψf)(\gamma\nabla\psi\circ\nabla f,\id-\gamma\nabla\psi\circ\nabla f) for f(x)=14i=12xi4f(x)=\frac{1}{4}\sum_{i=1}^{2}x_{i}^{4} and ψ=(h(y1),h(y2))\nabla\psi=(h^{\prime}(y_{1}),h^{\prime}(y_{2})). We denote by Π\Pi the Euclidean projection onto the interval [1,1][-1,1].

Lastly, inspired by [16, Ex. 2.3 and 2.4], we provide two more examples to showcase the SRG approach.

Example III.4.

Let A:A:\mathcal{H}\rightrightarrows\mathcal{H}. Suppose that A=B+FA=B+F, where B:B:\mathcal{H}\rightrightarrows\mathcal{H} and F:F:\mathcal{H}\to\mathcal{H} is single-valued. If (F,B)0(F,B)\in\mathcal{M}_{0}, then (A,F)1(A,F)\in\mathcal{M}_{1}.

Proof.

Since (F,B)0(F,B)\in\mathcal{M}_{0}, we have that 𝒢(F,B)0\mathcal{G}(F,B)\subseteq\mathbb{C}_{\geq 0}. Then, from the inversion rule II.1(iii), 𝒢(B,F)(0)1=0\mathcal{G}(B,F)\subseteq(\mathbb{C}_{\geq 0})^{-1}=\mathbb{C}_{\geq 0}. Further, by II.2(ii), 𝒢(B+F,F)1+0=1\mathcal{G}(B+F,F)\subseteq 1+\mathbb{C}_{\geq 0}=\mathbb{C}_{\geq 1} and we conclude that (A,F)=(B+F,F)1(A,F)=(B+F,F)\in\mathcal{M}_{1} by Proposition II.4. ∎

Example III.5.

Let A,B:A,B:\mathcal{H}\rightrightarrows\mathcal{H} and suppose F:F:\mathcal{H}\to\mathcal{H} is single-valued. If (A,id)0(A,\id)\in\mathcal{M}_{0} and (B,F)α(B,F)\in\mathcal{M}_{\alpha} for some α0\alpha\geq 0, then (AF+B,F)α(A\circ F+B,F)\in\mathcal{M}_{\alpha}.

Proof.

Since (A,id)0(A,\id)\in\mathcal{M}_{0} and (B,F)α(B,F)\in\mathcal{M}_{\alpha}, we have 𝒢(A,id)0\mathcal{G}(A,\id)\subseteq\mathbb{C}_{\geq 0} and 𝒢(B,F)α\mathcal{G}(B,F)\subseteq\mathbb{C}_{\geq\alpha}. Then, by the precomposition rule, II.2(iv), 𝒢(AF,F)0\mathcal{G}(A\circ F,F)\subseteq\mathbb{C}_{\geq 0}, and from II.1(v) (passing to chord completions if necessary, see [13, Def. 4]), we obtain that 𝒢(AF+B,F)0+α=α\mathcal{G}(A\circ F+B,F)\subseteq\mathbb{C}_{\geq 0}+\mathbb{C}_{\geq\alpha}=\mathbb{C}_{\geq\alpha}, which readily leads to the desired result by Proposition II.4. ∎

Lastly, we provide a result that recovers part of [3, Cor. 25.6] when F=idF=\id, and is useful for deriving (linearly) preconditioned algorithms, as we will do in Example IV.2.

Proposition III.3.

Let A:A:\mathcal{H}\rightrightarrows\mathcal{H} and suppose F:F:\mathcal{H}\to\mathcal{H} is single-valued. Let MM be a bounded, invertible linear operator on \mathcal{H}. If (A,F)0(A,F)\in\mathcal{M}_{0}, then ((M1)AM1,MFM1)0((M^{-1})^{*}AM^{-1},MFM^{-1})\in\mathcal{M}_{0}.

Proof.

Since (A,F)0(A,F)\in\mathcal{M}_{0}, we have 𝒢(A,F)0\mathcal{G}(A,F)\subseteq\mathbb{C}_{\geq 0}. Then, from II.2(vii), we obtain 𝒢((M1)A,MF)0\mathcal{G}((M^{-1})^{*}A,MF)\subseteq\mathbb{C}_{\geq 0} and by precomposition, II.2(iv), we have 𝒢((M1)AM1,MFM1)0\mathcal{G}((M^{-1})^{*}AM^{-1},MFM^{-1})\subseteq\mathbb{C}_{\geq 0}, so we conclude that ((M1)AM1,MFM1)0((M^{-1})^{*}AM^{-1},MFM^{-1})\in\mathcal{M}_{0} by Proposition II.4. ∎

IV Application to circuit theory

In this section, we apply the paired monotonicity framework to solve two inclusions involving nonsmooth, multivalued and highly nonmonotone operators in the context of circuit theory. To this end, we first show that linear mappings composed with monotone mappings fit naturally into this framework, a class that includes the NPN transistor. The SRG framework can be used as a simple visual tool for detecting when paired monotonicity fails and may also certify tightness when monotonicity does hold (see Figure 3).

i1i_{1}++\vphantom{+}-v1v_{1}i1i_{1}i2i_{2}++\vphantom{+}-v2v_{2}i2i_{2}rrrr
(a) Leakage transistor
RER_{E}\vphantom{+}-++vinv_{\textnormal{in}}RCR_{C}\vphantom{+}-++v+v_{+}++-++-
(b) Common-emitter amplifier
Fig. 7: Examples of nonmonotone electrical circuits.
Proposition IV.1.

Let Mn×nM\in\mathbb{R}^{n\times n} and B:nnB:\mathbb{R}^{n}\rightrightarrows\mathbb{R}^{n}. Let A=MBA=M\circ B. Suppose that (B,id)0(B,\id)\in\mathcal{M}_{0}.

  1. (i)

    If MM is nonsingular, then (A,cM)0(A,cM^{-\top})\in\mathcal{M}_{0} for any c>0c>0.

  2. (ii)

    If rank(M)=n1\rank(M)=n-1, then (A,yx)0(A,yx^{\top})\in\mathcal{M}_{0} for some x,yn{0}x,y\in\mathbb{R}^{n}\setminus\{0\}.

Proof.

IV.1(i)”: Let (x,u),(x¯,u¯)gph(cM)(x,u),(\bar{x},\bar{u})\in\graph(cM^{-\top}) and let (x,uA),(x¯,u¯A)gphA(x,u_{A}),(\bar{x},\bar{u}_{A})\in\graph A. Then,

uu¯,uAu¯A\displaystyle\langle u-\bar{u},u_{A}-\bar{u}_{A}\rangle =cM(xx¯),M(uBu¯B)\displaystyle=\langle cM^{-\top}(x-\bar{x}),M(u_{B}-\bar{u}_{B})\rangle
=cxx¯,uBu¯B\displaystyle=c\langle x-\bar{x},u_{B}-\bar{u}_{B}\rangle

for uBB(x),u¯BB(x¯)u_{B}\in B(x),\bar{u}_{B}\in B(\bar{x}). From the monotonicity of BB, we find that xx¯,uBu¯B0\langle x-\bar{x},u_{B}-\bar{u}_{B}\rangle\geq 0, so (A,cM)0(A,cM^{-\top})\in\mathcal{M}_{0}.

IV.1(ii)”: By a similar proof as in IV.1(i), (A,adjM)0(A,\adj M^{\top})\in\mathcal{M}_{0} provided that (detM)0(\det M)\geq 0, where adjM\adj M denotes the adjugate of MM, i.e., the transpose of the cofactor matrix. To derive this, the defining property of the adjugate (adjM)M=(detM)I(\adj M)M=(\det M)I is used. Further, if rank(M)=n1\rank(M)=n-1, then det(M)=0\det(M)=0 and rank(adjM)=1\rank(\adj M)=1, so adjM\adj M admits the factorization adjM=xy\adj M=xy^{\top} for some x,yn{0}x,y\in\mathbb{R}^{n}\setminus\{0\} and the result is proven. See [12, Sec. 0.8.2] for a more detailed discussion on the used properties of adjugates. ∎

Corollary IV.1.

The operator ANPNA_{\rm NPN} in Example II.2 satisfies (ANPN,B)0(A_{\rm NPN},B)\in\mathcal{M}_{0}, where B=(detR)R=[1αFαR1]B=(\det R)R^{-\top}=\begin{bmatrix}1&\alpha_{F}\\ \alpha_{R}&1\end{bmatrix}.

In the following example11 1 The code for reproducing the experiments can be found at https://github.com/alexanderbodard/SRGs_for_pairs., we consider the same experiment as in [20, Prop. 5.1] and provide a transformed proximal point iteration that converges without any step size restriction.

Example IV.1.

We first consider the leaky transistor shown in Figure 7a. The associated inclusion problem is

[i1i2]ANPN[v1v2]+1r[v1v2]ANPN,r[v1v2]\begin{bmatrix}i_{1}\\ i_{2}\end{bmatrix}\in A_{\rm NPN}\begin{bmatrix}v_{1}\\ v_{2}\end{bmatrix}+\frac{1}{r}\begin{bmatrix}v_{1}\\ v_{2}\end{bmatrix}\eqcolon A_{{\rm NPN},r}\begin{bmatrix}v_{1}\\ v_{2}\end{bmatrix} (3)

where r>0r>0 and ADA_{\rm D} is the ideal diode defined by AD(v)={0}A_{\rm D}(v)=\{0\} if v<0v<0; AD(0)=[0,+)A_{\rm D}(0)=[0,+\infty); and AD(v)=A_{\rm D}(v)=\emptyset otherwise. Define A~NPN,rANPN,r[i1i2]\tilde{A}_{{\rm NPN},r}\coloneq A_{{\rm NPN},r}-[i_{1}\;i_{2}]^{\top}. Then, any sequence (vk)k(v^{k})_{k\in\mathbb{N}} satisfying the update rule

vk+1=TγA~NPN,rB(vk)v^{k+1}=T_{\gamma\tilde{A}_{{\rm NPN},r}}^{B}(v^{k})

with BB as in Corollary IV.1 and step size γ>0\gamma>0 converges weakly to BvBv^{*}, where vv^{*} is a solution of (3).

Crucially, our iteration converges with any step size γ>0\gamma>0, whereas that of [20, Prop. 5.1] only works for γ>r(21)\gamma>r(\sqrt{2}-1), which is a restrictive condition, especially when r1r\gg 1, i.e., the case that usually occurs in practice. Figure 8 shows the experimental results for the same configuration as in [20, Fig. 6].

Proof.

By Corollary IV.1, we find that (ANPN,B)0(A_{\rm NPN},B)\in\mathcal{M}_{0}, while per Definition II.3 with μ=ρ=0\mu=\rho=0, we also obtain that ((1/r)id,B)0((1/r)\id,B)\in\mathcal{M}_{0}. Similar to Example III.5, we can use II.1(v) to find (ANPN+(1/r)id,B)=(ANPN,r,B)0(A_{\rm NPN}+(1/r)\id,B)=(A_{{\rm NPN},r},B)\in\mathcal{M}_{0}. Since adding a constant does not change incremental properties, we have (A~NPN,r,B)0(\tilde{A}_{{\rm NPN},r},B)\in\mathcal{M}_{0}. From Proposition III.1, we find that TγA~NPN,rBT_{\gamma\tilde{A}_{{\rm NPN},r}}^{B} is firmly nonexpansive. It follows from [3, Cor. 5.17] that (vk)k(v^{k})_{k\in\mathbb{N}} converges weakly to FixTγA~NPN,rB=B(ZerA~NPN,r)\fix T_{\gamma\tilde{A}_{{\rm NPN},r}}^{B}=B(\zer\tilde{A}_{{\rm NPN},r}). ∎

Fig. 8: Solution to the inclusion problem (3) for the same configuration as in [20, Fig. 6]: leakage resistance r=10 r=$10\text{\,}\mathrm{\SIUnitSymbolOhm}$ and a desired sinusoidal current ii are given.

We next show how to leverage Proposition III.3 to derive a linearly preconditioned proximal point algorithm based on the transformed resolvent, before applying this to a (nonmonotone) common-emitter amplifier circuit.

Let A:A:\mathcal{H}\rightrightarrows\mathcal{H} and suppose F:F:\mathcal{H}\to\mathcal{H} is single-valued with (A,F)0(A,F)\in\mathcal{M}_{0}. Let MM be a bounded, invertible linear operator on \mathcal{H}. Proposition III.3 ensures that ((M1)AM1,MFM1)0((M^{-1})^{*}AM^{-1},MFM^{-1})\in\mathcal{M}_{0}. We can then invoke Proposition III.1 and Krasnosel’skiǐ–Mann [3, Cor. 5.17] to show that the iteration

xk+1=MFM1((M1)AM1+MFM1)1xkx^{k+1}=MFM^{-1}\circ((M^{-1})^{*}AM^{-1}+MFM^{-1})^{-1}x^{k}

converges weakly to a point in MFM1(ZerMAM1)MFM^{-1}(\zer M^{-\top}AM^{-1}), provided it exists. Now, define x¯k\bar{x}^{k} by Mx¯k=xkM\bar{x}^{k}=x^{k}. With some algebra, the iteration is then equivalent to

x¯k+1F(A+MMF)1MMx¯k.\bar{x}^{k+1}\in F\circ(A+M^{*}MF)^{-1}M^{*}M\bar{x}^{k}.

Conversely, starting from a positive definite PP, by letting M=P1/2M=P^{1/2} be the positive definite square root of PP, we find that the iteration

x¯k+1F(A+PF)1Px¯k\bar{x}^{k+1}\in F\circ(A+PF)^{-1}P\bar{x}^{k} (4)

converges weakly to a point in F(ZerA)F(\zer A) if one exists. Further, instead of Fejér monotonicity in the Euclidean norm [3, Cor. 5.17(i)], one now obtains Fejér monotonicity in the matrix PP-norm [12, Eq. (5.2.6)].

We now apply this iteration to a common-emitter amplifier circuit shown in Figure 7b.

Fig. 9: Solution to the inclusion problem (5) for the common-emitter amplifier circuit in figure 7b with linear resistors RE=30 ,RC=300 R_{E}=$30\text{\,}\mathrm{\SIUnitSymbolOhm}$,R_{C}=$300\text{\,}\mathrm{\SIUnitSymbolOhm}$, and circuit parameters vin=cos(2πt)Vv_{\rm in}=\cos(2\pi t)$\mathrm{V}$, v+=5 Vv_{+}=$5\text{\,}\mathrm{V}$. These plots were obtained through the iteration (6) with parameters γ=103,τ=100\gamma=10^{-3},\tau=100.
Example IV.2.

From [20, Eq. (9)], the behavior of a common-emitter amplifier circuit can be obtained by solving an inclusion problem of the form

0[A(i)B(v)]+[0I2I20][iv]+[svsi]0\in\begin{bmatrix}A(i)\\ B(v)\end{bmatrix}+\begin{bmatrix}0&I_{2}^{\top}\\ -I_{2}&0\end{bmatrix}\begin{bmatrix}i\\ v\end{bmatrix}+\begin{bmatrix}s_{v}\\ s_{i}\end{bmatrix} (5)

where

A[RC00RE],BANPN,sv[v+vinvin],si0A\coloneq\begin{bmatrix}R_{C}&0\\ 0&R_{E}\end{bmatrix},\,B\coloneq A_{\rm NPN},\,s_{v}\coloneq\begin{bmatrix}v_{+}-v_{\rm in}\\ -v_{\rm in}\end{bmatrix},\,s_{i}\coloneq 0

with vin,v+,RC,RE>0v_{\rm in}\in\mathbb{R},v_{+},R_{C},R_{E}>0 and I2I_{2} denoting the identity matrix. Such a structure for solving circuits was studied in [6] in the monotone setting and in [20] in the semimonotone setting. We now consider the pair monotonicity setting, that considers parameters that can not be covered by semimonotonicity.

Let RR be associated with ANPNA_{\rm NPN} as in Example II.2 and suppose that AR1+RA0A^{\top}R^{-1}+R^{-\top}A\succeq 0, τ,γ>0\tau,\gamma>0 and γτR2<1\gamma\tau\|R\|^{2}<1, where R\|R\| denotes the spectral norm of RR. Consider the iteration

i¯k\displaystyle\bar{i}^{k} =(A+γ1R1)1(γ1ikRvksv)\displaystyle=(A+\gamma^{-1}R^{-1})^{-1}(\gamma^{-1}i^{k}-R^{\top}v^{k}-s_{v}) (6)
v¯k\displaystyle\bar{v}^{k} =(B+τ1R)1(Rik+τ1vk+2i¯ksi)\displaystyle=(B+\tau^{-1}R^{-\top})^{-1}(-Ri^{k}+\tau^{-1}v^{k}+2\bar{i}^{k}-s_{i})
ik+1=R1i¯k,vk+1=Rv¯k.\displaystyle i^{k+1}=R^{-1}\bar{i}^{k},\qquad v^{k+1}=R^{-\top}\bar{v}^{k}.

Then, (Rik,Rvk)k(Ri^{k},R^{\top}v^{k})_{k\in\mathbb{N}} converges weakly to a solution of (5), provided a solution exists.

Figure 9 shows the result of applying iteration (6) to the common-emitter amplifier circuit in Figure 7b. For these numerical values, the required conditions hold. We emphasize that this setting is not covered by the Chambolle–Pock method [20, Prop. 5.2].

Proof.

First, note that (B,R),(A,R1)0(B,R^{-\top}),(A,R^{-1})\in\mathcal{M}_{0} where the first follows by Corollary IV.1 and the second by the assumption and Definition II.3. Similarly, the skew-symmetric term in (5) can also be shown to be monotone with respect to R1RR^{-1}\oplus R^{-\top}.

By using the sum rule, II.1(v), and the fact that constant terms do not affect the incremental properties, it follows that the complete operator in (5) is monotone with respect to F(R1R)F\coloneq(R^{-1}\oplus R^{-\top}). Therefore, we can apply (4) with a positive definite PP. Similar to how Chambolle–Pock [8] arises from a specific choice of PP in the classical preconditioned proximal point algorithm to decouple the equations [10, Eq. (1.1)], we propose a similar preconditioner PP, noting that our setting is different due to FF.

Let P=[γ1I2RRτ1I2]P=\begin{bmatrix}\gamma^{-1}I_{2}&-R^{\top}\\ -R&\tau^{-1}I_{2}\end{bmatrix}, which is positive definite by the Schur complement [12, Thm. 7.7.7] and our assumptions on τ,γ\tau,\gamma. The iteration (4) applied to (5) then becomes (6) after some algebraic manipulations. The convergence then follows from the discussion above. ∎

V Conclusion

In this paper, we introduced a novel scaled relative graph for pairs of operators. This framework naturally provides the geometric counterpart for recently introduced assumptions of paired monotonicity of operators. We have shown the practical relevance of these properties by computing the response of two highly nonmonotone circuits, thus extending known theoretical guarantees.

We believe that the proposed scaled relative graph for pairs of operators may prove valuable for stability analysis of feedback systems, and may simplify further analysis of other classes of nonmonotone circuits that can be handled by tailored splitting methods. Other interesting avenues for future work include developing numerical methods for calculating paired SRGs and nonlinear resolvents.

For the proofs, we require the following equivalent formulation of the complex-conjugate pair z±z_{\pm} (see e.g., [22, Eq. (1)]):

z±(uu¯,xx¯)=uu¯,xx¯xx¯2±iΠ{xx¯}(uu¯)xx¯,z_{\pm}(u-\bar{u},x-\bar{x})=\frac{\langle u-\bar{u},x-\bar{x}\rangle}{\|x-\bar{x}\|^{2}}\pm i\frac{\|\Pi_{\{x-\bar{x}\}^{\perp}}(u-\bar{u})\|}{\|x-\bar{x}\|}, (7)

where Π{xx¯}\Pi_{\{x-\bar{x}\}^{\perp}} is the projection onto the subspace orthogonal to xx¯x-\bar{x}.

Proof.

II.1(i)”: Denote CAB1C\coloneq A\circ B^{-1}, which has graph given by gphC={(uB,uA)×:x,(x,uB)gphB,(x,uA)gphA}\graph C=\{(u_{B},u_{A})\in\mathcal{H}\times\mathcal{H}:\exists x\in\mathcal{H},\ (x,u_{B})\in\graph B,\ (x,u_{A})\in\graph A\}. Let z𝒢(A,B){}z\in\mathcal{G}(A,B)\setminus\{\infty\}. Then there exist (x,uA),(x¯,u¯A)gphA(x,u_{A}),(\bar{x},\bar{u}_{A})\in\graph A and (x,uB),(x¯,u¯B)gphB(x,u_{B}),(\bar{x},\bar{u}_{B})\in\graph B with uBu¯Bu_{B}\neq\bar{u}_{B}, hence z=z±(uAu¯A,uBu¯B)z=z_{\pm}(u_{A}-\bar{u}_{A},u_{B}-\bar{u}_{B}). Since (uB,uB),(u¯B,u¯B)gphid(u_{B},u_{B}),(\bar{u}_{B},\bar{u}_{B})\in\graph\id and (uB,uA),(u¯B,u¯A)gphC(u_{B},u_{A}),(\bar{u}_{B},\bar{u}_{A})\in\graph C, the same point zz belongs to 𝒢(C,id)\mathcal{G}(C,\id).

Conversely, if z𝒢(C,id){}z\in\mathcal{G}(C,\id)\setminus\{\infty\}, then z=z±(uAu¯A,uBu¯B)z=z_{\pm}(u_{A}-\bar{u}_{A},u_{B}-\bar{u}_{B}) for some (uB,uA),(u¯B,u¯A)gphC(u_{B},u_{A}),(\bar{u}_{B},\bar{u}_{A})\in\graph C with uBu¯Bu_{B}\neq\bar{u}_{B}. Therefore, there exist x,x¯x,\bar{x}\in\mathcal{H} such that (x,uB),(x¯,u¯B)gphB(x,u_{B}),(\bar{x},\bar{u}_{B})\in\graph B, (x,uA),(x¯,u¯A)gphA(x,u_{A}),(\bar{x},\bar{u}_{A})\in\graph A. Hence z𝒢(A,B)z\in\mathcal{G}(A,B), and the finite parts coincide.

It remains to check the point at infinity. By Definition II.1, 𝒢(A,B)\infty\in\mathcal{G}(A,B) if and only if there exist (x,uA),(x¯,u¯A)gphA(x,u_{A}),(\bar{x},\bar{u}_{A})\in\graph A and (x,uB),(x¯,u¯B)gphB(x,u_{B}),(\bar{x},\bar{u}_{B})\in\graph B such that uB=u¯Bu_{B}=\bar{u}_{B} and uAu¯Au_{A}\neq\bar{u}_{A}. Denote y=uB=u¯By=u_{B}=\bar{u}_{B} and note that (y,uA),(y,u¯A)gphC(y,u_{A}),(y,\bar{u}_{A})\in\graph C, with distinct outputs at the same input yy, implying 𝒢(C,id)\infty\in\mathcal{G}(C,\id). Conversely, if 𝒢(C,id)\infty\in\mathcal{G}(C,\id), then there exist (y,uA),(y,u¯A)gphC(y,u_{A}),(y,\bar{u}_{A})\in\graph C with uAu¯Au_{A}\neq\bar{u}_{A}. Thus, there exist x,x¯x,\bar{x}\in\mathcal{H} such that (x,y),(x¯,y)gphB(x,y),(\bar{x},y)\in\graph B, (x,uA),(x¯,u¯A)gphA(x,u_{A}),(\bar{x},\bar{u}_{A})\in\graph A. Taking uB=u¯B=yu_{B}=\bar{u}_{B}=y gives 𝒢(A,B)\infty\in\mathcal{G}(A,B), and we conclude that 𝒢(A,B)=𝒢(AB1,id)\mathcal{G}(A,B)=\mathcal{G}(A\circ B^{-1},\id).

II.1(ii)”: This follows from definition II.1 along with the properties of the inner product and the norm.

II.1(iii)”: The equality follows for points that are neither 00 nor \infty by definition. If 𝒢(A,B)\infty\in\mathcal{G}(A,B), there exist (x,uA),(x¯,u¯A)gphA(x,u_{A}),(\bar{x},\bar{u}_{A})\in\graph A and (x,uB),(x¯,u¯B)gphB(x,u_{B}),(\bar{x},\bar{u}_{B})\in\graph B such that uB=u¯Bu_{B}=\bar{u}_{B} and uAu¯Au_{A}\neq\bar{u}_{A}. This immediately implies that 0𝒢(B,A)0\in\mathcal{G}(B,A). The zero case follows similarly.

II.1(iv)”: The first equality is II.1(iii) and the second is [22, Thm. 5] since 𝒢(A,id)\mathcal{G}(A,\id) is the standard SRG.

II.1(v)”: The inclusion for the finite points follows similarly to [22, Thm. 6]. If 𝒢(A+B,C)\infty\in\mathcal{G}(A+B,C), then there exist (x,uC),(x¯,u¯C)gphC(x,u_{C}),(\bar{x},\bar{u}_{C})\in\graph C, (x,uA),(x¯,u¯A)gphA(x,u_{A}),(\bar{x},\bar{u}_{A})\in\graph A, and (x,uB),(x¯,u¯B)gphB(x,u_{B}),(\bar{x},\bar{u}_{B})\in\graph B such that uC=u¯Cu_{C}=\bar{u}_{C} and uA+uBu¯A+u¯Bu_{A}+u_{B}\neq\bar{u}_{A}+\bar{u}_{B}. Hence uAu¯Au_{A}\neq\bar{u}_{A} or uBu¯Bu_{B}\neq\bar{u}_{B}. Therefore 𝒢(A,C)\infty\in\mathcal{G}(A,C) or 𝒢(B,C)\infty\in\mathcal{G}(B,C) and hence 𝒢(A,C)+𝒢(B,C)\infty\in\mathcal{G}(A,C)+\mathcal{G}(B,C).

II.1(vi)”: Combine II.1(v) with II.1(iii), and use that the inverse is defined elementwise, so subset inclusions are preserved. ∎

Proof.

II.2(i)”: Take (x,F(x)),(x¯,F(x¯))gphF(x,F(x)),(\bar{x},F(\bar{x}))\in\graph F. Clearly, 𝒢(F,F)\infty\notin\mathcal{G}(F,F) since FF is a function and we would require both F(x)=F(x¯)F(x)=F(\bar{x}) and F(x)F(x¯)F(x)\neq F(\bar{x}). Since FF is not constant, there exist x,x¯x,\bar{x} with F(x)F(x¯)F(x)\neq F(\bar{x}). For any such pair, we have that z±=F(x)F(x¯)F(x)F(x¯)exp(±i0)={1}z_{\pm}=\tfrac{\|F(x)-F(\bar{x})\|}{\|F(x)-F(\bar{x})\|}\exp(\pm i0)=\{1\}. Thus 𝒢(F,F)={1}\mathcal{G}(F,F)=\{1\}.

II.2(ii)”: Take z𝒢(A+F,F){}z\in\mathcal{G}(A+F,F)\setminus\{\infty\}. Then, there exist x,x¯x,\bar{x} and (x,uA),(x¯,u¯A)gphA(x,u_{A}),(\bar{x},\bar{u}_{A})\in\graph A such that zz±(F(x)+uA(F(x¯)+u¯A),F(x)F(x¯))z\in z_{\pm}(F(x)+u_{A}-(F(\bar{x})+\bar{u}_{A}),F(x)-F(\bar{x})). Since zz\neq\infty, F(x)F(x¯)F(x)\neq F(\bar{x}) and z±(F(x)+uA(F(x¯)+u¯A),F(x)F(x¯))=1+uAu¯A,F(x)F(x¯)F(x)F(x¯)2±iΠ{F(x)F(x¯)}(uAu¯A)F(x)F(x¯)1+𝒢(A,F)z_{\pm}(F(x)+u_{A}-(F(\bar{x})+\bar{u}_{A}),F(x)-F(\bar{x}))=1+\frac{\langle u_{A}-\bar{u}_{A},F(x)-F(\bar{x})\rangle}{\|F(x)-F(\bar{x})\|^{2}}\pm i\frac{\|\Pi_{\{F(x)-F(\bar{x})\}^{\perp}}(u_{A}-\bar{u}_{A})\|}{\|F(x)-F(\bar{x})\|}\subseteq 1+\mathcal{G}(A,F). Now, 𝒢(A+F,F)\infty\in\mathcal{G}(A+F,F) implies F(x)=F(x¯)F(x)=F(\bar{x}) and uA+F(x)u¯A+F(x¯)u_{A}+F(x)\neq\bar{u}_{A}+F(\bar{x}), i.e. uAu¯Au_{A}\neq\bar{u}_{A} which then means that 𝒢(A,F)\infty\in\mathcal{G}(A,F). The opposite inclusions follow similarly.

II.2(iii)”: Apply II.1(i) to the pair (F,A+F)(F,A+F).

II.2(iv)”: Take z𝒢(AF,BF){}z\in\mathcal{G}(A\circ F,B\circ F)\setminus\{\infty\}. Then, there exist (x,u),(x¯,u¯)gph(AF)(x,u),(\bar{x},\bar{u})\in\graph(A\circ F) and (x,v),(x¯,v¯)gph(BF)(x,v),(\bar{x},\bar{v})\in\graph(B\circ F) such that zz±(uu¯,vv¯)z\in z_{\pm}(u-\bar{u},v-\bar{v}) and vv¯v\neq\bar{v}. This implies (F(x),u),(F(x¯),u¯)gphA(F(x),u),(F(\bar{x}),\bar{u})\in\graph A and (F(x),v),(F(x¯),v¯)gphB(F(x),v),(F(\bar{x}),\bar{v})\in\graph B with vv¯v\neq\bar{v}. Then, by definition, z𝒢(A,B)z\in\mathcal{G}(A,B). Now take z=z=\infty. Then, for some pair as before, v=v¯v=\bar{v} and uu¯u\neq\bar{u} meaning also that 𝒢(A,B)\infty\in\mathcal{G}(A,B).

Now assume, moreover, that FF is surjective. Take z𝒢(A,B){}z\in\mathcal{G}(A,B)\setminus\{\infty\}. Then, there exist (x,uA),(x¯,u¯A)gphA(x,u_{A}),(\bar{x},\bar{u}_{A})\in\graph A and (x,uB),(x¯,u¯B)gphB(x,u_{B}),(\bar{x},\bar{u}_{B})\in\graph B such that zz±(uAu¯A,uBu¯B)z\in z_{\pm}(u_{A}-\bar{u}_{A},u_{B}-\bar{u}_{B}) and uBu¯Bu_{B}\neq\bar{u}_{B}. Clearly, since FF is surjective, there exist y,y¯y,\bar{y}\in\mathcal{H} such that F(y)=xF(y)=x and F(y¯)=x¯F(\bar{y})=\bar{x}. Then, (y,uA),(y¯,u¯A)gph(AF)(y,u_{A}),(\bar{y},\bar{u}_{A})\in\graph(A\circ F) and (y,uB),(y¯,u¯B)gph(BF)(y,u_{B}),(\bar{y},\bar{u}_{B})\in\graph(B\circ F) with uBu¯Bu_{B}\neq\bar{u}_{B} and thus zz±(uAu¯A,uBu¯B)𝒢(AF,BF)z\in z_{\pm}(u_{A}-\bar{u}_{A},u_{B}-\bar{u}_{B})\subset\mathcal{G}(A\circ F,B\circ F). The case z=z=\infty follows similarly.

II.2(v)”: Take z𝒢(FA,B)z\in\mathcal{G}(F\circ A,B). If z=z=\infty, then there exist (x,u),(x¯,u¯)gph(FA)(x,u),(\bar{x},\bar{u})\in\graph(F\circ A) and (x,v),(x¯,v¯)gphB(x,v),(\bar{x},\bar{v})\in\graph B such that v=v¯v=\bar{v} and uu¯u\neq\bar{u}. Therefore, there also exist (x,y),(x¯,y¯)gphA(x,y),(\bar{x},\bar{y})\in\graph A such that u=F(y),u¯=F(y¯)u=F(y),\bar{u}=F(\bar{y}) and, since FF is single-valued and uu¯u\neq\bar{u}, we have that yy¯y\neq\bar{y}. This implies 𝒢(A,B)\infty\in\mathcal{G}(A,B), which would contradict the assumption that 𝒢(A,B)D(0,l)\mathcal{G}(A,B)\subseteq D(0,l), and therefore, 𝒢(FA,B)\infty\notin\mathcal{G}(F\circ A,B). Now assume that zz\neq\infty. This means that with pairs as before such that vv¯v\neq\bar{v} we have |z|=uu¯vv¯=F(y)F(y¯)vv¯Lyy¯vv¯|z|=\tfrac{\|u-\bar{u}\|}{\|v-\bar{v}\|}=\frac{\|F(y)-F(\bar{y})\|}{\|v-\bar{v}\|}\leq L\frac{\|y-\bar{y}\|}{\|v-\bar{v}\|}, since FF is a LL-Lipschitz operator in light of [22, Prop. 1 and Thm. 2]. This implies that |z|L|z¯||z|\leq L|\bar{z}| for z¯𝒢(A,B)\bar{z}\in\mathcal{G}(A,B) and thus that |z|Lsup{|z¯|:z¯𝒢(A,B)}|z|\leq L\sup\{|\bar{z}|:\bar{z}\in\mathcal{G}(A,B)\}. Lastly, from the hypothesis, sup{|z¯|:z¯𝒢(A,B)}l\sup\{|\bar{z}|:\bar{z}\in\mathcal{G}(A,B)\}\leq l, so we obtain the claimed result 𝒢(FA,B)D(0,Ll)\mathcal{G}(F\circ A,B)\subseteq D(0,Ll).

II.2(vi)”: Take z𝒢(A,id)z\in\mathcal{G}(A,\id). If z=z=\infty, then there exist (x,u),(x¯,u¯)gphA(x,u),(\bar{x},\bar{u})\in\graph A such that uu¯u\neq\bar{u} and x=x¯x=\bar{x}. Since FF is single-valued, this implies that there exist (x,u),(x¯,u¯)gphA(x,u),(\bar{x},\bar{u})\in\graph A such that uu¯u\neq\bar{u} and F(x)=F(x¯)F(x)=F(\bar{x}), i.e., 𝒢(A,F)\infty\in\mathcal{G}(A,F), which contradicts the assumption that 𝒢(A,F)D(0,L)\mathcal{G}(A,F)\subseteq D(0,L), so 𝒢(A,id)\infty\notin\mathcal{G}(A,\id). In particular, we have that AA is single-valued.

Further, for zz\neq\infty, as in the proof of II.2(v), we know that FF is an ll-Lipschitz operator. Similarly, from 𝒢(A,F)D(0,L)\mathcal{G}(A,F)\subseteq D(0,L) we have that z𝒢(A,F)z^{\prime}\in\mathcal{G}(A,F) implies |z|L|z^{\prime}|\leq L and thus that A(x)A(x¯)LF(x)F(x¯)\|A(x)-A(\bar{x})\|\leq L\|F(x)-F(\bar{x})\| for all x,x¯domAx,\bar{x}\in\dom A. Then, if z𝒢(A,id)z\in\mathcal{G}(A,\id) we have that |z|=A(x)A(x¯)xx¯|z|=\frac{\|A(x)-A(\bar{x})\|}{\|x-\bar{x}\|} for some x,x¯domAx,\bar{x}\in\dom A. Using the previous inequality along with the Lipschitz continuity of FF we obtain |z|lL|z|\leq lL, which is the claimed result.

II.2(vii)”: To begin with, note that since MM is bounded and invertible, we have that (M)1=(M1)(M^{*})^{-1}=(M^{-1})^{*}. For any z𝒢(A,B),z0z\in\mathcal{G}(A,B),z\in\mathbb{C}_{\geq 0}. Thus, for all (x,uA),(x¯,u¯A)gphA(x,u_{A}),(\bar{x},\bar{u}_{A})\in\graph A and (x,uB),(x¯,u¯B)gphB(x,u_{B}),(\bar{x},\bar{u}_{B})\in\graph B such that uBu¯Bu_{B}\neq\bar{u}_{B} we have that uAu¯A,uBu¯B0\langle u_{A}-\bar{u}_{A},u_{B}-\bar{u}_{B}\rangle\geq 0 or, equivalently, (M)1(uAu¯A),M(uBu¯B)0\langle(M^{*})^{-1}(u_{A}-\bar{u}_{A}),M(u_{B}-\bar{u}_{B})\rangle\geq 0 by definition of the adjoint [21, Thm. 4.10]. Since MM is invertible, it holds for any (x,u),(x¯,u¯)gph((M)1A)(x,u),(\bar{x},\bar{u})\in\graph((M^{*})^{-1}\circ A) and (x,v),(x¯,v¯)gph(MB)(x,v),(\bar{x},\bar{v})\in\graph(M\circ B) with vv¯v\neq\bar{v} that uu¯,vv¯0\langle u-\bar{u},v-\bar{v}\rangle\geq 0. The \infty case follows similarly and we conclude that 𝒢((M1)A,MB)0\mathcal{G}((M^{-1})^{*}\circ A,M\circ B)\subseteq\mathbb{C}_{\geq 0}. ∎

Proof.

Suppose that there exists a nonnegatively homogeneous function hh that certifies membership as in Proposition II.3. Notice that (A,B)𝒫𝒢(A,B)𝒢(𝒫)(A,B)\in\mathcal{P}\implies\mathcal{G}(A,B)\subseteq\mathcal{G}(\mathcal{P}) by construction, and it remains to show that 𝒢(A,B)𝒢(𝒫)(A,B)𝒫\mathcal{G}(A,B)\subseteq\mathcal{G}(\mathcal{P})\implies(A,B)\in\mathcal{P}. For all points (x,uA),(x¯,u¯A)gphA(x,u_{A}),(\bar{x},\bar{u}_{A})\in\graph A and (x,uB),(x¯,u¯B)gphB(x,u_{B}),(\bar{x},\bar{u}_{B})\in\graph B such that uBu¯Bu_{B}\neq\bar{u}_{B}, the same technique from [22, Thm. 2] yields that 𝒢(A,B)𝒢(𝒫)h(uAu¯A2,uBu¯B2,uAu¯A,uBu¯B)0\mathcal{G}(A,B)\subseteq\mathcal{G}(\mathcal{P})\implies h(\|u_{A}-\bar{u}_{A}\|^{2},\|u_{B}-\bar{u}_{B}\|^{2},\langle u_{A}-\bar{u}_{A},u_{B}-\bar{u}_{B}\rangle)\leq 0.

Now suppose uB=u¯Bu_{B}=\bar{u}_{B}, while uAu¯Au_{A}\neq\bar{u}_{A}. Then 𝒢(A,B)𝒢(𝒫)\infty\in\mathcal{G}(A,B)\subseteq\mathcal{G}(\mathcal{P}). Thus, there is some (C,D)𝒫(C,D)\in\mathcal{P} such that (x,uC),(x¯,u¯C)gphC(x^{\prime},u_{C}^{\prime}),(\bar{x}^{\prime},\bar{u}_{C}^{\prime})\in\graph C, (x,uD),(x¯,u¯D)gphD(x^{\prime},u_{D}^{\prime}),(\bar{x}^{\prime},\bar{u}_{D}^{\prime})\in\graph D, and uD=u¯Du_{D}^{\prime}=\bar{u}_{D}^{\prime}, uCu¯Cu_{C}^{\prime}\neq\bar{u}_{C}^{\prime}. Since (C,D)𝒫(C,D)\in\mathcal{P}, we have that h(uCu¯C2,0,0)0h(\|u_{C}^{\prime}-\bar{u}_{C}^{\prime}\|^{2},0,0)\leq 0. Multiplying by uAu¯A2/uCu¯C2\|u_{A}-\bar{u}_{A}\|^{2}/\|u_{C}^{\prime}-\bar{u}_{C}^{\prime}\|^{2} and using homogeneity, we find h(uAu¯A2,0,0)0h(\|u_{A}-\bar{u}_{A}\|^{2},0,0)\leq 0. Lastly, if uB=u¯Bu_{B}=\bar{u}_{B} and uA=u¯Au_{A}=\bar{u}_{A}, then hh is evaluated at all zeros, and its output must therefore be zero by homogeneity. In all three cases, we have h(uAu¯A2,uBu¯B2,uAu¯A,uBu¯B)0h(\|u_{A}-\bar{u}_{A}\|^{2},\|u_{B}-\bar{u}_{B}\|^{2},\langle u_{A}-\bar{u}_{A},u_{B}-\bar{u}_{B}\rangle)\leq 0 and since the points were arbitrary evaluations of A,BA,B, we have that (A,B)𝒫(A,B)\in\mathcal{P} by the hypothesis.

Conversely, suppose that 𝒫\mathcal{P} is SRG-full. Let K={(a,b,c)3a0,b0,c2ab}K=\{(a,b,c)\in\mathbb{R}^{3}\mid a\geq 0,b\geq 0,c^{2}\leq ab\} and consider

h(a,b,c)={(a+b)I(z~(a,b,c))if (a,b,c)K{0},0otherwiseh(a,b,c)=\begin{cases}(a+b)I(\tilde{z}(a,b,c))&\textnormal{if $(a,b,c)\in K\setminus\{0\}$},\\ 0&\textnormal{otherwise}\end{cases}

where z~(a,b,c)=cb+iabc2b\tilde{z}(a,b,c)=\frac{c}{b}+i\frac{\sqrt{ab-c^{2}}}{b} if b>0b>0 and z~(a,b,c)=\tilde{z}(a,b,c)=\infty if b=0b=0 and a>0a>0, and

I(z)={0if z𝒢(𝒫),1otherwise.I(z)=\begin{cases}0&\textnormal{if $z\in\mathcal{G}(\mathcal{P})$},\\ 1&\textnormal{otherwise}.\end{cases}

By our constraint on (a,b,c)(a,b,c), z~\tilde{z} will not be evaluated on points where it is not defined. Observe also that z~(uu¯2,xx¯2,uu¯,xx¯)=z+(uu¯,xx¯)\tilde{z}(\|u-\bar{u}\|^{2},\|x-\bar{x}\|^{2},\langle u-\bar{u},x-\bar{x}\rangle)=z_{+}(u-\bar{u},x-\bar{x}) as in (7).

Let κ>0\kappa>0 and (a,b,c)K{0}(a,b,c)\in K\setminus\{0\}. Then also (κa,κb,κc)K{0}(\kappa a,\kappa b,\kappa c)\in K\setminus\{0\} and z~(κa,κb,κc)=z~(a,b,c)\tilde{z}(\kappa a,\kappa b,\kappa c)=\tilde{z}(a,b,c) by definition. It follows that h(κa,κb,κc)=(κa+κb)I(z~(a,b,c))=κh(a,b,c)h(\kappa a,\kappa b,\kappa c)=(\kappa a+\kappa b)I(\tilde{z}(a,b,c))=\kappa h(a,b,c). The cases κ=0\kappa=0 and (a,b,c)K{0}(a,b,c)\notin K\setminus\{0\} both yield h(κa,κb,κc)=0=κh(a,b,c)h(\kappa a,\kappa b,\kappa c)=0=\kappa h(a,b,c), so we obtain that hh is nonnegatively homogeneous. It remains to show that (A,B)𝒫h(uAu¯A2,uBu¯B2,uAu¯A,uBu¯B)0(A,B)\in\mathcal{P}\iff h(\|u_{A}-\bar{u}_{A}\|^{2},\|u_{B}-\bar{u}_{B}\|^{2},\langle u_{A}-\bar{u}_{A},u_{B}-\bar{u}_{B}\rangle)\leq 0 for all (x,uA),(x¯,u¯A)gphA(x,u_{A}),(\bar{x},\bar{u}_{A})\in\graph A and (x,uB),(x¯,u¯B)gphB(x,u_{B}),(\bar{x},\bar{u}_{B})\in\graph B.

Thus, first assume that (A,B)𝒫(A,B)\in\mathcal{P}. Let (x,uA),(x¯,u¯A)gphA(x,u_{A}),(\bar{x},\bar{u}_{A})\in\graph A and (x,uB),(x¯,u¯B)gphB(x,u_{B}),(\bar{x},\bar{u}_{B})\in\graph B and denote a=uAu¯A2a=\|u_{A}-\bar{u}_{A}\|^{2}, b=uBu¯B2b=\|u_{B}-\bar{u}_{B}\|^{2} and c=uAu¯A,uBu¯Bc=\langle u_{A}-\bar{u}_{A},u_{B}-\bar{u}_{B}\rangle. Note that (a,b,c)K(a,b,c)\in K by Cauchy–Schwarz. If (a,b,c)=0(a,b,c)=0, then h(a,b,c)=0h(a,b,c)=0 by construction. Otherwise, if (a,b,c)0(a,b,c)\neq 0, Definition II.1 and (7) ensure that z~(a,b,c)𝒢(A,B)\tilde{z}(a,b,c)\in\mathcal{G}(A,B). Since 𝒫\mathcal{P} is SRG-full, it follows that z~(a,b,c)𝒢(𝒫)\tilde{z}(a,b,c)\in\mathcal{G}(\mathcal{P}) and h(a,b,c)=(a+b)0=0h(a,b,c)=(a+b)\cdot 0=0 by construction. Thus, h(a,b,c)0h(a,b,c)\leq 0 for all points in the graphs.

Second, assume h(uAu¯A2,uBu¯B2,uAu¯A,uBu¯B)0h(\|u_{A}-\bar{u}_{A}\|^{2},\|u_{B}-\bar{u}_{B}\|^{2},\langle u_{A}-\bar{u}_{A},u_{B}-\bar{u}_{B}\rangle)\leq 0 for all (x,uA),(x¯,u¯A)gphA(x,u_{A}),(\bar{x},\bar{u}_{A})\in\graph A and (x,uB),(x¯,u¯B)gphB(x,u_{B}),(\bar{x},\bar{u}_{B})\in\graph B. It suffices to show that 𝒢(A,B)𝒢(𝒫)\mathcal{G}(A,B)\subseteq\mathcal{G}(\mathcal{P}) from which the desired result follows by SRG-fullness of 𝒫\mathcal{P}. To this end, let z𝒢(A,B)z\in\mathcal{G}(A,B). Assume zz\neq\infty. Since the scaled relative graph is symmetric with respect to the real axis, we may assume that Imz0\impart z\geq 0. By Definition II.1, there exists some (x,uA),(x¯,u¯A)gphA(x,u_{A}),(\bar{x},\bar{u}_{A})\in\graph A and (x,uB),(x¯,u¯B)gphB(x,u_{B}),(\bar{x},\bar{u}_{B})\in\graph B so that z=z~(a,b,c)z=\tilde{z}(a,b,c) and a+b>0a+b>0, where we denoted a=uAu¯A2a=\|u_{A}-\bar{u}_{A}\|^{2}, b=uBu¯B2b=\|u_{B}-\bar{u}_{B}\|^{2} and c=uAu¯A,uBu¯Bc=\langle u_{A}-\bar{u}_{A},u_{B}-\bar{u}_{B}\rangle. Further, since hh is nonnegative by construction, h(a,b,c)0h(a,b,c)=0h(a,b,c)\leq 0\iff h(a,b,c)=0. Therefore, since a+b>0a+b>0, we require I(z~(a,b,c))=0I(\tilde{z}(a,b,c))=0, implying that z=z~(a,b,c)𝒢(𝒫)z=\tilde{z}(a,b,c)\in\mathcal{G}(\mathcal{P}) by definition of II. For z=z=\infty, use a>0,b=0,c=0a>0,b=0,c=0, so that z~(a,b,c)=\tilde{z}(a,b,c)=\infty. Since h(a,b,c)0h(a,b,c)\leq 0, h0h\geq 0, and a+b>0a+b>0, we obtain I()=0I(\infty)=0, hence 𝒢(𝒫)\infty\in\mathcal{G}(\mathcal{P}). ∎

Proof.

That 𝒮μ,ρ\mathcal{S}_{\mu,\rho} is SRG-full follows from Definition II.3 and Proposition II.3 with h:(a,b,c)ρa+μbch:(a,b,c)\mapsto\rho a+\mu b-c.

We now show the claimed expression for 𝒢(𝒮μ,ρ)\mathcal{G}(\mathcal{S}_{\mu,\rho}). Suppose that (A,B)𝒮μ,ρ(A,B)\in\mathcal{S}_{\mu,\rho}, (x,uA),(x¯,u¯A)gphA(x,u_{A}),(\bar{x},\bar{u}_{A})\in\graph A and (x,uB),(x¯,u¯B)gphB(x,u_{B}),(\bar{x},\bar{u}_{B})\in\graph B are arbitrary with uBu¯Bu_{B}\neq\bar{u}_{B}. It follows from Definition II.3 that uAu¯A,uBu¯BμuBu¯B2+ρuAu¯A2\langle u_{A}-\bar{u}_{A},u_{B}-\bar{u}_{B}\rangle\geq\mu\|u_{B}-\bar{u}_{B}\|^{2}+\rho\|u_{A}-\bar{u}_{A}\|^{2}, and dividing by uBu¯B2\|u_{B}-\bar{u}_{B}\|^{2} yields uAu¯A,uBu¯BuBu¯B2μ+ρuAu¯A2uBu¯B2\frac{\langle u_{A}-\bar{u}_{A},u_{B}-\bar{u}_{B}\rangle}{\|u_{B}-\bar{u}_{B}\|^{2}}\geq\mu+\rho\frac{\|u_{A}-\bar{u}_{A}\|^{2}}{\|u_{B}-\bar{u}_{B}\|^{2}} which is equivalent to Re(z±(uAu¯A,uBu¯B))μ+ρ|z±(uAu¯A,uBu¯B)|2\realpart(z_{\pm}(u_{A}-\bar{u}_{A},u_{B}-\bar{u}_{B}))\geq\mu+\rho|z_{\pm}(u_{A}-\bar{u}_{A},u_{B}-\bar{u}_{B})|^{2}, see (7). Now suppose ρ>0\rho>0. Clearly, if uB=u¯Bu_{B}=\bar{u}_{B} then also uA=u¯Au_{A}=\bar{u}_{A} from Definition II.3 and thus 𝒢(𝒮μ,ρ)\infty\notin\mathcal{G}(\mathcal{S}_{\mu,\rho}).

For the opposite inclusion, suppose ρ=0\rho=0. Then the set on the right-hand side is exactly μ\mathbb{C}_{\geq\mu}, and from [22, Prop. 1], we find μ=(A,id)μ𝒢(A,id)𝒢(μ)=𝒢(𝒮μ,0)\mathbb{C}_{\geq\mu}=\cup_{(A,\id)\in\mathcal{M}_{\mu}}\mathcal{G}(A,\id)\subseteq\mathcal{G}(\mathcal{M}_{\mu})=\mathcal{G}(\mathcal{S}_{\mu,0}). Otherwise, if ρ>0\rho>0, let z=x+iyz=x+iy satisfy Re(z)μ+ρ|z|2\realpart(z)\geq\mu+\rho|z|^{2}. Then ρx2x+ρy2+μ0\rho x^{2}-x+\rho y^{2}+\mu\leq 0. Further, dividing by ρ\rho and completing the square, we obtain

(x12ρ)2+y2(12ρ)2μρ=14μρ4ρ2.\left(x-\frac{1}{2\rho}\right)^{2}+y^{2}\leq\left(\frac{1}{2\rho}\right)^{2}-\frac{\mu}{\rho}=\frac{1-4\mu\rho}{4\rho^{2}}.

Observe that this defines the same disk as in [20, Prop. 3.4]. Therefore, (A,id)𝒮μ,ρ𝒢(A,id)𝒢(𝒮μ,ρ)\cup_{(A,\id)\in\mathcal{S}_{\mu,\rho}}\mathcal{G}(A,\id)\subseteq\mathcal{G}(\mathcal{S}_{\mu,\rho}). The case ρ<0\rho<0 follows similarly. ∎

References

  • [1] S. Adly, M. G. Cojocaru, and B. K. Le (2024) State-dependent sweeping processes: asymptotic behavior and algorithmic approaches. Journal of Optimization Theory and Applications 202 (2), pp. 932–948. Cited by: §I.
  • [2] E. Baron-Prada, A. Padoan, A. Anta, and F. Dörfler (2025) Stability results for MIMO LTI systems via scaled relative graphs. arXiv:2503.13583. Cited by: §I.
  • [3] H. H. Bauschke and P. L. Combettes (2017) Convex analysis and monotone operator theory in Hilbert spaces. Springer. Cited by: §I, §III, §IV, §IV, §IV.
  • [4] J. M. Borwein, S. Reich, and S. Sabach (2011) A characterization of Bregman firmly nonexpansive operators using a new monotonicity concept. Journal of Nonlinear and Convex Analysis 12 (1), pp. 161–184. Cited by: §I, §II.
  • [5] M. N. Bui and P. L. Combettes (2020) Warped proximal iterations for monotone inclusions. Journal of Mathematical Analysis and Applications 491 (1), pp. 124315. Cited by: §III.
  • [6] T. Chaffey, S. Banert, P. Giselsson, and R. Pates (2023) Circuit analysis using monotone+skew splitting. European Journal of Control 74, pp. 100854. Cited by: Example IV.2.
  • [7] T. Chaffey, F. Forni, and R. Sepulchre (2023) Graphical nonlinear system analysis. IEEE Transactions on Automatic Control 68 (10), pp. 6067–6081. Cited by: §I.
  • [8] A. Chambolle and T. Pock (2011) A first-order primal-dual algorithm for convex problems with applications to imaging. Journal of Mathematical Imaging and Vision 40 (1), pp. 120–145. Cited by: §IV.
  • [9] T. de Groot, T. Oomen, and S. Van Den Eijnden (2025) Exploiting structure in MIMO scaled graph analysis. In Conference on Decision and Control, pp. 6517–6522. Cited by: §I, Remark II.3.
  • [10] B. Evens, P. Latafat, and P. Patrinos (2025) Convergence of the Chambolle–Pock algorithm in the absence of monotonicity. Journal of Optimization Theory and Applications 206 (1), pp. 7. Cited by: §IV.
  • [11] B. Evens, P. Pas, P. Latafat, and P. Patrinos (2025) Convergence of the preconditioned proximal point method and Douglas–Rachford splitting in the absence of monotonicity. Mathematical Programming 214 (1-2), pp. 247–301. Cited by: §II, §II.
  • [12] R. A. Horn and C. R. Johnson (2012) Matrix analysis. Cambridge University Press. Cited by: Remark II.3, §IV, §IV, §IV.
  • [13] J. P. Krebbekx, R. Tóth, and A. Das (2025) Graphical analysis of nonlinear multivariable feedback systems. arXiv:2507.16513. Cited by: §I, §III.
  • [14] E. Laude and P. Patrinos (2023) Anisotropic proximal point algorithm. arXiv:2312.09834. Cited by: Example III.2.
  • [15] E. Laude and P. Patrinos (2025) Anisotropic proximal gradient. Mathematical Programming 214 (1), pp. 801–845. Cited by: Example III.2.
  • [16] B. K. Le, M. N. Dao, and M. A. Théra (2025) Solving non-monotone inclusions using monotonicity of pairs of operators. Journal of Optimization Theory and Applications 207 (1), pp. 18. Cited by: §I, Example II.1, Example II.1, Example II.2, §II, Remark III.1, Remark III.1, §III, §III, §III.
  • [17] J. Lee, S. Yi, and E. K. Ryu (2025) Convergence analyses of Davis–Yin splitting via scaled relative graphs. SIAM Journal on Optimization 35 (1), pp. 270–301. Cited by: §I, Remark II.2.
  • [18] C. J. Maddison, D. Paulin, Y. W. Teh, and A. Doucet (2021) Dual space preconditioning for gradient descent. SIAM Journal on Optimization 31 (1), pp. 991–1016. Cited by: Example III.2.
  • [19] K. Oikonomidis, J. Quan, E. Laude, and P. Patrinos (2025) Nonlinearly preconditioned gradient methods under generalized smoothness. In International Conference on Machine Learning, pp. 47132–47154. Cited by: Example III.2, Example III.2, Example III.3.
  • [20] J. Quan, B. Evens, R. Sepulchre, and P. Patrinos (2025) Scaled relative graphs for nonmonotone operators with applications in circuit theory. European Journal of Control 86, pp. 101335. External Links: ISSN 0947-3580 Cited by: Example II.2, Example II.2, §II, §II, §II, Fig. 8, Example IV.1, Example IV.2, Example IV.2, Example IV.2, §IV, §V.
  • [21] W. Rudin (1991) Functional analysis. McGraw-Hill. Cited by: §V.
  • [22] E. K. Ryu, R. Hannah, and W. Yin (2022) Scaled relative graphs: nonexpansive operators via 2D Euclidean geometry. Mathematical Programming 194 (1), pp. 569–619. Cited by: §I-A, §I, Example II.1, Remark II.1, §II, §II, §II, §II, §III, §III, §V, §V, §V, §V, §V, §V.
  • [23] S. Van Den Eijnden, T. Chaffey, T. Oomen, and W. M. Heemels (2024) Scaled graphs for reset control system analysis. European Journal of Control 80, pp. 101050. Cited by: §I.