The patent, uncovered by Unwired View, describes displays that could be either concave or convex, allowing for the kind of design Google provided in its Nexus S smartphone, but physical changes are just the tip of the iceberg.
This suggests a natural question: with respect to which kind of convex or concave functions does it hold true?
Since the proof of the main result of the previous section is based on the Krasnoselskii iteration, we will need some kind of convex combination.
This kind of convex relaxation for the joint sum-power constraint is not applicable to the case of separate sum-power constraints in (mathbf {x}_{i}^{(ell)}) and (mathbf {y}_{i}^{(ell)}) because the power distribution (68) does not hold in the latter case.
18(200261-173, 2002), Kavurmacı et al. (New Definitions and Theorems via Different Kinds of Convex Dominated Functions, 2012) and Özdemir et al. (Two new different kinds of convex dominated functions and inequalities via Hermite-Hadamard type, 2012).
In recent decades, plenty of inequalities of Hermite-Hadamard type for various kinds of convex functions have been established.
Some integral inequalities of Hermite-Hadamard type for other kinds of convex functions were also established in [9 16] and references cited therein.
Additionally, over the past few years, different types of techniques are reported for the protection of convex corners in different kinds of etchants for both {100} and {110} silicon wafers [119-128].
Therefore, the algorithms for obtaining suboptimal solution are provided in succession, and these algorithms are divided into three kinds, namely, convex optimization algorithms, combination algorithms, and greedy algorithms [12].
