- Research
- Open Access
- Published:

# On modeling and complete solutions to general fixpoint problems in multi-scale systems with applications

*Fixed Point Theory and Applications*
**volume 2018**, Article number: 23 (2018)

## Abstract

This paper revisits the well-studied fixed point problem from a unified viewpoint of mathematical modeling and canonical duality theory, i.e., the general fixed point problem is first reformulated as a nonconvex optimization problem, its well-posedness is discussed based on the objectivity principle in continuum physics; then the canonical duality theory is applied for solving this challenging problem to obtain not only all fixed points, but also their stability properties. Applications are illustrated by problems governed by nonconvex polynomial, exponential, and logarithmic operators. This paper shows that within the framework of the canonical duality theory, there is no difference between the fixed point problems and nonconvex analysis/optimization in multidisciplinary studies.

## Introduction

The fixed point problem is a well-established subject in the area of nonlinear analysis [3, 4, 7], which is usually formulated in the following form:

where \({F}:\mathcal {X}_{a} \rightarrow \mathcal {X}_{a}\) is a nonlinear mapping and \(\mathcal {X}_{a} \) is a subset of a normed space \(\mathcal {X}\). Problem \((\mathcal {{P}}_{0})\) appears extensively in engineering and sciences, for example, in equilibrium problems, mathematical economics, game theory, and numerical methods for nonlinear dynamical systems. A general form of the equilibrium problem was first considered by Nikaido and Isoda in 1955 as an auxiliary problem to establish existence results for Nash equilibrium points in non-cooperative games [43–46]. Mathematically speaking, the nonlinear operator \(F(\mathbf {x})\) could be any arbitrarily given vector-valued function. Therefore, the formula \((\mathcal {{P}}_{0})\) for the fixed point problem is too abstract. Although it can be used to “model” a large class of mathematical problems, one must pay a price: it is impossible to develop a unified mathematical theory with powerful real-world applications. This dilemma is due to a gap between mathematics and physics. As indicated by V.I. Arnold [1]:“In the middle of the twentieth century it was attempted to divide physics and mathematics. The consequences turned out to be catastrophic.” Indeed, during the past sixty years extensive research on the fixed point problems has been mainly focused on this abstract form. It turns out that the majority theories and methods for solving this nonlinear problem are based on linear iteration [33, 34, 47, 50]. This paper will provide a different approach. For simplicity’s sake, we assume that \(\mathcal {X}_{a}\) is a convex open set in \({\mathbb {R}}^{n}\) with a norm \(\Vert \mathbf {x}\Vert \) induced by the bilinear form 〈∗, \(* \rangle :\mathcal {X}\times \mathcal {X}\rightarrow {\mathbb {R}}\).

### Lemma 1

*If*
*F*
*is a potential operator*, *i*.*e*., *there exists a real*-*valued function*
\({P}:\mathcal {X}_{a} \rightarrow {\mathbb {R}}\)
*such that*
\({F}(\mathbf {x}) = \nabla {P}(\mathbf {x})\), *then*
\((\mathcal {{P}}_{0})\)
*is equivalent to the following stationary point problem*:

*Otherwise*, \((\mathcal {{P}}_{0})\)
*is equivalent to the following global minimization problem*:

### Proof

First we assume that \({F}(\mathbf {x})\) is a potential operator, then **x** is a stationary point of \(\Pi (\mathbf {x})\) if and only if \(\nabla \Pi (\mathbf {x}) = \nabla {P}(\mathbf {x}) - \mathbf {x}= 0\), thus, **x** is also a solution to \((\mathcal {{P}}_{0})\) since \({F}(\mathbf {x}) = \nabla {P}(\mathbf {x})\).

Now we assume that \({F}(\mathbf {x})\) is not a potential operator. By the fact that \(\Pi (\mathbf {x}) = \frac{1}{2} \Vert {F}(\mathbf {x}) - \mathbf {x}\Vert ^{2} \ge 0 \ \forall \mathbf {x}\in \mathcal {X}\), the vector \({\bar {\mathbf {x}}}\) is a global minimizer of \(\Pi (\mathbf {x})\) if and only if \({F}({\bar {\mathbf {x}}}) - {\bar {\mathbf {x}}}= 0 \). Thus, \({\bar {\mathbf {x}}}\) must be a solution to \((\mathcal {{P}}_{0})\). □

By the facts that the global minimizer of an unconstrained optimization problem must be a stationary point and

the global minimization problem (3) is a special case of the stationary point problem (2). Mathematically speaking, if a fixed point problem has a trivial solution, then \({F}(\mathbf {x})\) must be a homogeneous operator, i.e., \({F}(0) = 0\). For general problems, \({F}(\mathbf {x})\) should have a nonhomogeneous term \(\mathbf {f}\in {\mathbb {R}}^{n}\). Thus, we can let

where \(D: \mathcal {X}\rightarrow \mathcal {{W}}\subset {\mathbb {R}}^{m}\) is a linear operator, \({W}:\mathcal {{W}}\rightarrow {\mathbb {R}}\) is a so-called *objective function*. Objectivity is a basic concept in continuum physics [6, 41] and mathematical modeling [18, 19]. Its mathematical definition is given in Gao’s book (Definition 6.1.2 [11]).

### Definition 1

(Objectivity)

Let \(\mathcal{R} \) be a proper orthogonal group, i.e., \(\mathbf {R}\in {\mathcal{R}} \) if and only if \(\mathbf {R}^{T} = \mathbf {R}^{-1} \), \(\det \mathbf {R}= 1\). A set \(\mathcal {{W}}_{a} \) is said to be objective if

A real-valued function \({W}:\mathcal {{W}}_{a} \rightarrow {\mathbb {R}}\) is said to be objective if

Geometrically speaking, an objective function does not depend on rigid rotation of the system considered, but only on certain measure of its variable. In the Euclidean space \(\mathcal {{W}}\subset {\mathbb {R}}^{m}\), the simplest objective function is the \(\ell _{2}\)-norm \(\Vert \mathbf {w}\Vert \) in \({\mathbb {R}}^{m}\) as we have \(\Vert {\mathbf{R}} \mathbf {w}\Vert ^{2} = \mathbf {w}^{T} {\mathbf{R}}^{T} {\mathbf{R}} \mathbf {w}= \Vert \mathbf {w}\Vert ^{2} \ \forall {\mathbf{R}} \in {\mathcal{R}}\). For general \(F(\mathbf {x})\), we can see from (4) that \(\frac{1}{2} \Vert {F}(\mathbf {x}) \Vert ^{T} \) and \(\frac{1}{2} \Vert \mathbf {x}\Vert ^{2}\) are objective functions. By the fact that \(\mathbf {x}= F(\mathbf {x})\), we know that 〈**x**, \(F(\mathbf {x}) \rangle \) is also an objective function. Therefore, for a given fixed point problem, the corresponding \(\Pi (\mathbf {x})\) is naturally an objective function.

Physically, an objective function is governed by the intrinsic physical law of the system, which does not depend on observers. Because of Noether’s theorem, the objective function \({W}(\mathbf {w})\) should be a SO(*n*)-invariant and this invariant is equivalent to a certain conservation law (see Sect. 6.1.2 [11]). Therefore, objectivity is essential for any real-world mathematical models. It was emphasized by P.G. Ciarlet that the objectivity is not an assumption, but an axiom [6].

From the viewpoint of systems theory, if **x** represents the output (or the state, configuration, etc.) of the system, then the nonhomogeneous term **f** can be viewed as the input (or the control, applied force, etc.), which depends on each given problem. Correspondingly, the linear term 〈**x**, **f**〉 in (5) can be called the *subjective function* [18, 19]. Let \(\mathcal {X}_{a} = \{ \mathbf {x}\in \mathcal {X}\mid D\mathbf {x}\in \mathcal {{W}}_{a} \}\). The fixed point problem \((\mathcal {{P}}_{0})\) can be reformulated into the following stationary point problem:

From the theory of nonconvex analysis, any nonconvex function can be written as a d.c. (deference of convex) function [35]. Therefore, the fixed point problem is actually equivalent to a d.c. programming problem. By the fact that \(\mathcal {X}\) and \(\mathcal {{W}}\) are two different spaces with different scales (dimensions), the problem \((\mathcal {{P}})\) can be used to study general problems in multi-scale complex systems.

For a potential operator, a fixed point is just a stationary point, which can be easily found by traditional linear iteration methods. For a non-potential operator, the fixed point must be a global minimizer. Due to the lack of global optimality condition in the traditional theory of nonlinear optimization, to solve a general nonconvex minimization problem is considered to be NP-hard in global optimization and computer science. However, this paper will show that many of these nonconvex problems can be solved in an elegant way.

## Methods

According to the Brouwer fixed point theorem, we know that any continuous function from the closed unit ball in an n-dimensional Euclidean space to itself must have a fixed point. Generally speaking, for any given nontrivial input, a well-defined system should have at least one nontrivial response.

### Definition 2

(Properly- and well-posed problems [18])

The problem \((\mathcal {{P}})\) is called properly posed if, for any given nontrivial input \(\mathbf {f}\neq 0 \), it has at least one nontrivial solution. It is called well-posed if the solution is unique.

Clearly, this definition is more general than Hadamard’s well-posed problems in dynamical systems since the continuity condition for the solution is not required. Physically speaking, any real-world problems should be well-posed since all natural phenomena exist uniquely. But practically, it is difficult to model a real-world problem precisely. Therefore, properly posed problems are allowed for the canonical duality theory. This definition is important for understanding challenging problems in complex systems.

### Example 1

(Manufacturing/production systems)

In management science, the output is a vector \(\mathbf {x}\in {\mathbb {R}}^{n}\), which could represent the products of a manufacture company. The input \(\mathbf {f}\in {\mathbb {R}}^{n}\) can be considered as market price (or demand). Therefore, the subjective function \(\langle \mathbf {x}, \mathbf {f}\rangle = \mathbf {x}^{T} \mathbf {f}\) in this example is the total income of the company. The products are produced by workers \(\mathbf {w}\in {\mathbb {R}}^{m}\). Due to the cooperation, we have \(\mathbf {w}= D\mathbf {x}\) and \(D\in {\mathbb {R}}^{m\times n}\) is a matrix. Workers are paid salary \(\boldsymbol {\sigma }= \partial {W}(\mathbf {w})\), therefore, the objective function \({W}(\mathbf {w})\) is the cost (in this example, *W* is not necessarily objective since the company is a man-made system). Let \(\frac{1}{2} {\alpha }\Vert \mathbf {x}\Vert ^{2}\) be the profit that the company must make, where \({\alpha }> 0\) is a parameter, then \(\Pi (\mathbf {x}) = {W}(D\mathbf {x}) + \frac{1}{2} {\alpha }\Vert \mathbf {x}\Vert ^{2} - \mathbf {x}^{T} \mathbf {f}\) is the *target* and the minimization problem \(\min \Pi (\mathbf {x})\) leads to the equilibrium equation

This is a fixed point problem. The cost function \({W}(\mathbf {w})\) could be convex for a small company, but usually nonconvex for big companies to allow some people have the same salaries.

### Example 2

(Lagrange mechanics)

In analytical mechanics, the configuration \(\mathbf {x}\in \mathcal {X}\subset \mathcal {C}^{1}[I; {\mathbb {R}}^{n}]\) is a continuous vector-valued function of time \(t\in I \subset {\mathbb {R}}\). Its components \(\{ { x}_{i} \}\) (\(i = 1, \dots , n\)) are known as the *Lagrangian coordinates*. The input \(\mathbf {f}(t)\) is a given force vector function in \({\mathbb {R}}^{n}\). Therefore, the subjective functional in this case is \(\langle \mathbf {x}, \mathbf {f}\rangle = \int _{I} \mathbf {x}(t) \cdot \mathbf {f}(t) {\,\mbox{d}t}\). The total action of the system is

where *T* is the kinetic energy density, *V* is the potential density, and \(L= T- V\) is the standard *Lagrangian density*. In this case, the linear operator \(D = \partial _{t}\) is a derivative with time. Together, \(\Pi (\mathbf {x}) =\int _{I} [ T(\dot{ \mathbf {x}} ) - V(\mathbf {x}) - \mathbf {x}^{T} \mathbf {f}] {\,\mbox{d}t}\) is called the *total action*. For Newton mechanics, the kinetic energy is a quadratic (objective) function \(T(\mathbf {v}) = \frac{1}{2} m \Vert \mathbf {v}\Vert ^{2} \). Its stationary condition leads to the *Euler–Lagrange equation*:

Finite difference method for solving this second-order differential equation leads to a fixed point problem [42]. It is well known that if the potential energy \(V(\mathbf {x})\) is convex, the operator \({F}= \mathbf {f}+ \nabla V( \mathbf {x}) \) is monotone and the problem \((\mathcal {{P}}_{0})\) has a stable fixed point solution. Correspondingly, the system has a stable trajectory. Otherwise, the system could have chaotic solutions. The relation between chaos in nonlinear dynamical systems and NP-hardness in computer science has been discovered recently [37].

### Example 3

(Post-buckling of nonlinear Gao beam)

In large deformation solid mechanics, the correct nonlinear beam theory that can be used to model post-buckling phenomenon was proposed by Gao in 1996 [8], which is governed by a forth-order nonlinear differential equation:

where \(\chi (x)\) is the deflection of the beam, which is a scaler-valued function over its domain \([0,L]\), where *L* is the beam length, \({\alpha }> 0\) is a material constant, the parameter *λ* depends on the axial force, and \(q(x)\) is a given distributed lateral load. Clearly, this nonlinear deferential equation can be written in the following fixed point problem:

where the function \(f(x)\) depends on both the lateral load \(q(x)\) and boundary conditions. In this case, \(F(x,\chi (x))\) is a nonlinear integration operator. This fixed point problem is equivalent to the stationary point problem

It was indicated in [13] that if \({\lambda }< {\lambda }_{c}\), the Euler buckling load defined by

the total potential \(\Pi (\chi )\) is a convex functional, and problem (11) has only one fixed point. In this case, the beam is in a pre-buckling state. It was proved recently (see Lemma 2.1. and Theorem 2.1. in [40]) there exists a constant \({\lambda }^{G}_{c} > {\lambda }_{c}\) such that if \({\lambda }> {\lambda }^{G}_{c}\), then \(\Pi (\chi )\) is nonconvex, i.e., the so-called double-well potential, and the beam is in a post-buckling state. In this case, problem (11) has three fixed points \(\chi _{i}(x)\), \(i=1,2,3\), at each \(x \in [0,L]\): one global minimizer of \(\Pi (\chi )\), which corresponds to a globally stable post-buckling state of the beam, one local minimizer, which corresponds to a locally stable post-buckling state, and one local maximizer of \(\Pi (\chi )\), which corresponds to an un-buckled state. The combination of these three solutions at each \(x \in [0,L]\) forms a solution set with \(3^{\infty }\) number of strong solutions on \([0,L]\) to the nonlinear differential equation (9). It was proved in [25] that for certain lateral load distributions \(q(x)\), both the global and local minimum solutions could be nonsmooth and cannot be captured by any Newton-type method. Numerical approaches to this nonlinear differential equation are considered to be NP-hard by traditional theories and methods. In order to solve this challenging nonconvex stationary problem, a canonical dual finite element method has been developed recently [2]. The numerical results shown that the locally stable post-buckling configuration is extremely sensitive to the external load \(q(x)\) and numerical precision used in the program.

For unilateral post-buckling problems, the feasible set \(\mathcal {X}_{a}\) has usual inequality constraints. For example, a simply supported beam on a rigid foundation subjected to a downward lateral load \(q(x) \ \forall x\in [0,L]\), this feasible set is a convex cone:

Due to the inequality constraint in \(\mathcal {X}_{a}\), the stationary condition of problem (11) leads not only to the so-called variational inequality [38]

where \(\delta \Pi (\chi ) = \chi _{xxxx} - \frac{3}{2} {\alpha }\chi _{x}^{2} \chi _{xx} + {\lambda }\chi _{xx} - q\) is the Gâteaux derivative of \(\Pi (\chi )\), but also to the well-known complementarity condition

Since the contact region (i.e., on which \(\chi (x) = 0\)) remains unknown till the problem is solved, problem (11) is the combination of the nonlinear free-boundary value problem, non-monotone variational inequality, and the nonconvex variational analysis. This problem could be one of the most challenging problems in nonconvex analysis, which deserves serious study in the future.

Canonical duality-triality is a methodological theory which can be used not only for modeling complex systems within a unified framework, but also for solving real-world problems with a unified methodology. This theory was developed originally from Gao and Strang’s work for solving the following nonsmooth/nonconvex variational problem [30]:

where the variational argument \(\mathbf {u}(\mathbf {x})\) is a deformation field, *D* is a differential operator such that the deformation gradient \(\mathbf {w}=D \mathbf {u}\) is a two-point tensor filed, \({W}(\mathbf {w})\) is an internal (or free) energy which must be an objective function of **w** [6, 41], while \(U(\mathbf {u})\) is an external energy which must be a linear functional, i.e., \(U(\mathbf {u}) = \langle \mathbf {u}, \mathbf {f}\rangle \) such that \(\partial U(\mathbf {u}) = \mathbf {f}\) is a given external force field. Thus, the difference \({P}(\mathbf {u}) \) is the well-known total potential energy in nonlinear elasticity. This variational problem (14) covers the most challenging problems in nonconvex analysis and nonlinear partial differential equations. By the objectivity of the free energy \({W}(\mathbf {w})\), there must exist an objective tensor \(\mathbf {c}= \mathbf {w}^{T} \mathbf {w}\) and a real-valued function \(V(\mathbf {c})\) such that \({W}(\mathbf {w}) = V(\mathbf {c}(\mathbf {w}))\) [6]. In finite deformation theory and differential geometry, this objective measure \(\mathbf {c}= \mathbf {c}^{T}\) is the well-known Cauchy–Riemann strain tensor and \(V(\mathbf {c})\) is usually a canonical function, i.e., the duality relation \(\mathbf {c}^{*} = \partial V(\mathbf {c})\) is a bijection (say the St. Venant–Kirchhoff material [23]). These basic truths in nonlinear analysis lay a foundation for the canonical duality theory. This is the reason why this theory can be used to solve analytically a large class of nonconvex variational problems and their associated partial differential equations, including Einstein’s special relativity equation [12], Kantorovich’s optimal mass transfer problem [39], chaotic dynamics [37, 42], global optimization [16, 28], phase transitions in solids [32], post-buckling of large deformed beam [2], nonlinear PDEs in 3-dimensional finite deformation theory [9, 10, 20, 23], etc. For those problems that cannot be solved analytically, numerical discretization (such as the finite element method) can always be used so that the general nonconvex variational problem (14) can be approximately reformulated as a global optimization problem in \({\mathbb {R}}^{n}\). By the fact that the discretized \(W(\mathbf {w})\) may not be an objective function, the canonical duality theory has been generalized for solving general nonconvex and discrete optimization problems [5, 15, 17, 26, 27, 29, 36, 49] as well as the most challenging bi-level knapsack problems and topology optimization in multi-scale complex systems [21, 22].

However, the well-defined objectivity in nonlinear analysis and physics has been seriously misused in optimization and mathematical programming, where the so-called objective function is allowed to be any arbitrarily given function. As a consequence, Gao–Strang’s work has been mistakenly challenged by M.D. Voisei and C. Zalinescu [48]. By oppositely choosing linear functions as the objective function *W* (see Example 3.1 in [48]) and nonlinear functions as the external energy \(U(\mathbf {u})\) (see Examples 3.2, 3.4, 3.5, and 3.6 in [48]), they produced a series of “counter examples” that led to absurd conclusions including “The hope for reading an optimization theory with diverse applications is ruined by the manner in which [30] is written and the fact that the majority of the results in [30] are false.” These conceptual mistakes verified Arnold’s declaration [1]: “A teacher of mathematics, who has not got to grips with at least some of the volumes of the course by Landau and Lifshitz, will then become a relict like the one nowadays who does not know the difference between an open and a closed set.” A comprehensive review on the canonical duality theory and breakthrough from the recent challenges are given in [24].

The goal of this paper is to apply the canonical duality theory for solving the challenging fixed point problem. The rest of this paper is arranged as follows. Based on the concept of objectivity, the canonical dual for the fixed point problem, its analytical solution, and global optimality condition are presented in the next section. Applications to a general fixed point problem with sum of exponential functions and nonconvex polynomial are discussed in Sect. 4.1. Analytical solutions for a general fixed point problem with a sum of logarithmic and quadratic functions are given in Sect. 4.2. The paper ends with conclusions and future work.

## Results and discussion

According to the canonical duality, the linear measure \(\epsilon = D \mathbf {x}\) cannot be used directly for studying duality relation due to the objectivity. Also, the linear operator cannot change the nonconvexity of \(W(D\mathbf {x})\). We first introduce the canonical transformation.

### Definition 3

(Canonical function and canonical transformation)

A real-valued function \(V:\mathcal {E}_{a} \rightarrow {\mathbb {R}}\) is called canonical if the duality mapping \(\partial V: \mathcal {E}_{a} \rightarrow \mathcal {E}_{a}^{*}\) is one-to-one and onto.

For a given nonconvex function \(W:\mathcal {{W}}_{a} \rightarrow {\mathbb {R}}\), if there exist a geometrically admissible mapping \({\Lambda }:\mathcal {{W}}_{a} \rightarrow \mathcal {E}_{a}\) and a canonical function \(V:\mathcal {E}_{a} \rightarrow {\mathbb {R}}\) such that

then transformation (15) is called the canonical transformation and \(\boldsymbol {\xi }= {\Lambda }(\boldsymbol {\epsilon }) \) is called the canonical measure.

By this definition, the one-to-one duality relation \(\boldsymbol {\varsigma }= \partial V(\boldsymbol {\xi }) : \mathcal {E}_{a} \rightarrow \mathcal {E}^{*}_{a}\) implies that the canonical function \(V(\boldsymbol {\xi })\) is differentiable and its conjugate function \(V^{*}:\mathcal {E}^{*}_{a} \rightarrow {\mathbb {R}}\) can be uniquely defined by the Legendre transformation [11]

where \(\langle \boldsymbol {\xi }; \boldsymbol {\varsigma }\rangle \) represents the bilinear form on \(\mathcal {E}\) and its dual space \(\mathcal {E}^{*}\). In this case, \(V:\mathcal {E}_{a} \rightarrow {\mathbb {R}}\) is a canonical function if and only if the following canonical duality relations hold on \(\mathcal {E}_{a} \times \mathcal {E}^{*}_{a}\):

Let \(Q(\mathbf {x})=\frac{1}{2}\Vert \mathbf {x}\Vert ^{2} + \langle \mathbf {x}, \mathbf {f}\rangle \). Replacing \(V(\Lambda (\mathbf {x})) \) in the target function \(\Pi (\mathbf {x})\) by the Fenchel–Young equality \(V(\boldsymbol {\xi }) = \langle \boldsymbol {\xi }; \boldsymbol {\varsigma }\rangle - V^{*}(\boldsymbol {\varsigma })\), the Gao-Strang total complementary function (see [14]) \(\Xi : \mathcal {X}_{a} \times \mathcal {E}^{*}_{a} \rightarrow \mathbb{R}\) can be defined by

By this total complementary function, the canonical dual of \(\Pi (\mathbf {x})\) can be obtained as

where \(Q^{\Lambda }:\mathcal {E}^{*}_{a}\rightarrow \mathbb{R}\cup \{ - \infty \}\) is the so-called Λ-conjugate of \(Q(\mathbf {x})\) defined by (see [14])

Let \(\mathcal {S}_{a} \subset \mathcal {E}^{*}_{a}\) be an admissible set such that on which \(Q^{{\Lambda }}(\boldsymbol {\varsigma })\) is well-defined. If \({\Lambda }(\mathbf {x})\) is a homogeneous quadratic operator, i.e., \({\Lambda }({\alpha }\mathbf {x}) = {\alpha }^{2} {\Lambda }(\mathbf {x})\), then the total complementary function

where \(\mathbf {G}(\boldsymbol {\varsigma }) = \mathbf {H}(\boldsymbol {\varsigma }) - \mathbf {I}\), \(\mathbf {H}(\boldsymbol {\varsigma }) = \nabla ^{2}_{\mathbf {x}} \langle {\Lambda }(\mathbf {x}); \boldsymbol {\varsigma }\rangle \), and **I** is an identity matrix in \(\mathcal {X}\). In this case, the Λ-conjugate \(Q^{{\Lambda }}\) is simply defined by

and \(\mathcal {S}_{a} = \{ \boldsymbol {\varsigma }\in \mathcal {E}^{*}_{a}\mid \det \mathbf {G}(\boldsymbol {\varsigma }) \neq 0 \}\). Thus, the canonical dual problem \((\mathcal {{P}}^{d})\) can be proposed in the following:

By the canonical duality theory, we have the following results.

### Theorem 1

(Analytic solution and complementary-dual principle)

*For a given*
**f**, *if*
\(\bar {\boldsymbol {\varsigma }}\in \mathcal {S}_{a}\)
*is a solution to*
\((\mathcal {{P}}^{d})\), *then*

*is a solution to the problem*
\((\mathcal {{P}})\)
*and*

*If*
\(F(\mathbf {x})\)
*is a potential operator*, *then*
\({\bar {\mathbf {x}}}\)
*is also a solution to the fixed point problem*
\((\mathcal {{P}}_{0})\). *If*
\(F(\mathbf {x})\)
*is a non*-*potential operator*, *then*
\({\bar {\mathbf {x}}}\)
*is a solution to the fixed point problem*
\((\mathcal {{P}}_{0})\)
*only if*
\({\bar {\mathbf {x}}}\)
*is a global minimizer of*
\(\Pi (\mathbf {x})\).

### Proof

By the canonical duality theory we know that \(({\bar {\mathbf {x}}}, \bar {\boldsymbol {\varsigma }})\) is a critical point of \(\Xi (\mathbf {x}, \boldsymbol {\varsigma })\) if and only if \({\bar {\mathbf {x}}}\) is a critical point of \(\Pi (\mathbf {x})\) and \(\bar {\boldsymbol {\varsigma }}\) is a critical point of \(\Pi ^{d}(\boldsymbol {\varsigma })\). It is easy to prove that the criticality condition \(\nabla \Xi ({\bar {\mathbf {x}}}, \bar {\boldsymbol {\varsigma }}) = 0\) leads to the following canonical equations:

The first equation is the canonical equilibrium equation, which leads to the analytical solution (24). By the canonical duality, the canonical duality equation \({\Lambda }({\bar {\mathbf {x}}}) = \partial V^{*}(\bar {\boldsymbol {\varsigma }})\) leads to the complementary-duality relation (25). The theorem is proved by Lemma 1. □

Theorem 1 shows that the solution to the fixed point problem depends analytically on the canonical dual solution, and there is no duality gap between the primal problem (\(\mathcal {{P}}\)) and the canonical dual problem (\(\mathcal {{P}}^{d}\)). By the fact that the problem \((\mathcal {{P}})\) may have many fixed points, in order to identify the extremality of these fixed points, we assume that the canonical function \(V:\mathcal {E}_{a} \rightarrow {\mathbb {R}}\) is convex and introduce two open sets:

where \(\mathbf {G}(\boldsymbol {\varsigma })\succ 0\) means that **G** is a positive definite matrix, and \(\mathbf {G}(\boldsymbol {\varsigma }) \prec 0\) means that **G** is a negative definite matrix. Also according to the terminology used in the canonical duality theory, a neighborhood of a critical point is an open set containing only one critical point.

### Theorem 2

(Triality theorem)

*Suppose that*
\(\bar {\boldsymbol {\varsigma }}\)
*is a solution to*
\((\mathcal {{P}}^{d})\)
*and*
\({\bar {\mathbf {x}}}=\mathbf {G}^{-1}(\bar {\boldsymbol {\varsigma }})\mathbf {f}\). *If*
\(\bar {\boldsymbol {\varsigma }}\in \mathcal {S}_{a}^{+}\), *then*
\({\bar {\mathbf {x}}}\)
*is a globally stable fixed point and*

*If*
\(\bar {\boldsymbol {\varsigma }}\in \mathcal {S}_{a}^{-}\), *then*
\({\bar {\mathbf {x}}}\)
*is a local maximizer of*
\(\Pi (\mathbf {x})\)
*iff*
\(\bar {\boldsymbol {\varsigma }}\in \mathcal {S}_{a}^{-}\)
*is a local maximizer of*
\(\Pi ^{d}\)
*and on the neighborhood*
\(\mathcal {X}_{o} \times \mathcal {S}_{o} \subset \mathcal {X}_{a} \times \mathcal {S}_{a}^{-} \)
*of*
\(({\bar {\mathbf {x}}},\bar {\boldsymbol {\varsigma }})\), *we have*

*Moreover*, \({\bar {\mathbf {x}}}\)
*is a locally unstable fixed point of*
*F*
*if it is a potential operator*.

*If*
\(\bar {\boldsymbol {\varsigma }}\in \mathcal {S}_{a}^{-}\)
*and*
\(\dim \mathcal {X}_{a} = \dim \mathcal {S}_{a}\), *then*
\({\bar {\mathbf {x}}}\)
*is a local minimizer iff*
\(\bar {\boldsymbol {\varsigma }}\in \mathcal {S}^{-}_{a}\)
*is a local minimizer of*
\(\Pi ^{d}(\boldsymbol {\varsigma })\)
*and on the neighborhood*
\(\mathcal {X}_{o} \times \mathcal {S}_{o} \subset \mathcal {X}_{a} \times \mathcal {S}_{a}^{-} \),

*Moreover*, \({\bar {\mathbf {x}}}\)
*is a locally stable fixed point of*
*F*
*if it is a potential operator*.

This theorem is an application of the triality theory. Detailed proof can be found in [31]. Statement (27) is the so-called *canonical min-max duality*. This statement shows that the global stable fixed point problem n is equivalent to a concave maximization problem

Since the feasible space \(\mathcal {S}^{+}_{a}\) is an open convex set, this canonical dual problem can be solved easily by well-developed nonlinear optimization techniques. The second statement (28) is the *canonical double-max duality* and the third statement (29) is the *canonical double-min duality*. For a potential operator *F*, these two statements can be used to identify locally unstable and stable fixed points, respectively.

## Applications

### Exponential and polynomial functions

As our first application, the objective function is assumed to be

where \(D_{1} \in \mathbb{R}^{m\times n}\) and \(D_{2} \in \mathbb{R}^{p\times n}\) are two given matrices, *α*, *β*, *λ* are real numbers. Clearly, for a given \({\lambda }> 0\), \({W}(D\mathbf {x})\) is nonconvex and

is a non-monotone operator. In this case, the fixed point problem \((\mathcal {{P}}_{0})\) can be equivalently written as

Clearly, traditional methods for solving this nonlinear fixed point problem in \({\mathbb {R}}^{n}\) are difficult. However, by the canonical duality theory, this problem can be solved easily in \({\mathbb {R}}^{2}\).

The canonical measure in this problem can be given as

Correspondingly, the canonical function is

and the canonical dual variable is

By the Legendre transformation, the conjugate function \(V^{*}(\boldsymbol {\varsigma })\) is uniquely defined as

Since the canonical measure in this application is a homogeneous quadratic operator, the total complementary function \(\Xi : \mathbb{R}^{n}\times \mathcal {E}_{a}^{*}\rightarrow \mathbb{R}\) has the following form:

where

On the canonical dual feasible space \(\mathcal {S}_{a}= \{ \boldsymbol {\varsigma }=[\varsigma _{1},\varsigma _{2}]^{T} \in \mathcal {E}_{a}^{*} \mid \det ( \mathbf {G}(\boldsymbol {\varsigma })) \neq 0 \}\), the canonical dual problem can be formulated as

### Example 1

Let \(n=2\), \(\alpha =6\), \(\beta =8\), \(\lambda =1\), and

then the primal function (see Fig. 1)

The corresponding canonical dual function is

Its graph is shown by Fig. 2. It is easy to find that the canonical dual problem \((\mathcal {{P}}^{d}) \) has three solutions:

By Theorem 1 we have three primal solutions:

It is easy to check that

By Theorem 2 we know that \(\mathbf {x}^{1} \) is a global minimizer of \(\Pi (\mathbf {x})\), \(\mathbf {x}^{2}\) is a local maximizer of \(\Pi (\mathbf {x})\), and \(\mathbf {x}^{3}=[-0.264945, 0.112718]^{T}\) is a local minimizer of \(\Pi (\mathbf {x})\) (see Fig. 1). By the fact that

hold for all \(i=1,2,3\), we know that \(\{ \mathbf {x}^{i}\} \) (\(i=1,2,3\)) are all fixed points.

### Logarithmic and quadratic function

In this application, we let

where \(D\in \mathbb{R}^{m\times n}\) is a matrix, \(c_{1}\), \(c_{2}\) are real numbers. Clearly, \({W}(D\mathbf {x})\) is nonconvex and

is non-monotone. The fixed point problem \(\mathbf {x}= F(\mathbf {x})\) can be reformulated as

By using the canonical measure

the canonical function is \(V(\xi )=c_{1} \xi +c_{2} \xi (\log \xi +1)\) and its Legendre conjugate is

which is convex on its domain \(\mathcal {E}^{*}_{a} = {\mathbb {R}}\). In this case, we have the total complementary function

where \(\mathbf {G}(\varsigma )=2\varsigma D^{T} D- \mathbf {I}\) and the canonical dual problem is

### Example 2

We first let \(m=n=2\), \(c_{1}=-8\), \(c_{2}=10\), and

The primal function

is nonconvex and its graph is shown in Fig. 3. The corresponding canonical dual function is

For this example, the one-dimensional canonical dual problem \((\mathcal {{P}}^{d})\) can be solved easily (by using Mathematica) to obtain total three solutions (see Fig. 4):

Correspondingly, the three primal solutions are

It is easy to check that \(\mathbf {x}^{i} = F(\mathbf {x}^{i})\), \(i=1,2,3\). Therefore, \(\{\mathbf {x}^{i}\}\) are fixed points. Since \(\varsigma ^{1} \in \mathcal {S}^{+}_{a} = \{ \varsigma \in {\mathbb {R}}\mid \varsigma > 0 \} \), we know that \(\mathbf {x}^{1}\) is a globally stable fixed point. It is easy to check that \(\mathbf {x}^{2} \) is a locally stable fixed point, \(\mathbf {x}^{3}\) is a locally unstable fixed point, and

### Example 3

We now let \(m=3\), \(n=2\), \(c_{1}=-15\), \(c_{2}=9\), and

then the primal function is

Its graph is a nonconvex surface in \({\mathbb {R}}^{3}\), which has multiple critical points, but their locations cannot be found precisely as the surface is rather flat around these critical points (see Figs. 5–7). However, its canonical dual is a single-valued function

and from its graph, we can see clearly that it has five critical points in total (see Figs. 8–9). These critical points can be easily obtained by Mathematica:

By Theorem 1, we have all the primal solutions:

Since \(F(\mathbf {x})\) is a potential operator, these stationary points are all fixed points of \(F(\mathbf {x})\). It is easy to find that the matrix \(\mathbf {G}(\varsigma ) \) has two singularity points: \(\varsigma _{1} = 19.266\) and \(\varsigma _{2} = 0.367\); therefore,

By the facts that \(\varsigma ^{1} \in \mathcal {S}^{+}_{a}\) and \(\varsigma ^{5}\in \mathcal {S}^{-}_{a}\), we know that \(\mathbf {x}^{1}\) is a globally stable fixed point, \(\mathbf {x}^{5}\) is a locally unstable fixed point. Although \(\varsigma ^{4} \in \mathcal {S}^{-}_{a}\) is a local minimizer of \(\Pi ^{d}(\varsigma )\), we cannot say if \(\mathbf {x}^{4}\) is a locally stable fixed point since \(\dim \mathcal {X}_{a} = 2 \neq \dim \mathcal {S}_{a} = 1\). But by the complementary-dual principle and the order of the canonical dual solutions \(\{\varsigma ^{i} \}\), we have

## Conclusions

Based on the canonical duality theory, a unified model is proposed such that the general fixed point problems can be reformulated as a global optimization problem. This model is directly related to many other challenging problems in variational inequality, d.c. programming, chaotic dynamics, nonconvex analysis/PDEs, post-buckling of large deformed structures, phase transitions in solids, computer science, etc. (see [24] and the references cited therein). By the complementary-dual principle, all the fixed points can be obtained analytically in terms of the canonical dual solutions. Their stability and extremality are identified by the triality theory. Applications are illustrated by problems governed by nonconvex polynomial, exponential, and logarithmic functions. Our examples show that both globally stable and locally stable/unstable fixed point problems in \({\mathbb {R}}^{n}\) can be obtained easily by solving the associated canonical dual problems in \({\mathbb {R}}^{m}\) with \(m< n\). However, the local stability condition for those fixed points \({\bar {\mathbf {x}}}(\bar {\boldsymbol {\varsigma }})\) with indefinite \(\mathbf {G}(\bar {\boldsymbol {\varsigma }})\) still remains unknown, and it deserves serious study in the future. Also, the results presented in this paper can be generalized to problems with nonsmooth potential functions.

## References

- 1.
Anorld, V.I.: On teaching mathematics. Russ. Math. Surv.

**53**(1), 229–236 (1998) - 2.
Ali, E., Gao, D.Y.: Improved canonical dual finite element method and algorithm for post-buckling analysis of nonlinear gao beam. In: Gao, D.Y., Latorre, V., Ruan, N. (eds.) Canonical Duality Theory: Unified Methodology for Multidisciplinary Study, pp. 277–290. Springer, New York (2017)

- 3.
Bierlaire, M., Crittin, F.: Solving noisy, large-scale fixed-point problems and systems of nonlinear equations. Transp. Sci.

**40**, 44–63 (2006) - 4.
Border, K.C.: Fixed Point Theorems with Applications to Economics and Game Theory. Cambridge University Press, New York (1985)

- 5.
Chen, Y., Gao, D.Y.: Global solutions to nonconvex optimization of 4th-order polynomial and log-sum-exp functions. J. Glob. Optim.

**64**(3), 417–431 (2016) - 6.
Ciarlet, P.G.: Linear and Nonlinear Functional Analysis with Applications. SIAM, Philadelphia (2013)

- 7.
Eaves, B.C.: Homotopies for computation of fixed points. Math. Program.

**3**, 1–12 (1972) - 8.
Gao, D.Y.: Nonlinear elastic beam theory with applications in contact problem and variational approaches. Mech. Res. Commun.

**23**(1), 11–17 (1996) - 9.
Gao, D.Y.: General analytic solutions and complementary variational principles for large deformation nonsmooth mechanics. Meccanica

**34**, 169–198 (1999) - 10.
Gao, D.Y.: Pure complementary energy principle and triality theory in finite elasticity. Mech. Res. Commun.

**26**(1), 31–37 (1999) - 11.
Gao, D.Y.: Duality Principles in Nonconvex Systems: Theory, Methods and Applications. Springer, New York (2000)

- 12.
Gao, D.Y.: Analytic solution and triality theory for nonconvex and nonsmooth variational problems with applications. Nonlinear Anal.

**42**(7), 1161–1193 (2000) - 13.
Gao, D.Y.: Finite deformation beam models and triality theory in dynamical post-buckling analysis. Int. J. Non-Linear Mech.

**5**, 103–131 (2000) - 14.
Gao, D.Y.: Canonical dual transformation method and generalized triality theory in nonsmooth global optimization. J. Glob. Optim.

**17**(1/4), 127–160 (2000) - 15.
Gao, D.Y.: Sufficient conditions and perfect duality in nonconvex minimization with inequality constraints. J. Ind. Manag. Optim.

**1**(1), 59–69 (2005) - 16.
Gao, D.Y.: Complete solutions and extremality criteria to polynomial optimization problems. J. Glob. Optim.

**35**, 131–143 (2006) - 17.
Gao, D.Y.: Solutions and optimality to box constrained nonconvex minimization problems. J. Ind. Manag. Optim.

**3**(2), 293–304 (2007) - 18.
Gao, D.Y.: On unified modeling, theory, and method for solving multi-scale global optimization problems. In: Sergeyev, Y.D., Kvasov, D.E., Mukhametzhanov, M.S. (eds.) Proceedings of the 2nd International Conference Numerical Computations: Theory and Algorithms. AIP Conference Proceedings, vol. 1776, 020005 (2016). https://doi.org/10.1063/1.4965311

- 19.
Gao, D.Y.: On unified modeling, canonical duality-triality theory, challenges and breakthrough in optimization. https://arxiv.org/abs/1605.05534 (2016)

- 20.
Gao, D.Y.: Analytic solutions to large deformation problems governed by generalized neo-Hookean model. In: Gao, D.Y., Latorre, V., Ruan, N. (eds.) Canonical Duality Theory: Unified Methodology for Multidisciplinary Study, pp. 49–68. Spinger, New York (2017)

- 21.
Gao, D.Y.: On topology optimization and canonical duality method. Comput. Methods Appl. Mech. Eng.

**341**, 249–277 (2018) - 22.
Gao, D.Y.: Canonical duality-triality: Unified understanding modeling, problems, and NP-hardness in multi-scale optimization. In: Singh, V.K., Gao, D.Y., Fisher, A. (eds.) Emerging Trends in Applied Mathematics and Hi-Perfermance Computingy, Springer, New York (2018)

- 23.
Gao, D.Y., Hajilarov, E.: Analytic solutions to 3-d finite deformation problems governed by St. Venant–Kirchhoff material. In: Gao, D.Y., Latorre, V., Ruan, N. (eds.) Canonical Duality Theory: Unified Methodology for Multidisciplinary Study, pp. 69–88. Spinger, New York (2017)

- 24.
Gao, D.Y., Latorre, V., Ruan, N.: Canonical Duality Theory: Unified Methodology for Multidisciplinary Study. Advances in Mechanics and Mathematics, vol. 37. Springer, New York (2017). https://doi.org/10.1007/978-3-319-58017-3

- 25.
Gao, D.Y., Ogden, R.W.: Multi-solutions to non-convex variational problems with implications for phase transitions and numerical computation. Q. J. Mech. Appl. Math.

**61**, 497–522 (2008) - 26.
Gao, D.Y., Ruan, N.: Solutions to quadratic minimization problems with box and integer constraints. J. Glob. Optim.

**47**(3), 463–484 (2010) - 27.
Gao, D.Y., Ruan, N., Latorre, V.: Canonical duality-triality theory: bridge between nonconvex analysis/mechanics and global optimization in complex systems. In: Gao, D.Y., Latorre, V., Ruan, N. (eds.) Canonical Duality Theory: Unified Methodology for Multidisciplinary Study, pp. 1–48. Springer, New York (2017)

- 28.
Gao, D.Y., Ruan, N., Sherali, H.: Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality. J. Glob. Optim.

**45**, 473–497 (2009) - 29.
Gao, D.Y., Ruan, N., Sherali, H.D.: Canonical duality solutions for fixed cost quadratic program. In: Chinchuluun, A., Pardalos, P., Enkhbat, R., Tseveendorj, I. (eds.) Optimization and Optimal Control. Springer Optimization and Its Applications, vol. 39, pp. 139–156. Springer, New York (2010). https://doi.org/10.1007/978-0-387-89496-6_7

- 30.
Gao, D.Y., Strang, G.: Geometric nonlinearity: potential energy, complementary energy, and the gap function. Q. J. Mech. Appl. Math.

**XLVII**(3), 487–504 (1989) - 31.
Gao, D.Y., Wu, C.: Triality theory for general unconstrained global optimization problems. In: Gao, D.Y., Latorre, V., Ruan, N. (eds.) Canonical Duality Theory: Unified Methodology for Multidisciplinary Study, pp. 127–154. Springer, New York (2017)

- 32.
Gao, D.Y., Yu, H.F.: Multi-scale modelling and canonical dual finite element method in phase transitions of solids. Int. J. Solids Struct.

**45**, 3660–3673 (2008) - 33.
Hirsch, M.D., Papadimitriou, C., Vavasis, S.: Exponential lower bounds for finding Brouwer fixed points. J. Complex.

**5**, 379–416 (1989) - 34.
Huang, Z., Khachiyan, L., Sikorski, K.: Approximating fixed points of weakly contracting mappings. J. Complex.

**15**, 200–213 (1999) - 35.
Jin, Z., Gao, D.Y.: On modeling and global solutions for d.c. optimization problems by canonical duality theory. Appl. Math. Comput.

**296**, 168–181 (2017). https://doi.org/10.1016/j.amc.2016.10.010 - 36.
Latorre, V., Gao, D.Y.: Canonical duality for solving general nonconvex constrained problems. Optim. Lett.

**10**(8), 1763–1779 (2016). https://doi.org/10.1007/s11590-015-0860-0 - 37.
Latorre, V., Gao, D.Y.: Global optimal trajectory in chaos and NP-hardness. Int. J. Bifurc. Chaos

**26**, 1650142 (2016) - 38.
Liu, G.S., Gao, D.Y., Wang, S.Y.: Canonical duality theory for solving non-monotone variational inequality problems. In: Gao, D.Y., Latorre, V., Ruan, N. (eds.) Canonical Duality Theory: Unified Methodology for Multidisciplinary Study, pp. 155–172. Springer, New York (2017)

- 39.
Lu, X.J., Gao, D.Y.: Canonical duality method for solving Kantorovich mass transfer problem. In: Gao, D.Y., Latorre, V., Ruan, N. (eds.) Canonical Duality Theory: Unified Methodology for Multidisciplinary Study, pp. 105–126. Spinger, New York (2017)

- 40.
Machalova, J., Netuka, H.: Control variational method approach to bending and contact problems for Gao beam. Appl. Math.

**62**(6), 1–17 (2017). https://doi.org/10.21136/AM.2017.0168-17 - 41.
Marsden, J.E., Hughes, T.J.R.: Mathematical Foundations of Elasticity. Prentice-Hall, New York (1983)

- 42.
Ruan, N., Gao, D.Y.: Canonical duality approach for nonlinear dynamical systems. IMA J. Appl. Math.

**79**, 313–325 (2014) - 43.
Scarf, H.: The approximation of fixed point of a continuous mapping. SIAM J. Appl. Math.

**35**, 1328–1343 (1967) - 44.
Scarf, H.E., Hansen, T.: Computation of Economic Equilibria. Yale University Press, New Haven (1973)

- 45.
Shellman, S., Sikorski, K.: A two-dimensional bisection envelope algorithm for fixed points. J. Complex.

**2**, 641–659 (2002) - 46.
Shellman, S., Sikorski, K.: A recursive algorithm for the infinity-norm fixed point problem. J. Complex.

**19**, 799–834 (2003) - 47.
Smart, D.R.: Fixed Point Theorems. Cambridge University Press, Cambridge (1980)

- 48.
Voisei, M.D., Zalinescu, C.: Some remarks concerning Gao–Strang’s complementary gap function. Appl. Anal.

**90**(6), 1111–1121 (2011) - 49.
Wang, Z.B., Fang, S.-C., Gao, D.Y., Xing, W.X.: Global extremal conditions for multi-integer quadratic programming. J. Ind. Manag. Optim.

**4**(2), 213–225 (2008) - 50.
Yang, Z.: Computing Equilibria and Fixed Points: The Solution of Nonlinear Inequalities. Kluwer Academic Publishers, Dordrecht (1999)

### Acknowledgements

The authors are thankful to the editors and the anonymous referees for their valuable comments, which reasonably improved the presentation of the manuscript.

### Availability of data and materials

Data sharing not applicable to this article as no datasets were generated or analyzed during the current study.

## Funding

The research was supported by US Air Force Office of Scientific Research under the grants (AOARD) FA2386-16-1-4082 and FA9550-17-1-0151.

## Author information

### Affiliations

### Contributions

All authors contributed equally and significantly in writing this article. All authors read and approved the final manuscript.

### Corresponding author

## Ethics declarations

### Competing interests

The authors declare that they have no competing interests.

## Additional information

### Abbreviations

Not applicable.

### Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

## Rights and permissions

**Open Access** This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

## About this article

### Cite this article

Ruan, N., Gao, D.Y. On modeling and complete solutions to general fixpoint problems in multi-scale systems with applications.
*Fixed Point Theory Appl* **2018, **23 (2018). https://doi.org/10.1186/s13663-018-0648-x

Received:

Accepted:

Published:

### MSC

- 47H10
- 47H14
- 55M05
- 65K10

### Keywords

- Fixed point
- Properly-posed problem
- Nonconvex optimization
- Canonical duality theory
- Mathematical modeling
- Multidisciplinary studies