Next Article in Journal
Fourier Transform of the Orthogonal Polynomials on the Unit Ball and Continuous Hahn Polynomials
Next Article in Special Issue
Fixed Point Theory for Multi-Valued Feng–Liu–Subrahmanyan Contractions
Previous Article in Journal
A Shortcut Method to Solve for a 1D Heat Conduction Model under Complicated Boundary Conditions
Previous Article in Special Issue
On a New Integral Inequality: Generalizations and Applications
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Plane Section Curves on Surfaces of NCP Functions

Department of Mathematics, National Taiwan Normal University, Taipei 11677, Taiwan
*
Author to whom correspondence should be addressed.
Axioms 2022, 11(10), 557; https://doi.org/10.3390/axioms11100557
Submission received: 8 September 2022 / Revised: 30 September 2022 / Accepted: 30 September 2022 / Published: 14 October 2022
(This article belongs to the Special Issue Special Issue in Honor of the 60th Birthday of Professor Hong-Kun Xu)

Abstract

:
The goal of this paper is to investigate the curves intersected by a vertical plane with the surfaces based on certain NCP functions. The convexity and differentiability of these curves are studied as well. In most cases, the inflection points of the curves cannot be expressed exactly. Therefore, we instead estimate the interval where the curves are convex under this situation. Then, with the help of differentiability and convexity, we obtain the local minimum or maximum of the curves accordingly. The study of these curves is very useful to binary quadratic programming.

1. Introduction

The nonlinear complementarity problem (NCP) is finding a vector x R n such that
x 0 , F ( x ) 0 and x , F ( x ) = 0 ,
where · , · is the Euclidean inner product and F is a function from R n to R n . Since a few decades ago, the NCP has attracted significant attention due to its various applications in areas such as economics, engineering, and information engineering [1]. There are many methods proposed for solving the NCP. One popular approach is to reformulate the NCP as a system of nonlinear equations, whereas the other approach is to recast the NCP as an unconstrained minimization problem. Both methods rely on the so-called NCP function. A function ϕ : R 2 R is said to be an NCP function if it satisfies
ϕ ( a , b ) = 0 a 0 , b 0 and a b = 0 .
In light of the NCP function, one can define the vector-valued function Φ F ( x ) : R n R n by
Φ F ( x ) : = ϕ ( x 1 , F 1 ( x ) ) ϕ ( x n , F n ( x ) ) ,
where F ( x ) = ( F 1 ( x ) , , F n ( x ) ) is a mapping from R n to R n . Consequently, solving the NCP is equivalent to solving a system of equation Φ F ( x ) = 0 . In particular, it also induces a merit function of the NCP which is given by
min x R n Ψ F ( x ) : = 1 2 Φ F ( x ) 2 .
It is clear that the global minimizer of Ψ F ( x ) is the solution to the NCP. During the past few decades, several NCP functions have been discovered [2,3,4,5,6,7]. A well-known NCP function is the Fischer–Burmeister function [8,9] ϕ FB : R 2 R , defined as
ϕ FB ( a , b ) = | | ( a , b ) | | ( a + b ) ,
where | | ( a , b ) | | = a 2 + b 2 . In [10], Tseng did an extension of the Fischer–Burmeister function, in which a 2-norm is relaxed to a general p-norm. In other words, the so-called generalized FB function is defined by
ϕ FB p ( a , b ) = | | ( a , b ) | | p ( a + b ) ,
where | | ( a , b ) | | p = | a | p + | b | p p and p > 1 . Similarly, it induces a merit function ψ FB p : R 2 R + given by
ψ FB p ( a , b ) = 1 2 | ϕ F B p ( a , b ) | 2
where p > 1 .
Another popular NCP function is the natural residual function [4], ϕ NR : R R given by
ϕ NR ( a , b ) = a ( a b ) + .
Is there a similar extension for the natural residual NCP function? Wu, Ko and Chen answered this question in [4]. The extension is kind of discrete generalization because they defined the function ϕ NR p : R 2 R by
ϕ NR p ( a , b ) = a p ( a b ) + p ,
where p > 1 and p is an odd integer. Recently, the idea of discrete generalization of natural residual function has beei applied to construct discrete Fischer–Burmeister functions. More specifically, ϕ D FB p : R 2 R is defined by
ϕ D FB p ( a , b ) = ( a 2 + b 2 ) p ( a + b ) p ,
where p > 1 and p is an odd integer. If p = 1 , then it is exactly the classical Fischer–Burmeister function (see [4,11]). The graph of ϕ NR p is not symmetric. Is it possible to construct a symmetric natural residual NCP function? Chang, Yang, and Chen answered this question in [2]. Note that the function ϕ NR p can also be expressed as a piecewise function:
ϕ NR p ( a , b ) = a p ( a b ) p , i f a > b , a p , i f a b ,
where p > 1 and p is an odd integer. They use this expression of ϕ NR p to modify the part on a < b , and achieve symmetrization of ϕ S NR p ( a , b ) as below:
ϕ S NR p ( a , b ) = a p ( a b ) p , i f a > b , a p = b p , i f a = b , b p ( b a ) p , i f a < b ,
where p > 1 and p is an odd integer. Surprisingly, it is still an NCP function.
How about the merit function induced by ϕ S NR p ( a , b ) ? Observing that the merit function has squared terms, Chang, Yang, and Chen combined a p and b p together and constructed ψ S NR p ( a , b ) as
ψ S NR p ( a , b ) = a p b p ( a b ) p b p , i f a > b , a p b p = a 2 p , i f a = b , a p b p ( b a ) p a p , i f a < b ,
where p > 1 and p is an odd integer.
Recently, more and more NCP functions have been discovered. As mentioned, Wu et al. [4] proposed a discrete type of natural residual function. Regarding this discrete counterpart, Alcantara and Chen [1] consider a continuous type of natural residual function as below:
ϕ ˜ NR p ( a , b ) = sgn ( a ) | a | p [ ( a b ) + ] p ,
where p > 1 is a real number and
sgn ( x ) = 1 , if   x > 0 , 0 , if   x = 0 , 1 , if   x < 0 .
The main principle behind their work is described as follows. If f ( · ) is a bijection mapping and ϕ = ϕ 1 ϕ 2 is a given NCP function, then f ( ϕ ) = f ( ϕ 1 ) f ( ϕ 2 ) is also an NCP function. Hence, it can be verified that
ϕ ˜ NR p ( a , b ) = f ( a ) f ( [ a b ] + )
is an NCP function by employing the bijective function f ( t ) = sgn ( t ) | t | p , see [12]. Note that when p is an positive odd integer, it reduces to the discrete type of a natural residual function, that is, ϕ ˜ NR p ( a , b ) = ϕ NR p ( a , b ) .
For further symmetrization, using the above idea in (5) and (6), one can obtain a continuous type of natural residual functions [12]:
ϕ ˜ S NR p ( a , b ) = sgn ( a ) | a | p ( a b ) p , if   a b , sgn ( b ) | b | p ( b a ) p , if   a < b ,
and its corresponding merit function
ψ ˜ S NR p ( a , b ) = sgn ( a ) sgn ( b ) | a | p | b | p sgn ( b ) ( a b ) p | b | p , if   a b , sgn ( a ) sgn ( b ) | a | p | b | p sgn ( a ) ( b a ) p | a | p , if   a < b ,
where p > 0 . Again, when p is an odd integer, we see the beloe relations,
ϕ ˜ S NR p ( a , b ) = ϕ S NR p ( a , b ) , and ψ ˜ S NR p ( a , b ) = ψ S NR p ( a , b ) .
The NCP functions can also be constructed by certain invertible functions. What kind of inverse functions can be applied to construct the NCP functions? Lee, Chen, and Hu [6] figured it out in ([6], Proposition 3.8). In particular, let f : R R be a continuous differentiable function and g : R R with g ( 0 ) = 1 . They chose functions of f ( t ) and g ( t ) satisfying the below conditions to construct new NCP functions:
(i)
f is invertible on [ 1 , ) .
(ii)
( f 1 ) is a strictly monotonically increasing function.
(iii)
g ( 0 ) = 1 , g ( t ) 1 , t > 0 and 1 2 < g ( t ) 1   t < 0 .
More specifically, it is shown that the function
ϕ f , g ( a , b ) = f ( f 1 ( | a | ) + f 1 ( | b | ) f 1 ( 0 ) ) ( g ( b ) a + g ( a ) b )
is an NCP function. For example, taking f ( t ) = ln ( t ) , we see that f ( t ) is invertible on [ 1 , ) and the inverse function is f 1 ( t ) = e t . It is easy to see that ( f 1 ( t ) ) = e t > 0 , t R . Thus, f 1 is strictly monotone increasing on R . For third condition, we take g ( t ) = e t , which gives g ( t ) > 1 on ( 1 , ) and 1 2 < g ( t ) < 1 on ( , 0 ) . We list some more examples of f and g as below. Examples of f ( t ) are
f 1 ( t ) = t 1 , f 2 ( t ) = t 1 5 , f 3 ( t ) = ln ( t ) ,
and examples of g ( t ) are
g 1 ( t ) = e t , g 2 ( t ) = t 2 + 4 + t 2 , g 3 ( t ) = 4 e t 1 + 2 e t .
In summary, nine corresponding NCP functions are generated by using the above f ( t ) and g ( t ) .
ϕ f 1 , g 1 ( a , b ) = a 2 + b 2 e b a e a b . ϕ f 1 , g 2 ( a , b ) = a 2 + b 2 b 2 + 4 + b 2 a a 2 + 4 + a 2 b . ϕ f 1 , g 3 ( a , b ) = a 2 + b 2 4 e b 1 + 2 e b a 4 e a 1 + 2 e a b . ϕ f 2 , g 1 ( a , b ) = | a | 5 + | b | 5 5 e b a e a b . ϕ f 2 , g 2 ( a , b ) = | a | 5 + | b | 5 5 b 2 + 4 + b 2 a a 2 + 4 + a 2 b . ϕ f 2 , g 3 ( a , b ) = | a | 5 + | b | 5 5 4 e b 1 + 2 e b a 4 e a 1 + 2 e a b . ϕ f 3 , g 1 ( a , b ) = ln ( e | a | + e | b | 1 ) e b a e a b . ϕ f 3 , g 2 ( a , b ) = ln ( e | a | + e | b | 1 ) b 2 + 4 + b 2 a a 2 + 4 + a 2 b . ϕ f 3 , g 3 ( a , b ) = ln ( e | a | + e | b | 1 ) 4 e b 1 + 2 e b a 4 e a 1 + 2 e a b .
In [13], Tsai et al. discussed the geometry of curves on Fischer–Burmeister function surfaces, which are intersected by the plane a + b = 2 r for r R . They parametrized the curves by considering a = r + t and b = r t and defined the vector valued function α ( t ) : R R 3 and β ( t ) : R R 3 as α ( t ) = ( r + t , r t , ϕ ( r + t , r t ) ) and β ( t ) = ( r + t , r t , ψ ( r + t , r t ) ) , respectively. Tsai et al. also found the local maxima and minima and studied the convexity of curves.
In this paper, we follow a similar idea to the one in [13] to investigate the curves, which are the intersection of a vertical plane a + b = 1 and surfaces based on NCP functions. We also have to point out that the study on these curves is very useful to binary quadratic programming. See [14] for the details. We parametrize the curves by the vector functions τ ( x ) : R R 3 and σ ( x ) : R R 3 , where τ ( x ) = ( x , 1 x , ϕ ( x , 1 x ) ) and σ ( x ) = ( x , 1 x , ϕ ( x , 1 x ) ) . Then, we explore the behavior of the curves when the value p is perturbed. In addition, we discuss the convexity and local minimum and maximum of curves. Although the inflection points cannot be exactly determined, we can still estimate the interval in which the curves are convex such as in ([14], Proposition 2.1(b)). With the convexity or differentiability of a curve, we discuss the local minimum and maximum.

2. Preliminaries

In this section, we review some prerequisite knowledge about the convexity and differentiability of NCP functions which will be applied to investigate the curves. First, it is known that the convexity and differentiability of an NCP function cannot hold simultaneously (see [15]). The convexity of NCP functions has been thoroughly investigated in the literature. We will now quickly recall some results directly.
Lemma 1
([3], Property 2.1 and Property 2.2, [2], Proposition 2.2). Let ϕ FB p , ψ FB p and ϕ D FB p be defined as in (1), (2) and (4) respectively. Then, the following hold.
(a)
The function ϕ FB p ( a , b ) is differentiable everywhere except for the origin, and convex on R 2 , provided p > 1 .
(b)
The function ψ FB p ( a , b ) is differentiable everywhere, but neither convex nor concave, provided p > 1 .
(c)
The function ϕ D FB p ( a , b ) is differentiable everywhere, but neither convex nor concave provided p > 1 and is an odd integer.
Lemma 2
([4], Proposition 2.4, [2], Proposition 2.2). Let ϕ NR p , ϕ S NR p , and ψ S NR p be defined as in (3), (5) and (6) respectively. Then, when p > 1 and is an odd integer, the following hold.
(a)
The function ϕ NR p ( a , b ) is differentiable everywhere, but neither convex nor concave.
(b)
The function ϕ S NR p ( a , b ) is differentiable everywhere except for a = b . but neither convex nor concave.
(c)
The function ψ S NR p ( a , b ) is differentiable everywhere, but neither convex nor concave.
Lemma 3
([1], Proposition 2). Let ϕ ˜ NR p , ϕ ˜ S NR p and ψ ˜ S NR p be defined as in (7), (8) and (9) respectively. Then, for p > 1 , the following hold.
(a)
The function ϕ ˜ NR p ( a , b ) is differentiable everywhere, but neither convex nor concave.
(b)
The function ϕ ˜ S NR p ( a , b ) is differentiable everywhere except for a = b , but neither convex nor concave.
(c)
The function ψ ˜ S NR p ( a , b ) is differentiable everywhere, but neither convex nor concave.
Proposition 1
([12], Proposition 2.3). Suppose that g is strictly increasing on some interval I = [ 0 , t 0 ) . Then, for p > 1 , the function ϕ g p = ( a , b ) p ( g ( b ) a + g ( a ) b ) is an NCP function, but nonconvex.
We can apply Proposition 1 to check the convexity of NCP functions as in (10). In particular, based on Proposition 1, the following NCP functions are nonconvex and not differentiable at ( 0 , 0 ) .
(a)
ϕ f 1 , g 1 ( a , b ) = a 2 + b 2 e b a e a b .
(b)
ϕ f 1 , g 2 ( a , b ) = a 2 + b 2 b 2 + 4 + b 2 a ( a 2 + 4 + a 2 ) b .
(c)
ϕ f 1 , g 3 ( a , b ) = a 2 + b 2 4 e b 1 + 2 e b a ( 4 e a 1 + 2 e a ) b .
(d)
ϕ f 2 , g 1 ( a , b ) = | a | 5 + | b | 5 5 e b a e a b .
(e)
ϕ f 2 , g 2 ( a , b ) = | a | 5 + | b | 5 5 b 2 + 4 + b 2 a ( a 2 + 4 + a 2 ) b .
(f)
ϕ f 2 , g 3 ( a , b ) = | a | 5 + | b | 5 5 4 e b 1 + 2 e b a ( 4 e a 1 + 2 e a ) b .
Moreover, the below NCP functions are nonconvex as well.
(g)
ϕ f 3 , g 1 ( a , b ) = ln ( e | a | + e | b | 1 ) e b a e a b .
(h)
ϕ f 3 , g 2 ( a , b ) = ln ( e | a | + e | b | 1 ) b 2 + 4 + b 2 a ( a 2 + 4 + a 2 ) b .
(i)
ϕ f 3 , g 3 ( a , b ) = ln ( e | a | + e | b | 1 ) 4 e b 1 + 2 e b a ( 4 e a 1 + 2 e a ) b .

3. The Differentiability of the Curves

In this section, we investigate the differentiability of the curves, which are the intersection of surfaces of NCP functions ϕ ( a , b ) , (or merit functions ψ ( a , b ) ) with the vertical plane a + b = 1 . To proceed, we set a = x and b = 1 x . Then, the curves are parameterized as
τ ( x ) = ϕ ( x , 1 x ) and σ ( x ) = ψ ( x , 1 x ) .
From the aforementioned NCP functions in Section 2, the parametrized curves are listed as below:
τ FB p ( x ) = | x | p + | 1 x | p p 1 .
σ FB p ( x ) = 1 2 | τ FB p ( x ) | 2 .
τ D FB p ( x ) = x 2 + ( 1 x ) 2 p 1 .
τ NR p ( x ) = x p ( 2 x 1 ) + p .
τ S NR p ( x ) = x p ( 2 x 1 ) p , if x > 1 2 , ( 1 2 ) p , if x = 1 2 , ( 1 x ) p ( 1 2 x ) p , if x < 1 2 .
σ S NR p ( x ) = x p ( 1 x ) p ( 2 x 1 ) p ( 1 x ) p , if x > 1 2 , ( 1 2 ) 2 p , if x = 1 2 , x p ( 1 x ) p x p ( 1 2 x ) p , if x < 1 2 .
τ ˜ NR p ( x ) = sgn ( x ) | x | p [ ( 2 x 1 ) + ] p .
τ ˜ S NR p ( x ) = sgn ( x ) | x | p ( 2 x 1 ) p , if x 1 2 , sgn ( 1 x ) | 1 x | p ( 1 2 x ) p , if x < 1 2 .
σ ˜ S NR p ( x ) = sgn ( x ) sgn ( 1 x ) | x | p | 1 x | p sgn ( 1 x ) ( 2 x 1 ) p | 1 x | p , if x 1 2 , sgn ( x ) sgn ( 1 x ) | 1 x | p | x | p sgn ( x ) ( 1 2 x ) p | x | p , if x < 1 2 .
τ f 1 , g 1 ( x ) = x 2 + ( 1 x ) 2 e ( 1 x ) x e x ( 1 x ) .
τ f 1 , g 2 ( x ) = x 2 + ( 1 x ) 2 ( 1 x ) 2 + 4 + ( 1 x ) 2 x x 2 + 4 + x 2 ( 1 x ) .
τ f 1 , g 3 ( x ) = x 2 + ( 1 x ) 2 4 e ( 1 x ) 1 + 2 e ( 1 x ) x 4 e x 1 + 2 e x ( 1 x ) .
τ f 2 , g 1 ( x ) = | x | 5 + | 1 x | 5 5 e ( 1 x ) x e x ( 1 x ) .
τ f 2 , g 2 ( x ) = | x | 5 + | 1 x | 5 5 ( 1 x ) 2 + 4 + ( 1 x ) 2 x x 2 + 4 + x 2 ( 1 x ) .
τ f 2 , g 3 ( x ) = | x | 5 + | 1 x | 5 5 4 e ( 1 x ) 1 + 2 e ( 1 x ) x 4 e x 1 + 2 e x ( 1 x ) .
τ f 3 , g 1 ( x ) = ln e | x | + e | 1 x | 1 e ( 1 x ) x e x ( 1 x ) .
τ f 3 , g 2 ( x ) = ln e | x | + e | 1 x | 1 ( 1 x ) 2 + 4 + ( 1 x ) 2 x x 2 + 4 + x 2 ( 1 x ) .
τ f 3 , g 3 ( x ) = ln ( e | x | + e | 1 x | 1 ) 4 e ( 1 x ) 1 + 2 e ( 1 x ) x 4 e x 1 + 2 e x ( 1 x ) .
Proposition 2.
Let τ FB p , σ FB p and τ D FB p be defined as (11), (12) and (13) respectively. Then, the following hold.
(a)
For p > 1 , the function τ FB p ( · ) is differentiable on R .
(b)
For p > 1 , the function σ FB p ( · ) is differentiable on R .
(c)
For all odd integers, the function τ D FB p ( · ) is differentiable on R .
Proof. 
The results follow immediately from Lemma 1. □
Proposition 3.
Let τ NR p ( x ) , τ S NR p and σ S NR p be defined as in (14), (15) and (16), respectively. Then, for p > 1 and p is an odd integer, the following hold.
(a)
The function τ NR p ( · ) is differentiable on R ;
(b)
The function τ S NR p ( · ) is not differentiable at x = 1 2 ;
(c)
The function σ S NR p ( · ) is differentiable on R .
Proof. 
The results are immediate consequences of Lemma 2. □
Proposition 4.
Let τ ˜ NR p , τ ˜ S NR p , and σ ˜ S NR p be defined as in (17), (18) and (19), respectively. Then, for p > 1 , the following hold.
(a)
The function τ ˜ NR p ( · ) is differentiable on R .
(b)
The function τ ˜ S NR p ( · ) is not differentiable at x = 1 2 .
(c)
The function σ ˜ S NR p ( · ) is differentiable on R .
Proof. 
The results follow from Lemma 3 directly. □
Proposition 5.
Let τ f i , g j be defined as in (20)–(28) where i = 1 , 2 , 3 and j = 1 , 2 , 3 . Then, the following hold.
(a)
For i = 1 , 2 and j = 1 , 2 , 3 , the function τ f i , g j ( · ) is differentiable on R .
(b)
For j = 1 , 2 , 3 , The function τ f 3 , g j ( · ) is not differentiable at x = 0 or x = 1 .
Proof. 
(a) Based on Proposition 2(a), the function τ FB p ( x ) is differentiable on R . In addition, we know that the exponential function and ( 1 x ) 2 + 4 are differentiable on R . Therefore, τ f i , g j ( x ) is differentiable on R .
(b) Let h ( x ) = ln ( e | x | + e | 1 x | 1 ) , which says h ( x ) = x | x | e | x | ( 1 x ) | 1 x | e | 1 x | e | x | + e | 1 x | 1 . For x > 0 , the right derivative at x = 0 is h ( 0 + ) = 1 e e . For x < 0 , the left derivative at x = 0 is h ( 0 ) = 1 e e . Then, it is clear that h ( 0 + ) h ( 0 ) , hence h ( · ) is not differentiable at x = 0 . Similarly, it is easy to check the non-differentiability at x = 1 . To summarize, the function τ f 3 , g j ( x ) is not differentiable at x = 0 or x = 1 . □

4. The Convexity of the Curves

In Section 2, we discussed the convexity of NCP functions. It naturally leads to the convexity of the curves. Although we cannot find the inflection points one by one, we focus on estimating the interval where the curves are convex. In addition, with different p, the geometric structure of the curves will be changed. The following lemma will be employed to check the convexity.
Lemma 4.
(a) If g ( x ) and h ( x ) are convex on an interval, then g ( x ) + h ( x ) is also convex on the interval.
(b)
Let g ( x ) : R n ( , ) be a convex function and let h ( x ) : g ( R n ) R be a nondecreasing convex function. Then f ( x ) = h ( g ( x ) ) is convex on R n .
Proof. 
These are very basic materials which are also well known, see [16]. □
Proposition 6.
Let τ FB p and τ D FB p be defined as in (11) and (13), respectively. Then, the following hold. See Figure 1.
(a)
For p > 1 , the function τ FB p ( · ) is convex on R .
(b)
When p is an odd integer, the function τ D FB p ( · ) is convex on R .
Proof. 
(a) First, as indicated in (11), τ FB p ( x ) = | x | p + | 1 x | p p 1 . Since the curve τ FB p ( x ) is the section of a plane with the surface of the function ϕ FB p ( a , b ) , which is convex on R 2 according to Lemma 1(a). τ FB p ( x ) is convex on R .
(b) As shown in (13), τ D FB p ( x ) = x 2 + ( 1 x ) 2 p 1 , where p is an odd integer. Let g ( x ) : = x 2 + ( 1 x ) 2 and h ( x ) : = x p 1 . It is clear that h ( x ) is nondecreasing and convex; moreover, g ( x ) is positive and convex. Then, according to Lemma 4(b), τ D FB p ( · ) is convex on R . □
Proposition 7.
Let σ FB p be defined as in (12). Then, for any p > 1 , the function σ FB p ( · ) is convex on ( , 0 ) and 1 , . See Figure 2.
Proof. 
As given in (12), σ FB p ( x ) = 1 2 τ F B p ( x ) 2 . Let g ( x ) : = τ FB p ( x ) and h ( x ) : = 1 2 x 2 . It is clear that h ( x ) is nondecreasing and convex on ( 0 , ) . Furthermore, g ( x ) is convex and positive on ( 1 , ) . Hence, according to Lemma 4(b), σ FB p ( x ) is convex on 1 , . In addition, due to symmetry, σ FB p ( x ) is also convex on , 0 . □
Remark 1.
(i) Set p = 2 . The second derivative of σ FB 2 ( x ) = 1 2 | τ FB 2 ( x ) | 2 gives
σ FB 2 ( x ) = 2 1 ( 2 x 2 2 x + 1 ) 3 2 .
From this, we know that a ± = 1 2 1 ± 2 1 3 1 are two inflection points of the function σ FB p ( x ) . Hence, the function σ FB p ( x ) is convex on the intervals ( , a ) and ( a + , ) . For a general p > 1 , we have difficulty in determining their infection points. However, let us study their behavior when p goes to ∞ on the interval ( 0 , 1 ) . When 1 / 2 < x < 1 , we have | x | > | 1 x | . Hence, the function σ FB p ( x ) approaches 1 2 ( x 1 ) 2 as p goes to ∞. Similarly, provided 0 < x < 1 / 2 , the function σ FB p ( x ) approaches 1 2 x 2 as p goes to ∞. Note also that σ FB p ( 1 2 ) approaches 1 8 as p goes to ∞.
(ii)
We also examine the behavior of the second derivative of the function σ FB p ( x ) at the point 0.55 which is near 1 2 . We present the numerical results in Figure 3. Observe that their inflection points a ± p approaches 1 / 2 , and also that ( σ FB p ) ( 0.55 ) approaches 1 as p goes to ∞.
According to Remark 1 and Figure 3, we make a conjecture here.
Conjecture 1.
Let σ FB p be defined as in (12). Then, for any p > 1 , the function σ FB p ( · ) has two inflection points 0 < a p < 1 2 < a + p < 1 , and both approach 1 2 as p goes to ∞.
Proposition 8.
Let τ NR p and τ S N R p be defined as in (14) and (15), respectively. Then, when p is an odd integer, the following hold. See Figure 4.
(a)
The function τ NR p ( · ) is convex on ( 0 , 4 7 ) .
(b)
The function τ S NR p ( · ) is convex on ( 3 7 , 4 7 ) .
Proof. 
(a) As given in (14), τ NR p ( x ) = x p ( 2 x 1 ) + p , which says
τ NR p ( x ) = p x ( p 1 ) ( 2 x 1 ) + | 2 x 1 | 2 ( p 1 ) 1 + sgn ( 2 x 1 ) , τ NR p ( x ) = p ( p 1 ) x ( p 2 ) ( 2 x 1 ) + | 2 x 1 | 2 ( p 2 ) 1 + sgn ( 2 x 1 ) 2 .
To proceed, we discuss three subcases:
Case (i): On the interval ( 0 , 1 2 ) , we have 1 + sgn ( 2 x 1 ) 2 = 0 , which says τ NR p ( x ) = p ( p 1 ) x ( p 2 ) > 0 .
Case (ii): At the points a = 1 2 , we have τ NR p ( 1 2 ) = p ( p 1 ) ( 1 2 ) ( p 2 ) > 0 as well.
Case (iii): On the interval ( 1 2 , 4 7 ) , we need to show that τ NR p ( x ) > 0 over ( 1 2 , 4 7 ) for all p 3 . Indeed, on the interval ( 1 2 , 4 7 ) , we have ( 2 x 1 ) + | 2 x 1 | 2 = 2 x 1 and 1 + sgn ( 2 x 1 ) 2 = 4 . Define g x ( p ) : = x ( p 2 ) 4 ( 2 x 1 ) p 2 . Then, our goal is to show g x ( p ) > 0 for all p 3 on the interval ( 1 2 , 4 7 ) . When p = 3 , we have g x ( 3 ) = x 4 ( 2 x 1 ) = 7 x + 4 > 0 on ( 1 2 , 4 7 ) . In addition, note that x > 4 ( 2 x 1 ) on the same interval. For other p = 3 + k with k > 0 , we have
g x ( 3 + k ) = x 1 + k 4 ( 2 x 1 ) 1 + k = x x k 4 ( 2 x 1 ) 1 + k > 4 ( 2 x 1 ) x k 4 ( 2 x 1 ) 1 + k = 4 ( 2 x 1 ) x k ( 2 x 1 ) k .
Let a = 1 x , b = 2 x 1 . Then, the term x k ( 2 x 1 ) k in g x ( 3 + k ) is expressed as
x k ( 2 x 1 ) k = ( 1 x + 2 x 1 ) k ( 2 x 1 ) k = ( a + b ) k b k .
Since, on the interval ( 1 2 , 4 7 ) a and b are positive, we conclude that g x ( 3 + k ) > 0 .
To summarize, on the interval ( 1 2 , 4 7 ) , the second derivative τ NR p ( x ) > 0 , which means that τ NR p ( x ) is convex on this interval.
(b) As stated in (15), τ S NR p ( x ) = x p ( 2 x 1 ) p if x > 1 2 , ( 1 2 ) p if x = 1 2 , ( 1 x ) p ( 1 2 x ) p if x < 1 2 . For x > 1 2 , similar to part (a), it can be verified that τ NR p ( x ) is convex. Therefore, τ S NR p ( x ) is convex on ( 1 2 , 4 7 ) . For x < 1 2 , due to symmetry, τ S NR p ( x ) is convex on ( 3 7 , 1 2 ) .
Additionally, note that τ S NR p ( x ) is continuous on ( 3 7 , 4 7 ) , and increasing (decreasing) on the right (left) hand side of the point a = 1 2 , since τ S NR p ( 1 / 2 + ) = p ( 1 / 2 ) p 1 > 0 , τ S NR p ( x ) > 0 on the interval ( 1 2 , 4 7 ) as well as τ S NR p ( 1 / 2 ) = p ( 1 / 2 ) p 1 < 0 , τ S NR p ( x ) > 0 on the interval ( 3 7 , 1 2 ) . Hence, the point a = 1 2 is the only minimizer on the interval ( 3 7 , 4 7 ) . In summary, we can conclude that τ S NR p ( x ) is convex on the interval ( 3 7 , 4 7 ) . □
Proposition 9.
Let σ S NR p be defined as in (16). Then, when p 3 and p is an odd integer, the function σ S NR p ( x ) is convex on ( , 0 ) and ( 1 , ) . See Figure 5.
Proof. 
As indicated in (16), σ S NR p ( x ) = x p ( 1 x ) p ( 2 x 1 ) p ( 1 x ) p if x > 1 2 , ( 1 2 ) 2 p if x = 1 2 , x p ( 1 x ) p x p ( 1 2 x ) p if x < 1 2 , where p is an odd integer and p > 1 . Since σ S NR p ( x ) is symmetric about x = 1 2 , we divide it into two cases:
Cases (i): Suppose x > 1 , the first and second derivative of this function are
σ S N R p ( x ) = p ( 1 x ) p 1 [ x p ( 2 x 1 ) p ] + ( 1 x ) p [ p ( x p 1 2 ( 2 x 1 ) p 1 ) ] σ S N R p ( x ) = f 1 ( x ) + f 2 ( x ) + f 3 ( x )
where
f 1 ( x ) = ( 2 p ) p [ x p 1 2 ( 2 x 1 ) p 1 ] ( 1 x ) p 1 = x p 1 [ 1 2 ( 2 1 x ) p 1 ] ( 1 x ) p 1 ( 2 p ) p , f 2 ( x ) = p ( p 1 ) [ x p 2 4 ( 2 x 1 ) p 2 ] ( 1 x ) p = x p 2 [ 1 4 ( 2 1 x ) p 1 ] ( 1 x ) p ( p 1 ) p , f 3 ( x ) = p ( p 1 ) [ x p ( 2 x 1 ) p ] ( 1 x ) p 2 = x p [ 1 ( 2 1 x ) p 2 ] ( 1 x ) p 2 ( p 1 ) p .
Note that σ S NR p ( 1 ) = 0 , we want to show that σ S NR p ( x ) is positive for p > 1 .
Because x > 1 , we have 1 < 2 1 x , which implies 1 2 ( 2 1 x ) p 1 < 1 . Moreover, as we have ( 2 p ) p x p 1 < 0 and ( 1 x ) p 1 > 0 , then f 1 ( x ) > 0 . Similarly, because x > 1 , we have 1 < 2 1 x . Hence, 1 4 ( 2 1 x ) p 1 < 3 . Moreover, as we have ( p 1 ) p x p 2 > 0 and ( 1 x ) p < 0 , then f 2 ( x ) > 0 . Finally, because x > 1 we have 1 < 2 1 x , which gives 1 ( 2 1 x ) p 2 < 0 . Moreover, we have ( p 1 ) p x p > 0 and ( 1 x ) p 2 < 0 . Then, it says f 3 ( x ) > 0 .
To summarize, we have shown f 1 ( x ) + f 1 ( x ) + f 1 ( x ) > 0 for x > 1 , which says σ S NR p ( x ) > 0 for x > 1 . In other words, σ S NR p ( · ) is convex on ( 1 , ) .
Cases (ii): Suppose x < 0 , since σ S NR p ( x ) is symmetric about x = 1 2 . In this case, it is clear that σ S NR p ( x ) is convex on ( , 0 ) .
By cases (i) and (ii), we prove that σ S NR p ( x ) is convex on ( , 0 ) and ( 1 , ) . □
Because τ ˜ NR p , τ ˜ S NR p and σ ˜ S NR p are the continuous types of τ NR p , τ S NR p and σ S NR p , similar to Propositions 8 and 9, we establish the next proposition.
Proposition 10.
Let τ ˜ NR p , τ ˜ S NR p and σ ˜ S NR p be defined as in (17), (18), and (19), respectively. Then, the following hold. See Figure 6.
(a)
If p 3 , then the function τ ˜ NR p ( x ) is convex on ( 0 , 4 7 ) .
(b)
If p 3 , then the function τ ˜ S NR p ( x ) is convex on ( 3 7 , 4 7 ) .
(c)
If p 3 , then the function σ ˜ S NR p ( x ) is convex on ( , 0 ) and ( 1 , ) .
The following proposition is simple but tedious. We list it here for the readers’ convenience.
Proposition 11.
Let τ f i , g j where i = 1 , 2 and j = 1 , 2 , 3 be defined from (20)–(28). Then, the following hold.
(a)
The function τ f i , g j ( · ) for i = 1 , 2 and j = 1 , 2 is convex on R .
(b)
The function τ f 3 , g j ( · ) for j = 1 , 2 is convex on intervals ( , 0 ) , ( 0 , 1 ) and ( 1 , ) .
(c)
The function τ f i , g 3 ( · ) for i = 1 , 2 , 3 has inflection points, and thus is neither convex nor concave on entire R .
Proof. 
(a) As stated in (20), τ f 1 , g 1 ( x ) = x 2 + ( 1 x ) 2 e ( 1 x ) x e x ( 1 x ) . Let g ( x ) : = x 2 + ( 1 x ) 2 and h ( x ) : = e ( 1 x ) x e x ( 1 x ) . Because g ( x ) is convex on R according to Proposition 6(b), it suffices to show that h ( x ) is convex. Taking the first and second derivatives of this function give
h ( x ) = e ( 1 x ) ( x 1 ) + e x x , and h ( x ) = x e x + e x e 1 x x + 2 e 1 x .
In order to verify that h ( x ) > 0 , we divide it into three cases:
Cases (i): Suppose x 1 / 2 . We have x 1 x , hence e x e 1 x . Then, we obtain h ( x ) = x ( e x e 1 x ) + e x + 2 e 1 x > 0 .
Cases (ii): Suppose 0 x 1 / 2 . We have 2 > x , hence 2 e 1 x > x e 1 x . Then, we obtain h ( x ) = ( 2 e 1 x x e 1 x ) + e x + x e x > 0 .
Cases (iii): Suppose x 0 . We have x 1 x , hence e x e 1 x . Then, we obtain h ( x ) = x ( e x e 1 x ) + e x + 2 e 1 x > 0 .
This shows that h ( x ) is always positive, which indicates that h ( x ) is convex on R . Because g ( x ) and h ( x ) are convex on R , according to Lemma 4(a), the function τ f 1 , g 1 ( · ) is convex on R .
As indicated in(21), τ f 1 , g 2 ( x ) = x 2 + ( 1 x ) 2 ( 1 x ) 2 + 4 + ( 1 x ) 2 x x 2 + 4 + x 2 ( 1 x ) . Let h ( x ) : = x 2 + ( 1 x ) 2 and g ( x ) : = ( ( 1 x ) 2 + 4 + ( 1 x ) 2 ) x ( x 2 + 4 + x 2 ) ( 1 x ) . We need to verify that g ( x ) is convex. Taking the second derivative of g ( x ) gives
g ( x ) = x 3 + 3 x 2 9 x + 5 ( x 2 2 x + 5 ) 3 2 + x 3 + 6 x 2 ( x 2 + 4 ) 3 2 + 2 .
We want to show that that g ( x ) > 0 . The main principle of this is to check whether the minimum of the second derivative is positive. Taking the third derivative gives
g ( x ) = 6 ( x + 4 ) ( x 2 + 4 ) 5 2 + 6 ( x 5 ) ( x 2 2 x + 5 ) 5 2
The critical numbers of g ( x ) are x 1 2 , 1.946503 , and 2.946503 . Moreover, g ( 1 2 ) 2.2568 , and g ( 1.946503 ) = g ( 2.946503 ) 1.945045 . The intervals where it is increasing are ( 1.946503 , 1 2 ) and ( 2.946503 , ) , and the intervals where it is decreasing are ( , 1.946503 ) and ( 1 2 , 2.946503 ) . Therefore, the local minimum is 1.945045 , and the local maximum is 2.2568 . Furthermore, we also find lim x ± g ( x ) = 2 . This shows that the global minimum of g ( x ) is positive, hence g ( x ) > 0 on the entire R . This implies that g ( x ) is convex on R . As h ( x ) and g ( x ) are convex on R according to Lemma 4(a), τ f 1 , g 2 ( · ) is convex on R .
As shown in (23), τ f 2 , g 1 ( x ) = | x | 5 + | 1 x | 5 5 e ( 1 x ) x e x ( 1 x ) . As
| x | 5 + | 1 x | 5 5 and e ( 1 x ) x e x ( 1 x ) are convex on R from previous discussions according to Lemma 4(a), τ f 2 , g 1 ( x ) is convex on R .
As given in (24), τ f 2 , g 2 ( x ) = | x | 5 + | 1 x | 5 5 ( ( 1 x ) 2 + 4 + ( 1 x ) 2 ) x ( x 2 + 4 + x 2 ) ( 1 x ) . As | x | 5 + | 1 x | 5 5 and ( ( 1 x ) 2 + 4 + ( 1 x ) 2 ) x ( x 2 + 4 + x 2 ) ( 1 x ) are convex on R from previous work according to Lemma 4(a), τ f 2 , g 2 ( x ) is convex on R .
(b) As shown in (26), τ f 3 , g 1 ( x ) = ln ( e | x | + e | 1 x | 1 ) e ( 1 x ) x e x ( 1 x ) . Let h ( x ) : = ln ( e | x | + e | 1 x | 1 ) and g ( x ) : = e ( 1 x ) x e x ( 1 x ) . As g ( x ) is convex on R based on the proof of the case for τ f 1 , g 1 , the convexity of h ( x ) is all that remains to determined. Note that h ( x ) is not differentiable at x = 0 and x = 1 , and we need to discuss three cases:
Cases (i): Suppose 0 < x < 1 . Taking the first derivative and second derivative of h ( x ) give
h ( x ) = x e | x | | x | ( 1 x ) e | 1 x | | 1 x | e | x | + e | 1 x | 1 ,
h ( x ) = ( e | x | + e | 1 x | ) ( e | x | + e | 1 x | 1 ) ( x | x | e | x | ( 1 x ) | 1 x | e | 1 x | ) 2 ( e | x | + e | 1 x | 1 ) 2 .
Since the denominator of h ( x ) is positive, we need to check whether the numerator is positive. The numerator is ( e x + e 1 x ) 2 ( e x + e 1 x ) ( e x e 1 x ) 2 = 4 e ( e x + e 1 x ) . For 0 < x < 1 , we have 1 < e x < e and 1 < e ( 1 x ) < e , which indicates that the numerator is positive. Therefore, we conclude h ( x ) > 0 , and hence τ f 3 , g 1 ( · ) is convex on the interval ( 0 , 1 ) .
Cases (ii): Suppose x > 1 , taking the second derivative of h ( x ) gives
h ( x ) = e x + e x 1 e x + e x 1 1 2 + e x ( x + 1 ) e 1 x ( x 2 ) .
We want to show that h ( x ) > 0 for x > 1 . Taking the third derivative of h ( x ) yields
h ( x ) = ( ( e x + e x 1 + 1 ) ( e x + e x 1 ) ( e x + e x 1 1 ) 3 ) + ( e 1 x ( x 3 ) + e x ( x + 2 ) ) .
For the first term of h ( x ) , since e x + e x 1 > e + 1 , the denominator is positive, and hence the first term is positive. For the second term of h ( x ) , we have
e 1 x ( x 3 ) + e x ( x + 2 ) = e 1 x x + e x x + 2 e x 3 e ( 1 x ) = e 1 x x + e x x + 2 e e x 1 3 e ( 1 x ) .
As 2 e > 3 and e x 1 > e 1 x when x > 1 , it is also positive. Therefore, we obtain h ( x ) > 0 . This shows that h ( x ) is increasing. Note also that h ( 1 ) = 1 + 2 e 1 + e e 2 > 0 . Then, it follows that h ( x ) > 0 . τ f 3 , g 1 ( x ) is convex on the interval ( 1 , ) .
Cases (iii): Suppose x < 0 . As τ f 3 , g 1 ( x ) is symmetric about the point x = 1 2 according to case (ii), the function τ f 3 , g 1 ( · ) is convex on interval ( , 0 ) .
As indicated in (27),
τ f 3 , g 2 ( x ) = ln ( e | x | + e | 1 x | 1 ) ( 1 x ) 2 + 4 + ( 1 x ) 2 x x 2 + 4 + x 2 ( 1 x ) .
Let h ( x ) : = ln ( e | x | + e | 1 x | 1 ) and g ( x ) : = ( ( 1 x ) 2 + 4 + ( 1 x ) 2 ) x ( x 2 + 4 + x 2 ) ( 1 x ) . g ( x ) is convex on R according to the proof of the case for τ f 1 , g 2 and h ( x ) is convex on the intervals ( , 0 ) , ( 0 , 1 ) and ( 1 , ) according to previous arguments. Therefore, τ f 3 , g 2 is convex on the intervals ( , 0 ) , ( 0 , 1 ) , and ( 1 , ) .
(c) As given in (22), τ f 1 , g 3 ( x ) = x 2 + ( 1 x ) 2 ( 4 e ( 1 x ) 1 + 2 e ( 1 x ) ) x ( 4 e x 1 + 2 e x ) ( 1 x ) . Taking the second derivative of τ f 1 , g 3 ( x ) gives
τ f 1 , g 3 ( x ) = 1 ( 2 x 2 2 x + 1 ) 3 2 + 9 2 ( e ( x 2 ) 2 e x + e 2 e 3 x ( 2 e x + e ) 3 + e 2 ( 3 x 2 ) ( 2 e x + e ) 2 + 4 e x ( x + 1 ) 2 e 2 x ( x 3 ) ( e x + 2 ) 3 ) .
The inflection points are x 1.986749 , 2.986749 , 12.999449 , and 13.99944 . Then, the intervals where the curve is convex are ( 1.986749 , 2.986749 ) , ( , 12.999449 ) and ( 13.999449 , ) .
As indicated in (25), we know
τ f 2 , g 3 ( x ) = | x | 5 + | 1 x | 5 5 4 e ( 1 x ) 1 + 2 e ( 1 x ) x 4 e x 1 + 2 e x ( 1 x ) .
Similarly, we use the second derivative to find the inflection points. The inflection points are x 3.005175 , 2.005175 , 11.286820 , and 12.286820 . Therefore, the intervals where the curve is convex are ( 2.005175 , 3.005175 ) , ( 12.286820 , ) , and ( , 11.286820 ) .
As shown in (28), we know
τ f 3 , g 3 ( x ) = ln ( e | x | + e | 1 x | 1 ) 4 e ( 1 x ) 1 + 2 e ( 1 x ) x 4 e x 1 + 2 e x ( 1 x ) .
Similarly, we use the second derivative to find the inflection points. The inflection points are x 1.904132 and 2.904132 . Because ln ( e | x | + e | 1 x | 1 ) is not differentiable at the points 0 and 1, we can only assure that the interval where the curve is convex is ( 0 , 1 ) . □
Recall that a function is called subdifferentiable at x if there exists at least one subgradient at x. Although τ f 3 , g 1 ( x ) is not differentiable at the points 0 and 1, with the help of Proposition 11(b), we can still show that it is subdifferentiable thereat.
Proposition 12.
(a) The function τ f 3 , g 1 ( · ) is subdifferentiable at the points 0 and 1 and the subdifferential is described by
τ f 3 , g 1 ( 0 ) = ( 1 e ) e e , ( 1 e ) e e , τ f 3 , g 1 ( 1 ) = ( e 1 ) e + e , ( e + 1 ) e + e .
Moreover, τ f 3 , g 1 ( · ) is convex on R .
(b)
The function τ f 3 , g 2 ( · ) is subdifferentiable at the points 0 and 1 and the subdifferential is described by
τ f 3 , g 2 ( 0 ) = ( 1 e ) e 5 2 , ( 1 e ) e 5 2 , τ f 3 , g 2 ( 1 ) = ( e 1 ) e + 5 2 , ( e + 1 ) e + 5 2 .
Moreover, τ f 3 , g 2 ( · ) is convex on R .
Proof. 
(a) Taking the first derivative of τ f 3 , g 1 ( x ) gives
τ f 3 , g 1 ( x ) = x e | x | | x | ( 1 x ) e | 1 x | | 1 x | e | x | + e | 1 x | 1 + ( e ( 1 x ) ( x 1 ) + e x x ) .
The right and left derivatives at the point 0 are τ f 3 , g 1 ( 0 + ) = 1 e e e and τ f 3 , g 1 ( 0 ) = 1 e e e , respectively. Moreover, we have τ f 3 , g 1 ( 0 + ) > τ f 3 , g 1 ( 0 ) . Based on the convexity of τ f 3 , g 1 ( x ) on ( , 0 ) from Proposition 11(b), we have
τ f 3 , g 1 ( ϵ + h ) τ f 3 , g 1 ( ϵ ) τ f 3 , g 1 ( ϵ ) h
with small ϵ < 0 and h < 0 . Note here the τ f 3 , g 1 ( x ) is a continuous function. Let ϵ 0 . Thus, we have τ f 3 , g 1 ( h ) τ f 3 , g 1 ( 0 ) τ f 3 , g 1 ( 0 ) h for h < 0 . Similarly, according to the convexity of τ f 3 , g 1 ( x ) on ( 0 , 1 ) from Proposition 11(b), we can obtain that τ f 3 , g 1 ( h ) τ f 3 , g 1 ( 0 ) τ f 3 , g 1 ( 0 + ) h where 0 < h < 1 . Therefore, we show that τ f 3 , g 1 ( x ) is subdifferentiable at 0, and τ f 3 , g 1 ( 0 ) = ( 1 e ) e e , ( 1 e ) e e . Moreover based on Lemma 2.13 in [17], τ f 3 , g 1 ( x ) is convex on the interval ( , 1 ) , especially at the point 0. Likewise, τ f 3 , g 1 ( 1 ) = e 1 e + e , e + 1 e + e and it is convex at the point 1. Hence, τ f 3 , g 1 ( x ) is convex on entire R .
(b) Taking the first derivative of τ f 3 , g 2 ( x ) yields
τ f 3 , g 2 ( x ) = x e | x | | x | ( 1 x ) e | 1 x | | 1 x | e | x | + e | 1 x | 1 + 1 2 ( 1 x ) x x 2 + 4 1 + x 2 + 4 ( x 1 ) x x ( x 2 ) + 5 + 3 x x ( x 2 ) + 5 1 .
The right derivative at the point 0 is τ f 3 , g 2 ( 0 + ) = ( 1 e e ) 5 2 and the left derivative at the point 0 is τ f 3 , g 2 ( 0 ) = 1 e e 5 2 . Therefore, we obtain
τ f 3 , g 2 ( 0 ) = 1 e e 5 2 , 1 e e 5 2 .
Similarly, τ f 3 , g 2 ( 1 ) = e 1 e + 5 2 , e + 1 e + 5 2 .

5. The Local Minimum and Maximum of the Curves

After discussing the convexity and differentiability, we now work on finding the local minimum or maximum value of the curves. In addition, we shall investigate the convergent behavior of local minimum or maximum values when p becomes very large.
Proposition 13.
Let τ FB p , τ D FB p and σ FB p be defined as in (11), (13), and (12) respectively. Then, the following hold. See Figure 7.
(a)
The function τ FB p ( x ) has a local minimum at x = 1 2 and its local minimum value converges to 1 2 .
(b)
When p is an odd integer, the function τ D FB p ( x ) has a local minimum at x = 1 2 and its local minimum value converges to 1 .
(c)
The function σ FB p ( x ) has local minima at x = 0 and 1. Furthermore, it has a local maximum value at x = 1 2 and its local maximum value converges to 1 8 .
Proof. 
(a) From (11), we know that
τ FB p ( x ) = | x | p + | 1 x | p p 1
where p > 1 . The first derivative of this function is
τ FB p ( x ) = ( | x | p + | 1 x | p ) 1 p 1 [ sgn ( x ) | x | p 1 | 1 x | p 1 sgn ( 1 x ) ] .
Note that the first term is positive. We then investigate the second term:
sgn ( x ) | x | p 1 | 1 x | p 1 sgn ( 1 x ) .
Case (i): If x > 1 / 2 , then sgn ( x ) | x | p 1 | 1 x | p 1 sgn ( 1 x ) > 0 .
Case (ii): If x < 1 / 2 , then sgn ( x ) | x | p 1 | 1 x | p 1 sgn ( 1 x ) < 0 .
Case (iii): When x = 1 2 , we see that a = 1 2 is the only root of τ FB p ( x ) = 0 . Moreover, τ FB p ( x ) is convex on R , which indicates a = 1 2 is the only local minimizer and the value is ( 1 2 ) ( 2 1 p ) 1 . Furthermore, we observe that the local minimum value converges to 1 2 as p .
(b) From (13), we know that
τ D FB p ( x ) = ( x 2 + ( 1 x ) 2 ) p 1
where p > 1 and p is an odd integer. Taking the first derivative of this function yields
τ D FB p ( x ) = p ( x 2 + ( 1 x ) 2 ) p 2 1 ( 2 x 1 ) .
It can be verified that a = 1 2 is the singular critical point. Note that τ D FB p ( x ) is convex on R , hence a = 1 2 is a local minimizer and the value is 2 ( 1 2 ) 2 p 1 . In addition, the local minimum value converges to 1 when p .
(c) From (12), we know that
σ FB p ( x ) = 1 2 | τ FB p ( x ) | 2
where p > 1 . Taking the first derivative of this function gives
σ FB p ( x ) = τ FB p ( x ) τ FB p ( x ) .
We want to solve σ FB p ( x ) = 0 , which implies τ FB p ( x ) = 0 or τ FB p ( x ) = 0 . If τ FB p ( x ) = 0 , we have x = 0 and x = 1 . If τ FB p ( x ) = 0 , we have x = 1 2 . Thus, the critical numbers are x = 0 , 1 2 , 1 . Note that 0 and 1 are the only two roots of τ FB p ( x ) = 0 and τ FB p ( x ) is non-negative. Therefore, we see that x = 0 and x = 1 are local minimizers, and the values are both 0.
On the other hand, we know that τ FB p ( x ) is decreasing (increasing) on the right (left) hand side of the point a = 1 2 . Hence, the point a = 1 2 is a local maximizer, and the value is 1 2 ( 2 ( 1 2 ) p ) 1 p 1 2 . This further implies that when p , the local maximum converges to 1 8 . □
Proposition 14.
Let τ NR p be defined as in (14) with odd integer p. Then, the function τ NR p ( · ) has a local maximum at x = 1 2 2 1 p 1 . Furthermore, its minimum value converges to 1 4 . See Figure 8.
Proof. 
From (14), we know that τ NR p ( x ) = x p ( 2 x 1 ) + p where p > 1 and p is an odd integer. Computing the first derivative of this function gives
τ NR p ( x ) = p x ( p 1 ) ( 2 x 1 ) + | 2 x 1 | 2 ( p 1 ) 1 + 2 x 1 | 2 x 1 | .
To proceed, we discuss two cases:
Cases (i): If x < 1 2 , then τ NR p ( x ) = p x p 1 0 . Hence, τ NR p ( x ) is increasing on ( , 1 2 ) , which indicates that it does not have local minimum or maximum value.
Cases (ii): If x > 1 2 , then τ NR p ( x ) = p [ x p 1 2 ( 2 x 1 ) p 1 ] . It is verified that a = 1 2 2 1 p 1 is the only root of p [ x p 1 2 ( 2 x 1 ) p 1 ] = 0 for p > 1 . Moreover, we have that τ NR p ( x ) is decreasing (increasing) on the right (left) hand side of the point a. Hence, a is a local maximizer and the local maximum value is 1 2 2 1 p 1 p 2 ( 1 2 2 1 p 1 ) 1 p . Furthermore, the local maximum value 1 2 2 1 p 1 p 2 ( 1 2 2 1 p 1 ) 1 p converges to 1 4 as p . □
Proposition 15.
Let τ S NR p and σ S NR p be defined as in (15) and (16), respectively. Then, for the odd integer p, the following hold. See Figure 9.
(a)
The function τ S NR p ( · ) has a local maximum at x = 1 1 2 2 1 p 1 and 1 2 2 1 p 1 . Its local maximum value converges to 1 4 . Furthermore, it has a local minimum at x = 1 2 , which converges to 0.
(b)
The function σ S NR p ( · ) has a local maximum at x = 1 2 and its maximum value converges to 0. In addition, it has a local minimum at x = 0 and x = 1 .
Proof. 
(a) From (15), we know that
τ S NR p ( x ) = x p ( 2 x 1 ) p , if x > 1 2 , ( 1 2 ) p , if x = 1 2 , ( 1 x ) p ( 1 2 x ) p , if x < 1 2 ,
where p is an odd integer. As τ S NR p ( x ) is symmetric at the point x = 1 2 , we consider the below two cases:
Cases (i): If x > 1 2 , according to Proposition 14, the local maximum point is a = 1 2 2 1 p 1 and the maximum value is 1 2 2 1 p 1 p [ 2 ( 1 2 2 1 p 1 ) 1 ] p , which converges to 1 4 as p .
Cases (ii): If x < 1 2 , similar to Case (i), we obtain that a = 1 1 2 2 1 p 1 is a local maximum point and the maximum value is 1 2 2 1 p 1 p 1 + 2 2 2 1 p 1 p , which converges to 1 4 as p .
Furthermore, because the function is increasing (decreasing) on the right (left) hand side of the point a = 1 2 , we can conclude a = 1 2 is a local minimizer. Its the minimum value is ( 1 2 ) p , which converges to 0 when p .
(b) From (16), we know that
σ S NR p ( x ) = x p ( 1 x ) p ( 2 x 1 ) p ( 1 x ) p , if x > 1 2 , ( 1 2 ) 2 p , if x = 1 2 , x p ( 1 x ) p x p ( 1 2 x ) p , if x < 1 2 ,
where p is an odd integer. Since σ S NR p ( x ) is symmetric at the point x = 1 2 , we divide it into two cases:
Case (i): Suppose x 2 3 , the first derivative is
σ S NR p ( x ) = p ( 1 x ) p 1 x p ( 2 x 1 ) p + ( 1 x ) p p ( x p 1 2 ( 2 x 1 ) p 1 ) .
Based on this, it is verified that a = 1 is a critical point. Because σ S NR p ( x ) is non-negative and σ S NR p ( 1 ) = 0 , we can conclude that 1 is a local minimum point and the value is 0.
Case (ii): Suppose x 1 3 . Based on symmetry, the local minimum point is a = 0 and the value is 0.
Case (iii): Suppose 1 3 < x < 2 3 , we know that σ S NR p ( 1 2 ) = 0 and σ S NR p ( x ) is decreasing (increasing) on the right (left) side of the point a = 1 2 . Hence, we obtain that a = 1 2 is a local maximizer and the maximum value is ( 1 2 ) 2 p for p 3 . It clearly converges to 0 when p . □
Due to the fact that τ ˜ NR p , τ ˜ S NR p , and σ ˜ S NR p are continuous counterparts of τ NR p , τ S NR p and σ S NR p , analogous to Propositions 14 and 15, their local maximums and minimums can be obtained. We omit the proof here.
Proposition 16.
Let τ ˜ NR p ( x ) , τ ˜ S NR p and σ ˜ S NR p be defined as in (17), (18), and (19), respectively. Then, for p > 1 , the following hold. See Figure 10.
(a)
The function τ NR p ( · ) has a local maximum at x = 1 2 2 1 p 1 . Furthermore its minimum value converges to 1 4 .
(b)
The function τ ˜ S NR p ( · ) has a local maximum at x = 1 1 2 2 1 p 1 and 1 2 2 1 p 1 and its local maximum value converges to 1 4 . Furthermore, it has a local minimum at x = 1 2 and converges to 0.
(c)
The function σ ˜ S NR p ( · ) has a local maximum at x = 1 2 and its local maximum value converges to 0. In addition, it has a local minimum at x = 0 and x = 1 .
The local minimum for other τ f i , g i ( · ) is simple.
Proposition 17.
Let τ f i , g i with i = 1 , 2 , 3 be defined as in (20)–(28). Then, the function τ f i , g i ( · ) has a local minimum at x = 1 2 . See Figure 11.
Proof. 
Because each τ f i , g i ( x ) is nearly convex according to x = 1 2 and τ f i , g i ( x ) has a critical number at x = 1 2 , the local minimum at x = 1 2 is confirmed and can be calculated easily. We only present the values here.
τ f 1 , g 1 1 2 = 1 2 e τ f 1 , g 2 1 2 = 1 4 + 1 2 17 4 τ f 1 , g 3 1 2 = 1 2 + 1 4 e 2 + e τ f 2 , g 1 1 2 = 1 2 4 5 e τ f 2 , g 2 1 2 = 1 4 + 1 2 4 5 17 4 τ f 2 , g 3 1 2 = 1 2 4 5 + 1 4 e 2 + e τ f 3 , g 1 1 2 = ln ( 2 e 1 ) e τ f 3 , g 2 1 2 = ln ( 2 e 1 ) 1 4 17 4 τ f 3 , g 3 1 2 = ln ( 2 e 1 ) + 1 4 e 2 + e
This completes the proof. □

6. Summary

To summarize, when comparing all the curves based on NCP functions, almost all of them are neither convex nor concave. Only the curve based on the Fischer–Burmeister function is convex due the fact that its corresponding NCP function is also convex. Nonetheless, we observe that some curves are convex whereas their corresponding NCP functions are not. For instance, the curve based on the discrete type of the Fischer–Burmeister function. This indicates that the convexity of the curves depends on the choice of vertical plane. In addition, when p is perturbed, the interval of convexity will be shrunk or stretched. For the local minimum or maximum, when p becomes very large, most of the minima and maxima converge. and the minima or maxima vary by the perturbation of p.

Author Contributions

Supervision, Y.-L.C. and J.-S.C.; writing—original draft, S.-W.L.; writing—review and editing, Y.-L.C. All authors have read and agreed to the published version of the manuscript.

Funding

National Taiwan Normal University and National Science and Technology Council, Taiwan.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Alcantara, J.H.; Chen, J.-S. A novel generalization of the natural residual function and a neural network approach for the NCP. Neurocomputing 2020, 413, 368–382. [Google Scholar] [CrossRef]
  2. Chang, Y.-L.; Chen, J.-S.; Yang, C.-Y. Symmetrization of generalized natural residual function for NCP. Oper. Res. Lett. 2015, 43, 354–358. [Google Scholar] [CrossRef]
  3. Chen, J.-S. On some NCP-functions based on the generalized Fischer-Burmeister function. Asia-Pac. J. Oper. Res. 2007, 24, 401–420. [Google Scholar] [CrossRef] [Green Version]
  4. Chen, J.-S.; Ko, C.-H.; Wu, X.-R. What is the generalization of natural residual function for NCP. Pac. J. Optim. 2016, 12, 19–27. [Google Scholar]
  5. Galantai, A. Properties and construction of NCP functions. Comput. Optim. Appl. 2012, 52, 805–824. [Google Scholar] [CrossRef]
  6. Lee, C.-H.; Hu, C.-C.; Chen, J.-S. Using invertible functions to construct NCP functions. Linear Nonlinear Anal. 2020, 6, 347–369. [Google Scholar]
  7. Ma, P.-F.; Chen, J.-S.; Huang, C.-H.; Ko, C.-H. Discovery of new complementarity functions for NCP and SOCCP. Comput. Appl. Math. 2018, 37, 5727–5749. [Google Scholar] [CrossRef]
  8. Fischer, A. Solution of the monotone complementarity problem with locally Lipschitzian functions. Math. Program. 1997, 76, 513–532. [Google Scholar] [CrossRef]
  9. Fischer, A. A special Newton-type optimization methods. Optimization 1992, 24, 269–284. [Google Scholar] [CrossRef]
  10. Tseng, P. Global behaviour of a class of merit functions for the nonlinear complementarity problem. J. Optim. Theory Appl. 1996, 89, 17–37. [Google Scholar] [CrossRef]
  11. Huang, C.-H.; Weng, K.-J.; Chen, J.-S.; Chu, H.-W.; Li, M.-L. On four discrete-type families of NCP-functions. J. Nonlinear Convex Anal. 2019, 20, 283–306. [Google Scholar]
  12. Alcantara, J.H.; Lee, C.-H.; Nguyen, C.T.; Chang, Y.-L.; Chen, J.-S. On construction of new NCP functions. Oper. Res. Lett. 2020, 48, 115–121. [Google Scholar] [CrossRef]
  13. Tsai, H.-Y.; Chen, J.-S. Geometric views of the generalized Fischer-Burmeister function and its induced merit function. Appl. Math. Comput. 2014, 237, 31–59. [Google Scholar] [CrossRef]
  14. Chen, J.-S.; Li, J.-F.; Wu, J. A continuation approach for solving binary quadratic program based on a class of NCP-functions. Appl. Math. Comput. 2012, 219, 3975–3992. [Google Scholar] [CrossRef]
  15. Huang, C.-H.; Chen, J.-S.; Martinez-Legaz, J.E. Differentiability v.s. convexity for complementarity functions. Optim. Lett. 2017, 11, 209–216. [Google Scholar] [CrossRef]
  16. Tuy, H. Convex Analysis and Global Optimization, 2nd ed.; Springer: Hanoi, Vietnam, 2016. [Google Scholar]
  17. Polyak, R.A. Introduction to Continuous Optimization; Springer: Cham, Switzerland, 2021; Springer Optimization and Its Applications; Volume 172. [Google Scholar]
Figure 1. Graph of τ FB p ( x ) and τ D FB p ( x ) with different p. (a) Graph of τ FB p ( x ) with different values of p; (b) Graph of τ D FB p ( x ) with different values of p.
Figure 1. Graph of τ FB p ( x ) and τ D FB p ( x ) with different p. (a) Graph of τ FB p ( x ) with different values of p; (b) Graph of τ D FB p ( x ) with different values of p.
Axioms 11 00557 g001
Figure 2. Graphs of σ FB p with different values of p.
Figure 2. Graphs of σ FB p with different values of p.
Axioms 11 00557 g002
Figure 3. Graphic evidence regarding Remark 1 and Conjecture 1. (a) Graphs of σ FB ( x ) when 0 < x < 1 ; (b) Graphs of ( σ FB p ) ( 0.55 ) for different p.
Figure 3. Graphic evidence regarding Remark 1 and Conjecture 1. (a) Graphs of σ FB ( x ) when 0 < x < 1 ; (b) Graphs of ( σ FB p ) ( 0.55 ) for different p.
Axioms 11 00557 g003
Figure 4. Graphs of τ NR p and τ S NR p with different values of p. (a) Graphs of τ NR p with different values of p; (b) Graphs of τ S NR p with different values of p.
Figure 4. Graphs of τ NR p and τ S NR p with different values of p. (a) Graphs of τ NR p with different values of p; (b) Graphs of τ S NR p with different values of p.
Axioms 11 00557 g004
Figure 5. Graph of the function σ S NR p with different values of p.
Figure 5. Graph of the function σ S NR p with different values of p.
Axioms 11 00557 g005
Figure 6. Graphs of τ ˜ NR p ( x ) , τ ˜ S NR p ( x ) and σ ˜ S NR p with different values of p. (a) Graphs of τ ˜ NR p ( x ) with different values of p; (b) Graphs of τ ˜ S NR p ( x ) with different values of p; (c) Graphs of σ ˜ S NR p with different values of p.
Figure 6. Graphs of τ ˜ NR p ( x ) , τ ˜ S NR p ( x ) and σ ˜ S NR p with different values of p. (a) Graphs of τ ˜ NR p ( x ) with different values of p; (b) Graphs of τ ˜ S NR p ( x ) with different values of p; (c) Graphs of σ ˜ S NR p with different values of p.
Axioms 11 00557 g006
Figure 7. Graphs of τ FB p ( x ) , τ D FB p ( x ) and σ FB p ( x ) with different values of p. (a) Local minimum of τ FB p ( x ) ; (b) Local minimum of τ D FB p ( x ) ; (c) Local minimum and maximum of σ FB p ( x ) .
Figure 7. Graphs of τ FB p ( x ) , τ D FB p ( x ) and σ FB p ( x ) with different values of p. (a) Local minimum of τ FB p ( x ) ; (b) Local minimum of τ D FB p ( x ) ; (c) Local minimum and maximum of σ FB p ( x ) .
Axioms 11 00557 g007
Figure 8. Local maximum of τ NR p ( x ) with different values of p.
Figure 8. Local maximum of τ NR p ( x ) with different values of p.
Axioms 11 00557 g008
Figure 9. Graphs of τ S NR p ( x ) and σ S NR p ( x ) with different values of p. (a) Local minimum and maximum of τ S NR p ( x ) ; (b) Local minimum and maximum of σ S NR p ( x ) .
Figure 9. Graphs of τ S NR p ( x ) and σ S NR p ( x ) with different values of p. (a) Local minimum and maximum of τ S NR p ( x ) ; (b) Local minimum and maximum of σ S NR p ( x ) .
Axioms 11 00557 g009
Figure 10. Graphs of τ ˜ NR p ( x ) , τ ˜ S NR p ( x ) and σ ˜ S NR p ( x ) with different values of p. (a) Local maximum of τ ˜ NR p ( x ) ; (b) Local minimum and maximum of τ ˜ S NR p ( x ) ; (c) Local minimum and maximum of σ ˜ S NR p ( x ) .
Figure 10. Graphs of τ ˜ NR p ( x ) , τ ˜ S NR p ( x ) and σ ˜ S NR p ( x ) with different values of p. (a) Local maximum of τ ˜ NR p ( x ) ; (b) Local minimum and maximum of τ ˜ S NR p ( x ) ; (c) Local minimum and maximum of σ ˜ S NR p ( x ) .
Axioms 11 00557 g010
Figure 11. Local minimum of τ f i , g i ( x ) for i , j = 1 , 2 , 3 .
Figure 11. Local minimum of τ f i , g i ( x ) for i , j = 1 , 2 , 3 .
Axioms 11 00557 g011
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Li, S.-W.; Chang, Y.-L.; Chen, J.-S. Plane Section Curves on Surfaces of NCP Functions. Axioms 2022, 11, 557. https://doi.org/10.3390/axioms11100557

AMA Style

Li S-W, Chang Y-L, Chen J-S. Plane Section Curves on Surfaces of NCP Functions. Axioms. 2022; 11(10):557. https://doi.org/10.3390/axioms11100557

Chicago/Turabian Style

Li, Shun-Wei, Yu-Lin Chang, and Jein-Shan Chen. 2022. "Plane Section Curves on Surfaces of NCP Functions" Axioms 11, no. 10: 557. https://doi.org/10.3390/axioms11100557

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop