1. Introduction
The nonlinear complementarity problem (NCP) is finding a vector such that
where is the Euclidean inner product and F is a function from to . 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 is said to be an NCP function if it satisfiesIn light of the NCP function, one can define the vector-valued function by
where is a mapping from to . Consequently, solving the NCP is equivalent to solving a system of equation . In particular, it also induces a merit function of the NCP which is given byIt is clear that the global minimizer of 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] , defined as
where . 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(1)
where and . Similarly, it induces a merit function given by(2)
where .Another popular NCP function is the natural residual function [4], given by
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 by
(3)
where 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, is defined by(4)
where and p is an odd integer. If , then it is exactly the classical Fischer–Burmeister function (see [4,11]). The graph of 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 can also be expressed as a piecewise function: where and p is an odd integer. They use this expression of to modify the part on , and achieve symmetrization of as below:(5)
where and p is an odd integer. Surprisingly, it is still an NCP function.How about the merit function induced by ? Observing that the merit function has squared terms, Chang, Yang, and Chen combined and together and constructed as
(6)
where 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:
(7)
where is a real number andThe main principle behind their work is described as follows. If is a bijection mapping and is a given NCP function, then is also an NCP function. Hence, it can be verified that
is an NCP function by employing the bijective function , see [12]. Note that when p is an positive odd integer, it reduces to the discrete type of a natural residual function, that is, .For further symmetrization, using the above idea in (5) and (6), one can obtain a continuous type of natural residual functions [12]:
(8)
and its corresponding merit function(9)
where . Again, when p is an odd integer, we see the beloe relations,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 be a continuous differentiable function and with . They chose functions of and satisfying the below conditions to construct new NCP functions:
(i). f is invertible on .
(ii). is a strictly monotonically increasing function.
(iii). , , and .
More specifically, it is shown that the function
is an NCP function. For example, taking , we see that is invertible on and the inverse function is . It is easy to see that , . Thus, is strictly monotone increasing on . For third condition, we take , which gives on and on . We list some more examples of f and g as below. Examples of are and examples of areIn summary, nine corresponding NCP functions are generated by using the above and .
(10)
In [13], Tsai et al. discussed the geometry of curves on Fischer–Burmeister function surfaces, which are intersected by the plane for . They parametrized the curves by considering and and defined the vector valued function and as and , 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 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 and , where and . 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.
([3], Property 2.1 and Property 2.2, [2], Proposition 2.2). Let , and be defined as in (1), (2) and (4) respectively. Then, the following hold.
(a). The function is differentiable everywhere except for the origin, and convex on , provided .
(b). The function is differentiable everywhere, but neither convex nor concave, provided .
(c). The function is differentiable everywhere, but neither convex nor concave provided and is an odd integer.
([4], Proposition 2.4, [2], Proposition 2.2). Let , , and be defined as in (3), (5) and (6) respectively. Then, when and is an odd integer, the following hold.
(a). The function is differentiable everywhere, but neither convex nor concave.
(b). The function is differentiable everywhere except for . but neither convex nor concave.
(c). The function is differentiable everywhere, but neither convex nor concave.
([1], Proposition 2). Let , and be defined as in (7), (8) and (9) respectively. Then, for , the following hold.
(a). The function is differentiable everywhere, but neither convex nor concave.
(b). The function is differentiable everywhere except for , but neither convex nor concave.
(c). The function is differentiable everywhere, but neither convex nor concave.
([12], Proposition 2.3). Suppose that g is strictly increasing on some interval . Then, for , the function 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 .
-
(a). .
-
(b). .
-
(c). .
-
(d). .
-
(e). .
-
(f). .
Moreover, the below NCP functions are nonconvex as well.
-
(g). .
-
(h). .
-
(i). .
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 , (or merit functions ) with the vertical plane . To proceed, we set and . Then, the curves are parameterized as
From the aforementioned NCP functions in Section 2, the parametrized curves are listed as below:
(11)
(12)
(13)
(14)
(15)
(16)
(17)
(18)
(19)
(20)
(21)
(22)
(23)
(24)
(25)
(26)
(27)
(28)
Let , and be defined as (11), (12) and (13) respectively. Then, the following hold.
-
(a). For , the function is differentiable on .
-
(b). For , the function is differentiable on .
-
(c). For all odd integers, the function is differentiable on .
The results follow immediately from Lemma 1. □
Let , and be defined as in (14), (15) and (16), respectively. Then, for and p is an odd integer, the following hold.
-
(a). The function is differentiable on ;
-
(b). The function is not differentiable at ;
-
(c). The function is differentiable on .
The results are immediate consequences of Lemma 2. □
Let , , and be defined as in (17), (18) and (19), respectively. Then, for , the following hold.
-
(a). The function is differentiable on .
-
(b). The function is not differentiable at .
-
(c). The function is differentiable on .
The results follow from Lemma 3 directly. □
Let be defined as in (20)–(28) where and . Then, the following hold.
-
(a). For and , the function is differentiable on .
-
(b). For , The function is not differentiable at or .
(a) Based on Proposition 2(a), the function is differentiable on . In addition, we know that the exponential function and are differentiable on . Therefore, is differentiable on .
(b) Let , which says . For , the right derivative at is . For , the left derivative at is . Then, it is clear that , hence is not differentiable at . Similarly, it is easy to check the non-differentiability at . To summarize, the function is not differentiable at or . □
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.
(a) If and are convex on an interval, then is also convex on the interval.
-
(b). Let be a convex function and let be a nondecreasing convex function. Then is convex on .
These are very basic materials which are also well known, see [16]. □
Let and be defined as in (11) and (13), respectively. Then, the following hold. See Figure 1.
-
(a). For , the function is convex on .
-
(b). When p is an odd integer, the function is convex on .
(a) First, as indicated in (11), Since the curve is the section of a plane with the surface of the function , which is convex on according to Lemma 1(a). is convex on .
(b) As shown in (13), where p is an odd integer. Let and . It is clear that is nondecreasing and convex; moreover, is positive and convex. Then, according to Lemma 4(b), is convex on . □
Let be defined as in (12). Then, for any , the function is convex on and See Figure 2.
As given in (12), Let and . It is clear that is nondecreasing and convex on . Furthermore, is convex and positive on . Hence, according to Lemma 4(b), is convex on . In addition, due to symmetry, is also convex on . □
(i) Set . The second derivative of gives
From this, we know that are two inflection points of the function . Hence, the function is convex on the intervals and . For a general , we have difficulty in determining their infection points. However, let us study their behavior when p goes to ∞ on the interval . When , we have . Hence, the function approaches as p goes to ∞. Similarly, provided , the function approaches as p goes to ∞. Note also that approaches as p goes to ∞.
-
(ii). We also examine the behavior of the second derivative of the function at the point which is near . We present the numerical results in Figure 3. Observe that their inflection points approaches , and also that approaches 1 as p goes to ∞.
According to Remark 1 and Figure 3, we make a conjecture here.
Let be defined as in (12). Then, for any , the function has two inflection points , and both approach as p goes to ∞.
Let and be defined as in (14) and (15), respectively. Then, when p is an odd integer, the following hold. See Figure 4.
-
(a). The function is convex on .
-
(b). The function is convex on .
(a) As given in (14), which says
To proceed, we discuss three subcases:
Case (i): On the interval , we have , which says .
Case (ii): At the points , we have as well.
Case (iii): On the interval , we need to show that over for all . Indeed, on the interval , we have and . Define . Then, our goal is to show for all on the interval . When , we have on . In addition, note that on the same interval. For other with , we have
Let . Then, the term in is expressed as
Since, on the interval a and b are positive, we conclude that .
To summarize, on the interval , the second derivative , which means that is convex on this interval.
(b) As stated in (15), For , similar to part (a), it can be verified that is convex. Therefore, is convex on . For , due to symmetry, is convex on .
Additionally, note that is continuous on , and increasing (decreasing) on the right (left) hand side of the point , since , on the interval as well as , on the interval . Hence, the point is the only minimizer on the interval . In summary, we can conclude that is convex on the interval . □
Let be defined as in (16). Then, when and p is an odd integer, the function is convex on and . See Figure 5.
As indicated in (16), where p is an odd integer and . Since is symmetric about , we divide it into two cases:
Cases (i): Suppose , the first and second derivative of this function are
whereNote that , we want to show that is positive for .
Because , we have , which implies . Moreover, as we have and , then . Similarly, because , we have . Hence, . Moreover, as we have and , then . Finally, because we have , which gives . Moreover, we have and . Then, it says .
To summarize, we have shown for , which says for . In other words, is convex on .
Cases (ii): Suppose , since is symmetric about . In this case, it is clear that is convex on .
By cases (i) and (ii), we prove that is convex on and . □
Because , and are the continuous types of , and , similar to Propositions 8 and 9, we establish the next proposition.
Let , and be defined as in (17), (18), and (19), respectively. Then, the following hold. See Figure 6.
-
(a). If , then the function is convex on .
-
(b). If , then the function is convex on .
-
(c). If , then the function is convex on and .
The following proposition is simple but tedious. We list it here for the readers’ convenience.
Let where and be defined from (20)–(28). Then, the following hold.
-
(a). The function for and is convex on .
-
(b). The function for is convex on intervals , and .
-
(c). The function for has inflection points, and thus is neither convex nor concave on entire .
(a) As stated in (20), Let and . Because is convex on according to Proposition 6(b), it suffices to show that is convex. Taking the first and second derivatives of this function give
In order to verify that , we divide it into three cases:
Cases (i): Suppose . We have , hence . Then, we obtain .
Cases (ii): Suppose . We have , hence . Then, we obtain .
Cases (iii): Suppose . We have , hence . Then, we obtain .
This shows that is always positive, which indicates that is convex on . Because and are convex on , according to Lemma 4(a), the function is convex on .
As indicated in(21), Let and . We need to verify that is convex. Taking the second derivative of gives
We want to show that that . The main principle of this is to check whether the minimum of the second derivative is positive. Taking the third derivative gives
The critical numbers of are , and . Moreover, , and . The intervals where it is increasing are and , and the intervals where it is decreasing are and . Therefore, the local minimum is , and the local maximum is . Furthermore, we also find . This shows that the global minimum of is positive, hence on the entire . This implies that is convex on . As and are convex on according to Lemma 4(a), is convex on .
As shown in (23), As
and are convex on from previous discussions according to Lemma 4(a), is convex on .
As given in (24), As and are convex on from previous work according to Lemma 4(a), is convex on .
(b) As shown in (26), Let and . As is convex on based on the proof of the case for , the convexity of is all that remains to determined. Note that is not differentiable at and , and we need to discuss three cases:
Cases (i): Suppose . Taking the first derivative and second derivative of give
Since the denominator of is positive, we need to check whether the numerator is positive. The numerator is . For , we have and , which indicates that the numerator is positive. Therefore, we conclude , and hence is convex on the interval .
Cases (ii): Suppose , taking the second derivative of gives
We want to show that for . Taking the third derivative of yields
For the first term of , since , the denominator is positive, and hence the first term is positive. For the second term of , we have
As and when , it is also positive. Therefore, we obtain . This shows that is increasing. Note also that . Then, it follows that . is convex on the interval .
Cases (iii): Suppose . As is symmetric about the point according to case (ii), the function is convex on interval .
As indicated in (27),
Let and . is convex on according to the proof of the case for and is convex on the intervals , and according to previous arguments. Therefore, is convex on the intervals , , and .
(c) As given in (22), Taking the second derivative of gives
The inflection points are , , , and . Then, the intervals where the curve is convex are , and .
As indicated in (25), we know
Similarly, we use the second derivative to find the inflection points. The inflection points are , , , and . Therefore, the intervals where the curve is convex are , , and .
As shown in (28), we know
Similarly, we use the second derivative to find the inflection points. The inflection points are and . Because is not differentiable at the points 0 and 1, we can only assure that the interval where the curve is convex is . □
Recall that a function is called subdifferentiable at x if there exists at least one subgradient at x. Although 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.
(a) The function is subdifferentiable at the points 0 and 1 and the subdifferential is described by
Moreover, is convex on .
-
(b). The function is subdifferentiable at the points 0 and 1 and the subdifferential is described by
(a) Taking the first derivative of gives
The right and left derivatives at the point 0 are and , respectively. Moreover, we have . Based on the convexity of on from Proposition 11(b), we have
with small and . Note here the is a continuous function. Let . Thus, we have for . Similarly, according to the convexity of on from Proposition 11(b), we can obtain that where . Therefore, we show that is subdifferentiable at 0, and . Moreover based on Lemma 2.13 in [17], is convex on the interval , especially at the point 0. Likewise, and it is convex at the point 1. Hence, is convex on entire .(b) Taking the first derivative of yields
The right derivative at the point 0 is and the left derivative at the point 0 is . Therefore, we obtain
Similarly, □
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.
Let , and be defined as in (11), (13), and (12) respectively. Then, the following hold. See Figure 7.
-
(a). The function has a local minimum at and its local minimum value converges to .
-
(b). When p is an odd integer, the function has a local minimum at and its local minimum value converges to .
-
(c). The function has local minima at and 1. Furthermore, it has a local maximum value at and its local maximum value converges to .
(a) From (11), we know that
where . The first derivative of this function isNote that the first term is positive. We then investigate the second term:
Case (i): If , then .
Case (ii): If , then .
Case (iii): When , we see that is the only root of . Moreover, is convex on , which indicates is the only local minimizer and the value is . Furthermore, we observe that the local minimum value converges to as .
(b) From (13), we know that
where and p is an odd integer. Taking the first derivative of this function yieldsIt can be verified that is the singular critical point. Note that is convex on , hence is a local minimizer and the value is . In addition, the local minimum value converges to when .
(c) From (12), we know that
where . Taking the first derivative of this function givesWe want to solve , which implies or . If , we have and . If , we have . Thus, the critical numbers are . Note that 0 and 1 are the only two roots of and is non-negative. Therefore, we see that and are local minimizers, and the values are both 0.
On the other hand, we know that is decreasing (increasing) on the right (left) hand side of the point . Hence, the point is a local maximizer, and the value is . This further implies that when , the local maximum converges to . □
Let be defined as in (14) with odd integer p. Then, the function has a local maximum at . Furthermore, its minimum value converges to . See Figure 8.
From (14), we know that where and p is an odd integer. Computing the first derivative of this function gives
To proceed, we discuss two cases:
Cases (i): If , then . Hence, is increasing on , which indicates that it does not have local minimum or maximum value.
Cases (ii): If , then . It is verified that is the only root of for . Moreover, we have that 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 Furthermore, the local maximum value converges to as . □
Let and be defined as in (15) and (16), respectively. Then, for the odd integer p, the following hold. See Figure 9.
-
(a). The function has a local maximum at and . Its local maximum value converges to . Furthermore, it has a local minimum at , which converges to 0.
-
(b). The function has a local maximum at and its maximum value converges to 0. In addition, it has a local minimum at and .
(a) From (15), we know that
where p is an odd integer. As is symmetric at the point , we consider the below two cases:Cases (i): If , according to Proposition 14, the local maximum point is and the maximum value is , which converges to as .
Cases (ii): If , similar to Case (i), we obtain that is a local maximum point and the maximum value is which converges to as .
Furthermore, because the function is increasing (decreasing) on the right (left) hand side of the point , we can conclude is a local minimizer. Its the minimum value is , which converges to 0 when .
(b) From (16), we know that
where p is an odd integer. Since is symmetric at the point , we divide it into two cases:Case (i): Suppose , the first derivative is
Based on this, it is verified that is a critical point. Because is non-negative and , we can conclude that 1 is a local minimum point and the value is 0.
Case (ii): Suppose . Based on symmetry, the local minimum point is and the value is 0.
Case (iii): Suppose , we know that and is decreasing (increasing) on the right (left) side of the point . Hence, we obtain that is a local maximizer and the maximum value is for . It clearly converges to 0 when . □
Due to the fact that , , and are continuous counterparts of , and , analogous to Propositions 14 and 15, their local maximums and minimums can be obtained. We omit the proof here.
Let , and be defined as in (17), (18), and (19), respectively. Then, for , the following hold. See Figure 10.
-
(a). The function has a local maximum at . Furthermore its minimum value converges to .
-
(b). The function has a local maximum at and and its local maximum value converges to . Furthermore, it has a local minimum at and converges to 0.
-
(c). The function has a local maximum at and its local maximum value converges to 0. In addition, it has a local minimum at and .
The local minimum for other is simple.
Let with be defined as in (20)–(28). Then, the function has a local minimum at . See Figure 11.
Because each is nearly convex according to and has a critical number at , the local minimum at is confirmed and can be calculated easily. We only present the values here.
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.
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.
Not applicable.
Not applicable.
Not applicable.
The authors declare no conflict of interest.
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Figure 1. Graph of [Forumla omitted. See PDF.] and [Forumla omitted. See PDF.] with different p. (a) Graph of [Forumla omitted. See PDF.] with different values of p; (b) Graph of [Forumla omitted. See PDF.] with different values of p.
Figure 3. Graphic evidence regarding Remark 1 and Conjecture 1. (a) Graphs of [Forumla omitted. See PDF.] when [Forumla omitted. See PDF.]; (b) Graphs of [Forumla omitted. See PDF.] for different p.
Figure 4. Graphs of [Forumla omitted. See PDF.] and [Forumla omitted. See PDF.] with different values of p. (a) Graphs of [Forumla omitted. See PDF.] with different values of p; (b) Graphs of [Forumla omitted. See PDF.] with different values of p.
Figure 5. Graph of the function [Forumla omitted. See PDF.] with different values of p.
Figure 6. Graphs of [Forumla omitted. See PDF.], [Forumla omitted. See PDF.] and [Forumla omitted. See PDF.] with different values of p. (a) Graphs of [Forumla omitted. See PDF.] with different values of p; (b) Graphs of [Forumla omitted. See PDF.] with different values of p; (c) Graphs of [Forumla omitted. See PDF.] with different values of p.
Figure 7. Graphs of [Forumla omitted. See PDF.], [Forumla omitted. See PDF.] and [Forumla omitted. See PDF.] with different values of p. (a) Local minimum of [Forumla omitted. See PDF.]; (b) Local minimum of [Forumla omitted. See PDF.]; (c) Local minimum and maximum of [Forumla omitted. See PDF.].
Figure 8. Local maximum of [Forumla omitted. See PDF.] with different values of p.
Figure 9. Graphs of [Forumla omitted. See PDF.] and [Forumla omitted. See PDF.] with different values of p. (a) Local minimum and maximum of [Forumla omitted. See PDF.]; (b) Local minimum and maximum of [Forumla omitted. See PDF.].
Figure 10. Graphs of [Forumla omitted. See PDF.], [Forumla omitted. See PDF.] and [Forumla omitted. See PDF.] with different values of p. (a) Local maximum of [Forumla omitted. See PDF.]; (b) Local minimum and maximum of [Forumla omitted. See PDF.]; (c) Local minimum and maximum of [Forumla omitted. See PDF.].
Figure 11. Local minimum of [Forumla omitted. See PDF.] for [Forumla omitted. See PDF.].
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, pp. 368-382. [DOI: https://dx.doi.org/10.1016/j.neucom.2020.06.059]
2. Chang, Y.-L.; Chen, J.-S.; Yang, C.-Y. Symmetrization of generalized natural residual function for NCP. Oper. Res. Lett.; 2015; 43, pp. 354-358. [DOI: https://dx.doi.org/10.1016/j.orl.2015.04.007]
3. Chen, J.-S. On some NCP-functions based on the generalized Fischer-Burmeister function. Asia-Pac. J. Oper. Res.; 2007; 24, pp. 401-420. [DOI: https://dx.doi.org/10.1142/S0217595907001292]
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, pp. 19-27.
5. Galantai, A. Properties and construction of NCP functions. Comput. Optim. Appl.; 2012; 52, pp. 805-824. [DOI: https://dx.doi.org/10.1007/s10589-011-9428-9]
6. Lee, C.-H.; Hu, C.-C.; Chen, J.-S. Using invertible functions to construct NCP functions. Linear Nonlinear Anal.; 2020; 6, pp. 347-369.
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, pp. 5727-5749. [DOI: https://dx.doi.org/10.1007/s40314-018-0660-0]
8. Fischer, A. Solution of the monotone complementarity problem with locally Lipschitzian functions. Math. Program.; 1997; 76, pp. 513-532. [DOI: https://dx.doi.org/10.1007/BF02614396]
9. Fischer, A. A special Newton-type optimization methods. Optimization; 1992; 24, pp. 269-284. [DOI: https://dx.doi.org/10.1080/02331939208843795]
10. Tseng, P. Global behaviour of a class of merit functions for the nonlinear complementarity problem. J. Optim. Theory Appl.; 1996; 89, pp. 17-37. [DOI: https://dx.doi.org/10.1007/BF02192639]
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, pp. 283-306.
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, pp. 115-121. [DOI: https://dx.doi.org/10.1016/j.orl.2020.01.002]
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, pp. 31-59. [DOI: https://dx.doi.org/10.1016/j.amc.2014.03.089]
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, pp. 3975-3992. [DOI: https://dx.doi.org/10.1016/j.amc.2012.10.033]
15. Huang, C.-H.; Chen, J.-S.; Martinez-Legaz, J.E. Differentiability v.s. convexity for complementarity functions. Optim. Lett.; 2017; 11, pp. 209-216. [DOI: https://dx.doi.org/10.1007/s11590-015-0993-1]
16. Tuy, H. Convex Analysis and Global Optimization; 2nd ed. Springer: Hanoi, Vietnam, 2016.
17. Polyak, R.A. Introduction to Continuous Optimization; Springer: Cham, Switzerland, 2021; Springer Optimization and Its Applications Volume 172.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer
© 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
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.
You have requested "on-the-fly" machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Show full disclaimer
Neither ProQuest nor its licensors make any representations or warranties with respect to the translations. The translations are automatically generated "AS IS" and "AS AVAILABLE" and are not retained in our systems. PROQUEST AND ITS LICENSORS SPECIFICALLY DISCLAIM ANY AND ALL EXPRESS OR IMPLIED WARRANTIES, INCLUDING WITHOUT LIMITATION, ANY WARRANTIES FOR AVAILABILITY, ACCURACY, TIMELINESS, COMPLETENESS, NON-INFRINGMENT, MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. Your use of the translations is subject to all use restrictions contained in your Electronic Products License Agreement and by using the translation functionality you agree to forgo any and all claims against ProQuest or its licensors for your use of the translation functionality and any output derived there from. Hide full disclaimer