In this article, first, the sharp estimates of all homogeneous expansions for a subclass of quasi-convex mappings of type B and order B on the unit ball in complex Ba- nach spaces are given. Second, the sharp estimat...In this article, first, the sharp estimates of all homogeneous expansions for a subclass of quasi-convex mappings of type B and order B on the unit ball in complex Ba- nach spaces are given. Second, the sharp estimates of all homogeneous expansions for the above generalized mappings on the unit polydisk in （in are also established. In particular, the sharp estimates of all homogeneous expansions for a subclass of quasi-convex mappings （include quasi-convex mappings of type A and quasi-convex mappings of type B） in several complex variables are get accordingly. Our results state that a weak version of the Bieber- bach conjecture for quasi-convex mappings of type B and order a in several complex variables is proved, and the derived conclusions are the generalization of the classical results in one complex variable.展开更多
A new nonparametric procedure is developed to test the exponentiality against the strict NBUC property of a life distribution. The exact null distribution is derived by the theory of sample spacings, and the asymptoti...A new nonparametric procedure is developed to test the exponentiality against the strict NBUC property of a life distribution. The exact null distribution is derived by the theory of sample spacings, and the asymptotic normality is also established by the large sample theory of L-statistics. Finally, the lower and upper tailed probability of the exact null distribution and some numerical simulation results are presented as well.展开更多
In this paper, we first establish several sharp inequalities of homogeneous expansion for biholomorphic quasi-convex mappings of type B and order α on the unit ball E in a complex Banach space X by applying the metho...In this paper, we first establish several sharp inequalities of homogeneous expansion for biholomorphic quasi-convex mappings of type B and order α on the unit ball E in a complex Banach space X by applying the method and technique of complex analysis. Then, as the application of these sharp inequalities, we derive the sharp estimate of third homogeneous expansions for the above mappings defined on the unit polydisk U^n in C^n.展开更多
In this paper,we combine L-fuzzy syntopogenous structure on X with algebraic structure on X.First,the *-increasing and *-decreasing spaces have been studied.Second,we define a-order-convexity on syntopogenous structur...In this paper,we combine L-fuzzy syntopogenous structure on X with algebraic structure on X.First,the *-increasing and *-decreasing spaces have been studied.Second,we define a-order-convexity on syntopogenous structures(X,S,≤).some important properties of a-order-convexity have been obtained.展开更多
In this paper, we introduce the concept of a (weak) minimizer of order k for a nonsmooth vector optimization problem over cones. Generalized classes of higher-order cone-nonsmooth (F, ρ)-convex functions are introduc...In this paper, we introduce the concept of a (weak) minimizer of order k for a nonsmooth vector optimization problem over cones. Generalized classes of higher-order cone-nonsmooth (F, ρ)-convex functions are introduced and sufficient optimality results are proved involving these classes. Also, a unified dual is associated with the considered primal problem, and weak and strong duality results are established.展开更多
This paper is concerned with the following variable-order fractional Laplacian equations , where N ≥ 1 and N > 2s(x,y) for (x,y) ∈ Ω × Ω, Ω is a bounded domain in R<sup>N</sup>, s(⋅)...This paper is concerned with the following variable-order fractional Laplacian equations , where N ≥ 1 and N > 2s(x,y) for (x,y) ∈ Ω × Ω, Ω is a bounded domain in R<sup>N</sup>, s(⋅) ∈ C (R<sup>N</sup> × R<sup>N</sup>, (0,1)), (-Δ)<sup>s(⋅)</sup> is the variable-order fractional Laplacian operator, λ, μ > 0 are two parameters, V: Ω → [0, ∞) is a continuous function, f ∈ C(Ω × R) and q ∈ C(Ω). Under some suitable conditions on f, we obtain two solutions for this problem by employing the mountain pass theorem and Ekeland’s variational principle. Our result generalizes the related ones in the literature.展开更多
Two new versions of accelerated first-order methods for minimizing convex composite functions are proposed. In this paper, we first present an accelerated first-order method which chooses the step size 1/ Lk to be 1/ ...Two new versions of accelerated first-order methods for minimizing convex composite functions are proposed. In this paper, we first present an accelerated first-order method which chooses the step size 1/ Lk to be 1/ L0 at the beginning of each iteration and preserves the computational simplicity of the fast iterative shrinkage-thresholding algorithm. The first proposed algorithm is a non-monotone algorithm. To avoid this behavior, we present another accelerated monotone first-order method. The proposed two accelerated first-order methods are proved to have a better convergence rate for minimizing convex composite functions. Numerical results demonstrate the efficiency of the proposed two accelerated first-order methods.展开更多
Let (X 1,X 2,...,X n) and (Y 1,Y 2,...,Y n) be real random vectors with the same marginal distributions,if (X 1,X 2,...,X n)≤ c(Y 1,Y 2,...,Y n), it is showed in this paper that ∑ n i=1 X i≤ c...Let (X 1,X 2,...,X n) and (Y 1,Y 2,...,Y n) be real random vectors with the same marginal distributions,if (X 1,X 2,...,X n)≤ c(Y 1,Y 2,...,Y n), it is showed in this paper that ∑ n i=1 X i≤ cx ∑ n i=1 Y i and max 1≤k≤n ∑ k i=1 X i≤ icx max 1≤k≤n ∑ k i=1 Y i hold.Based on this fact,a more general comparison theorem is obtained.展开更多
In this paper, we establish the second-order differential equation system with the feedback controls for solving the problem of convex programming. Using Lagrange function and projection operator, the equivalent opera...In this paper, we establish the second-order differential equation system with the feedback controls for solving the problem of convex programming. Using Lagrange function and projection operator, the equivalent operator equations for the convex programming problems under the certain conditions are obtained. Then a second-order differential equation system with the feedback controls is constructed on the basis of operator equation. We prove that any accumulation point of the trajectory of the second-order differential equation system with the feedback controls is a solution to the convex programming problem. In the end, two examples using this differential equation system are solved. The numerical results are reported to verify the effectiveness of the second-order differential equation system with the feedback controls for solving the convex programming problem.展开更多
When the edges of a convex polygon are traversed along one direction,the interior of the convex polygon is always on the same side of the edges. Based on this characteristic of convex polygons,a new algorithm for comp...When the edges of a convex polygon are traversed along one direction,the interior of the convex polygon is always on the same side of the edges. Based on this characteristic of convex polygons,a new algorithm for computing the convex hull of a simple polygon is proposed in this paper,which is then extended to a new algorithm for computing the convex hull of a planar point set. First,the extreme points of the planar point set are found,and the subsets of point candidate for vertex of the convex hull between extreme points are obtained. Then,the ordered convex hull point sequences between extreme points are constructed separately and concatenated by removing redundant extreme points to get the convex hull. The time complexity of the new planar convex hull algorithm is O(nlogh) ,which is equal to the time complexity of the best output-sensitive planar convex hull algorithms. Compared with the algorithm having the same complexity,the new algorithm is much faster.展开更多
The formulas of the lower orders of Dirichlet series are given by means of the exponents and the convex regularized sequences of the logarithms and the convex regularized sequences of the logarithms of the moduli of t...The formulas of the lower orders of Dirichlet series are given by means of the exponents and the convex regularized sequences of the logarithms and the convex regularized sequences of the logarithms of the moduli of the coefficients. Corresponding results are obtained for some random Dirichlet series.展开更多
In this paper, by means of combining non-probabilistic convex modeling with perturbation theory, an improvement is made on the first order approximate solution in convex models of uncertainties. Convex modeling is ext...In this paper, by means of combining non-probabilistic convex modeling with perturbation theory, an improvement is made on the first order approximate solution in convex models of uncertainties. Convex modeling is extended to largely uncertain and non-convex sets of uncertainties and the combinational convex modeling is developed. The presented method not only extends applications of convex modeling, but also improves its accuracy in uncertain problems and computational efficiency. The numerical example illustrates the efficiency of the proposed method.展开更多
In this paper, maximal above and below pairs of fully ordered groups (o groups) are studied. It is shown that maximal above and below pairs of an divisible abelian o group have some specific properties, and by using...In this paper, maximal above and below pairs of fully ordered groups (o groups) are studied. It is shown that maximal above and below pairs of an divisible abelian o group have some specific properties, and by using these properties another embedding method of an abelian o group to real valued functions is discussed.展开更多
基金Supported by National Natural Science Foundation of China(11471111)Guangdong Natural Science Foundation(2014A030307016)
文摘In this article, first, the sharp estimates of all homogeneous expansions for a subclass of quasi-convex mappings of type B and order B on the unit ball in complex Ba- nach spaces are given. Second, the sharp estimates of all homogeneous expansions for the above generalized mappings on the unit polydisk in （in are also established. In particular, the sharp estimates of all homogeneous expansions for a subclass of quasi-convex mappings （include quasi-convex mappings of type A and quasi-convex mappings of type B） in several complex variables are get accordingly. Our results state that a weak version of the Bieber- bach conjecture for quasi-convex mappings of type B and order a in several complex variables is proved, and the derived conclusions are the generalization of the classical results in one complex variable.
基金This research is supported by the National Natural Science Foundation of Chinaunder Grant No. 10201010 and TY 10126014.
文摘A new nonparametric procedure is developed to test the exponentiality against the strict NBUC property of a life distribution. The exact null distribution is derived by the theory of sample spacings, and the asymptotic normality is also established by the large sample theory of L-statistics. Finally, the lower and upper tailed probability of the exact null distribution and some numerical simulation results are presented as well.
基金supported by Guangdong Natural Science Foundation(2018A030313508)Science and Technology Program of Guangzhou,China(201804010171)
文摘In this paper, we first establish several sharp inequalities of homogeneous expansion for biholomorphic quasi-convex mappings of type B and order α on the unit ball E in a complex Banach space X by applying the method and technique of complex analysis. Then, as the application of these sharp inequalities, we derive the sharp estimate of third homogeneous expansions for the above mappings defined on the unit polydisk U^n in C^n.
文摘In this paper,we combine L-fuzzy syntopogenous structure on X with algebraic structure on X.First,the *-increasing and *-decreasing spaces have been studied.Second,we define a-order-convexity on syntopogenous structures(X,S,≤).some important properties of a-order-convexity have been obtained.
文摘In this paper, we introduce the concept of a (weak) minimizer of order k for a nonsmooth vector optimization problem over cones. Generalized classes of higher-order cone-nonsmooth (F, ρ)-convex functions are introduced and sufficient optimality results are proved involving these classes. Also, a unified dual is associated with the considered primal problem, and weak and strong duality results are established.
文摘This paper is concerned with the following variable-order fractional Laplacian equations , where N ≥ 1 and N > 2s(x,y) for (x,y) ∈ Ω × Ω, Ω is a bounded domain in R<sup>N</sup>, s(⋅) ∈ C (R<sup>N</sup> × R<sup>N</sup>, (0,1)), (-Δ)<sup>s(⋅)</sup> is the variable-order fractional Laplacian operator, λ, μ > 0 are two parameters, V: Ω → [0, ∞) is a continuous function, f ∈ C(Ω × R) and q ∈ C(Ω). Under some suitable conditions on f, we obtain two solutions for this problem by employing the mountain pass theorem and Ekeland’s variational principle. Our result generalizes the related ones in the literature.
基金Sponsored by the National Natural Science Foundation of China(Grant No.11461021)the Natural Science Basic Research Plan in Shaanxi Province of China(Grant No.2017JM1014)
文摘Two new versions of accelerated first-order methods for minimizing convex composite functions are proposed. In this paper, we first present an accelerated first-order method which chooses the step size 1/ Lk to be 1/ L0 at the beginning of each iteration and preserves the computational simplicity of the fast iterative shrinkage-thresholding algorithm. The first proposed algorithm is a non-monotone algorithm. To avoid this behavior, we present another accelerated monotone first-order method. The proposed two accelerated first-order methods are proved to have a better convergence rate for minimizing convex composite functions. Numerical results demonstrate the efficiency of the proposed two accelerated first-order methods.
基金the National Natural Science Foundation of China( 1 0 371 1 0 9)
文摘Let (X 1,X 2,...,X n) and (Y 1,Y 2,...,Y n) be real random vectors with the same marginal distributions,if (X 1,X 2,...,X n)≤ c(Y 1,Y 2,...,Y n), it is showed in this paper that ∑ n i=1 X i≤ cx ∑ n i=1 Y i and max 1≤k≤n ∑ k i=1 X i≤ icx max 1≤k≤n ∑ k i=1 Y i hold.Based on this fact,a more general comparison theorem is obtained.
文摘In this paper, we establish the second-order differential equation system with the feedback controls for solving the problem of convex programming. Using Lagrange function and projection operator, the equivalent operator equations for the convex programming problems under the certain conditions are obtained. Then a second-order differential equation system with the feedback controls is constructed on the basis of operator equation. We prove that any accumulation point of the trajectory of the second-order differential equation system with the feedback controls is a solution to the convex programming problem. In the end, two examples using this differential equation system are solved. The numerical results are reported to verify the effectiveness of the second-order differential equation system with the feedback controls for solving the convex programming problem.
基金Project (No. 2004AA420100) supported by the National Hi-TechResearch and Development Program (863) of China
文摘When the edges of a convex polygon are traversed along one direction,the interior of the convex polygon is always on the same side of the edges. Based on this characteristic of convex polygons,a new algorithm for computing the convex hull of a simple polygon is proposed in this paper,which is then extended to a new algorithm for computing the convex hull of a planar point set. First,the extreme points of the planar point set are found,and the subsets of point candidate for vertex of the convex hull between extreme points are obtained. Then,the ordered convex hull point sequences between extreme points are constructed separately and concatenated by removing redundant extreme points to get the convex hull. The time complexity of the new planar convex hull algorithm is O(nlogh) ,which is equal to the time complexity of the best output-sensitive planar convex hull algorithms. Compared with the algorithm having the same complexity,the new algorithm is much faster.
文摘The formulas of the lower orders of Dirichlet series are given by means of the exponents and the convex regularized sequences of the logarithms and the convex regularized sequences of the logarithms of the moduli of the coefficients. Corresponding results are obtained for some random Dirichlet series.
基金The project supported by the National Outstanding Youth Science Foundation of China the National Post Doctor Science Foundation of China
文摘In this paper, by means of combining non-probabilistic convex modeling with perturbation theory, an improvement is made on the first order approximate solution in convex models of uncertainties. Convex modeling is extended to largely uncertain and non-convex sets of uncertainties and the combinational convex modeling is developed. The presented method not only extends applications of convex modeling, but also improves its accuracy in uncertain problems and computational efficiency. The numerical example illustrates the efficiency of the proposed method.
文摘In this paper, maximal above and below pairs of fully ordered groups (o groups) are studied. It is shown that maximal above and below pairs of an divisible abelian o group have some specific properties, and by using these properties another embedding method of an abelian o group to real valued functions is discussed.
