Let E and F be Hilbert spaces with unit spheres S1(E) and S1(F). Suppose that V0 S1(E)→S1(F) is a Lipschitz mapping with Lipschitz constant k=1 such that -V0[S1(E)] V0[S1(E)]. Then V0 can be extended to a real linear...Let E and F be Hilbert spaces with unit spheres S1(E) and S1(F). Suppose that V0 S1(E)→S1(F) is a Lipschitz mapping with Lipschitz constant k=1 such that -V0[S1(E)] V0[S1(E)]. Then V0 can be extended to a real linear isometric mapping V from E into F. In particular, every isometric mapping from S1(E) onto S1(F) can be extended to a real linear isometric mapping from E onto F.展开更多
In this paper, we introduce the generalized R oper-Suffridge extension operator for locally biholomorphic mappings. It is sh own that this operator preserves the starlikeness on some Reinhardt domains and does not pre...In this paper, we introduce the generalized R oper-Suffridge extension operator for locally biholomorphic mappings. It is sh own that this operator preserves the starlikeness on some Reinhardt domains and does not preserve convexity for some cases. Meanwhile, the growth theorem and di stortion theorem of the corresponding mappings are given.展开更多
Convex optimization is a class of mathematical programming problems with polynomial complexity for which state-of-the-art, highly efficient numerical algorithms with predeterminable computational bounds exist. Computa...Convex optimization is a class of mathematical programming problems with polynomial complexity for which state-of-the-art, highly efficient numerical algorithms with predeterminable computational bounds exist. Computational efficiency and tractability in aerospace engineering, especially in guidance, navigation, and control (GN&C), are of paramount importance. With theoretical guarantees on solutions and computational efficiency, convex optimization lends itself as a very appealing tool. Coinciding the strong drive toward autonomous operations of aerospace vehicles, convex optimization has seen rapidly increasing utility in solving aerospace GN&C problems with the potential for onboard real-time applications. This paper attempts to provide an overview on the problems to date in aerospace guidance, path planning, and control where convex optimization has been applied. Various convexification techniques are reviewed that have been used to convexify the originally nonconvex aerospace problems. Discussions on how to ensure the validity of the convexification process are provided. Some related implementation issues will be introduced as well.展开更多
The construction of normalized biholomorphic convex mappings in the Reinhardt domain $D_p = \{ (z_1 ,z_2 , \cdots ,z_n ) \in \mathbb{C}^n :\left| {z_1 } \right|^{p_1 } + \left| {z_2 } \right|^{p_2 } + \cdots + \left| ...The construction of normalized biholomorphic convex mappings in the Reinhardt domain $D_p = \{ (z_1 ,z_2 , \cdots ,z_n ) \in \mathbb{C}^n :\left| {z_1 } \right|^{p_1 } + \left| {z_2 } \right|^{p_2 } + \cdots + \left| {z_n } \right|^{p_n } < 1\} $ , p j > 2, j = 1,2,?, n) of ? n is discussed. The authors set up a Decomposition Theorem for such mappings. As a special case, it is proved that, for each such mapping f, the first k-terms of the homogeneous expansion of its j-th component f j , j = 1, 2, ?, n, depends only on z j , where k is the number that satisfies k < min {p 1, p 2,?, p n ≤ k + 1. When p1,p2, ... ,pn → ∞ , this derives the Decomposition Theorem of normalized biholomorphic convex mappings in the polydisc which was gotten by T.J. Suffridge in 1970.展开更多
In this paper, we first derive the representation theorem of onto isometric mappings in the unit spheres of l p (Г) (@#@(p >) 1,p ≠ 2 type spaces, and then we conclude that such mappings can be extended to the wh...In this paper, we first derive the representation theorem of onto isometric mappings in the unit spheres of l p (Г) (@#@(p >) 1,p ≠ 2 type spaces, and then we conclude that such mappings can be extended to the whole space as real linear isometries by using the previous result of the author.展开更多
The alternating direction method of multipliers(ADMM)is a benchmark for solving convex programming problems with separable objective functions and linear constraints.In the literature it has been illustrated as an app...The alternating direction method of multipliers(ADMM)is a benchmark for solving convex programming problems with separable objective functions and linear constraints.In the literature it has been illustrated as an application of the proximal point algorithm(PPA)to the dual problem of the model under consideration.This paper shows that ADMM can also be regarded as an application of PPA to the primal model with a customized choice of the proximal parameter.This primal illustration of ADMM is thus complemental to its dual illustration in the literature.This PPA revisit on ADMM from the primal perspective also enables us to recover the generalized ADMM proposed by Eckstein and Bertsekas easily.A worst-case O(1/t)convergence rate in ergodic sense is established for a slight extension of Eckstein and Bertsekas’s generalized ADMM.展开更多
The paper proposes a novel approach for formationcontainment control based on a dynamic event-triggering mechanism for multi-agent systems.The leader-leader and follower-follower communications are reduced by utilizin...The paper proposes a novel approach for formationcontainment control based on a dynamic event-triggering mechanism for multi-agent systems.The leader-leader and follower-follower communications are reduced by utilizing the distributed dynamic event-triggered framework.We consider two separate sets of design parameters:one set comprising control and dynamic event-triggering parameters for the leaders and a second set similar to the first one with different values for the followers.The proposed algorithm includes two novel stages of codesign optimization to simultaneously compute the two sets of parameters.The design optimizations are convex and use the weighted sum approach to enable a structured trade-off between the formation-containment convergence rate and associated communications.Simulations based on non-holonomic mobile robot multi-agent systems quantify the effectiveness of the proposed approach.展开更多
In this paper,we give a reverse analog of the Bonnesen-style inequality of a convex domain in the surface X of constant curvature,that is,an isoperimetric deficit upper bound of the convex domain in X.The result is an...In this paper,we give a reverse analog of the Bonnesen-style inequality of a convex domain in the surface X of constant curvature,that is,an isoperimetric deficit upper bound of the convex domain in X.The result is an analogue of the known Bottema's result of 1933 in the Euclidean plane E2.展开更多
The purpose of this paper is to give a selective survey on recent progress in random metric theory and its applications to conditional risk measures.This paper includes eight sections.Section 1 is a longer introductio...The purpose of this paper is to give a selective survey on recent progress in random metric theory and its applications to conditional risk measures.This paper includes eight sections.Section 1 is a longer introduction,which gives a brief introduction to random metric theory,risk measures and conditional risk measures.Section 2 gives the central framework in random metric theory,topological structures,important examples,the notions of a random conjugate space and the Hahn-Banach theorems for random linear functionals.Section 3 gives several important representation theorems for random conjugate spaces.Section 4 gives characterizations for a complete random normed module to be random reflexive.Section 5 gives hyperplane separation theorems currently available in random locally convex modules.Section 6 gives the theory of random duality with respect to the locally L0-convex topology and in particular a characterization for a locally L0-convex module to be L0-pre-barreled.Section 7 gives some basic results on L0-convex analysis together with some applications to conditional risk measures.Finally,Section 8 is devoted to extensions of conditional convex risk measures,which shows that every representable L∞-type of conditional convex risk measure and every continuous Lp-type of convex conditional risk measure(1 ≤ p < +∞) can be extended to an L∞F(E)-type of σ,λ(L∞F(E),L1F(E))-lower semicontinuous conditional convex risk measure and an LpF(E)-type of T,λ-continuous conditional convex risk measure(1 ≤ p < +∞),respectively.展开更多
In terms of Caratheodory metric and Kobayashi metric, distortion theorems for biholomorphic convex mappings on bounded circular convex domains are given.
Some properties for convex cones are discussed, which are used to obtain an equivalent condition and another important property for nearly cone-subconvexlike set-valued functions. Under the nearly cone-subconvexlikene...Some properties for convex cones are discussed, which are used to obtain an equivalent condition and another important property for nearly cone-subconvexlike set-valued functions. Under the nearly cone-subconvexlikeness, some characterizations of the super efficiency are given in terms of scalarization and Lagrangian multipliers. Related results are generalized.展开更多
Some properties of convex cones are obtained and are used to derive several equivalent conditions as well as another important property for nearly cone-subconvexlike set-valued functions. Under the assumption of nearl...Some properties of convex cones are obtained and are used to derive several equivalent conditions as well as another important property for nearly cone-subconvexlike set-valued functions. Under the assumption of nearly cone-subconvexlikeness,a Lagrangian multiplier theorem on Benson proper efficiency is presented. Related results are generalized.展开更多
We first estimate the containment measure of a convex domain to contain in another in a surface X of constant curvature.Then we obtain the analogue of the known Bonnesen isoperimetric inequality for convex domain in X...We first estimate the containment measure of a convex domain to contain in another in a surface X of constant curvature.Then we obtain the analogue of the known Bonnesen isoperimetric inequality for convex domain in X.Finally we strengthen the known Bonnesen isoperimetric inequality.展开更多
In this article, we prove that the symmetric function Fn（x,r）=∑i1＋i2＋……in=r（x1（i1x2^i2……xn^in）1/r is Schur harmonic convex for x ∈ R＋n and r ∈N -=（1, 2, 3,...} As its applications, some analytic inequa...In this article, we prove that the symmetric function Fn（x,r）=∑i1＋i2＋……in=r（x1（i1x2^i2……xn^in）1/r is Schur harmonic convex for x ∈ R＋n and r ∈N -=（1, 2, 3,...} As its applications, some analytic inequalities are established.展开更多
The growth theorem and the 1/2 covering theorem are obtained for the class of normalized biholomorphic convex mappings on bounded convex circular domains, which extend the corresponding results of Sufridge, Thomas, Li...The growth theorem and the 1/2 covering theorem are obtained for the class of normalized biholomorphic convex mappings on bounded convex circular domains, which extend the corresponding results of Sufridge, Thomas, Liu, Gong, Yu, and Wang. The approach is new, which does not appeal to the automorphisms of the domains; and the domains discussed are rather general on which convex mappings can be studied, since the domain may not have a convex mapping if it is not convex.展开更多
Detection of wood plate surface defects using image processing is a complicated problem in the forest industry as the image of the wood surface contains different kinds of defects. In order to obtain complete defect i...Detection of wood plate surface defects using image processing is a complicated problem in the forest industry as the image of the wood surface contains different kinds of defects. In order to obtain complete defect images, we used convex optimization(CO) with different weights as a pretreatment method for smoothing and the Otsu segmentation method to obtain the target defect area images. Structural similarity(SSIM) results between original image and defect image were calculated to evaluate the performance of segmentation with different convex optimization weights. The geometric and intensity features of defects were extracted before constructing a classification and regression tree(CART) classifier. The average accuracy of the classifier is 94.1% with four types of defects on Xylosma congestum wood plate surface: pinhole, crack,live knot and dead knot. Experimental results showed that CO can save the edge of target defects maximally, SSIM can select the appropriate weight for CO, and the CART classifier appears to have the advantages of good adaptability and high classification accuracy.展开更多
The problems of robust I2-I∞ and H∞ filtering for discrete-time systems with parameter uncertainty residing in a polytope are investigated in this paper. The filtering strategies are based on new robust performance ...The problems of robust I2-I∞ and H∞ filtering for discrete-time systems with parameter uncertainty residing in a polytope are investigated in this paper. The filtering strategies are based on new robust performance criteria derived from a new result of parameter-dependent Lyapunov stability condition, which exhibit less conservativeness than previous results in the quadratic framework. The designed filters guaranteeing a prescribed I2-I∞ or H∞ noise attenuation level can be obtained from the solution of convex optimization problems, which can be solved via efficient interior point methods. Numerical examples have shown that the filter design procedures proposed in this paper are much less conservative than earlier results.展开更多
In this paper we discuss a relatively general kind of iterative functional equation G(x,f(x), ...,f n (x)) = 0 (for allx ∈J), whereJ is a connected closed subset of the real number axis ?,G∈C m (J n+1, ?) andn ≥ 2....In this paper we discuss a relatively general kind of iterative functional equation G(x,f(x), ...,f n (x)) = 0 (for allx ∈J), whereJ is a connected closed subset of the real number axis ?,G∈C m (J n+1, ?) andn ≥ 2. Using the method of approximating fixed points by small shift of maps, choosing suitable metrics on functional spaces and finding a relation between uniqueness and stability of fixed points of maps of general spaces, we prove the existence, uniqueness and stability ofCm solutions of the above equation for any integer m ≥ 0 under relatively weak conditions, and generalize related results in reference in different aspects.展开更多
基金This work was supported by the National Natural Science Foundation of China (Grant No. 19971046).
文摘Let E and F be Hilbert spaces with unit spheres S1(E) and S1(F). Suppose that V0 S1(E)→S1(F) is a Lipschitz mapping with Lipschitz constant k=1 such that -V0[S1(E)] V0[S1(E)]. Then V0 can be extended to a real linear isometric mapping V from E into F. In particular, every isometric mapping from S1(E) onto S1(F) can be extended to a real linear isometric mapping from E onto F.
文摘In this paper, we introduce the generalized R oper-Suffridge extension operator for locally biholomorphic mappings. It is sh own that this operator preserves the starlikeness on some Reinhardt domains and does not preserve convexity for some cases. Meanwhile, the growth theorem and di stortion theorem of the corresponding mappings are given.
基金the National Natural Science Foundation of China(Grant No.61603017).
文摘Convex optimization is a class of mathematical programming problems with polynomial complexity for which state-of-the-art, highly efficient numerical algorithms with predeterminable computational bounds exist. Computational efficiency and tractability in aerospace engineering, especially in guidance, navigation, and control (GN&C), are of paramount importance. With theoretical guarantees on solutions and computational efficiency, convex optimization lends itself as a very appealing tool. Coinciding the strong drive toward autonomous operations of aerospace vehicles, convex optimization has seen rapidly increasing utility in solving aerospace GN&C problems with the potential for onboard real-time applications. This paper attempts to provide an overview on the problems to date in aerospace guidance, path planning, and control where convex optimization has been applied. Various convexification techniques are reviewed that have been used to convexify the originally nonconvex aerospace problems. Discussions on how to ensure the validity of the convexification process are provided. Some related implementation issues will be introduced as well.
基金This work was supported by 973 Project, the National Natural Science Foundation of China (Grant No. 19871081) the Natural Science Foundation of Guangdong Province and Anhui Province.
文摘The construction of normalized biholomorphic convex mappings in the Reinhardt domain $D_p = \{ (z_1 ,z_2 , \cdots ,z_n ) \in \mathbb{C}^n :\left| {z_1 } \right|^{p_1 } + \left| {z_2 } \right|^{p_2 } + \cdots + \left| {z_n } \right|^{p_n } < 1\} $ , p j > 2, j = 1,2,?, n) of ? n is discussed. The authors set up a Decomposition Theorem for such mappings. As a special case, it is proved that, for each such mapping f, the first k-terms of the homogeneous expansion of its j-th component f j , j = 1, 2, ?, n, depends only on z j , where k is the number that satisfies k < min {p 1, p 2,?, p n ≤ k + 1. When p1,p2, ... ,pn → ∞ , this derives the Decomposition Theorem of normalized biholomorphic convex mappings in the polydisc which was gotten by T.J. Suffridge in 1970.
基金This work was supported by the National Natural Science Foundation of China(Grant No.10271060) the Doctoral Programme Foundation of Ministry of Education of China(No.2001005513).
文摘In this paper, we first derive the representation theorem of onto isometric mappings in the unit spheres of l p (Г) (@#@(p >) 1,p ≠ 2 type spaces, and then we conclude that such mappings can be extended to the whole space as real linear isometries by using the previous result of the author.
基金supported by National Natural Science Foundation of China(Grant Nos.11001124 and 91130007)the Doctoral Fund of Ministry of Eduction of China(Grant No.20110091110004)the General Research Fund from Hong Kong Research Grants Council(Grant No.HKBU 203712)
文摘The alternating direction method of multipliers(ADMM)is a benchmark for solving convex programming problems with separable objective functions and linear constraints.In the literature it has been illustrated as an application of the proximal point algorithm(PPA)to the dual problem of the model under consideration.This paper shows that ADMM can also be regarded as an application of PPA to the primal model with a customized choice of the proximal parameter.This primal illustration of ADMM is thus complemental to its dual illustration in the literature.This PPA revisit on ADMM from the primal perspective also enables us to recover the generalized ADMM proposed by Eckstein and Bertsekas easily.A worst-case O(1/t)convergence rate in ergodic sense is established for a slight extension of Eckstein and Bertsekas’s generalized ADMM.
基金partially supported by the Natural Sciencesand Engineering Research Council(NSERC)of Canada through the NSERC Discovery(RGPIN-2016-04988)。
文摘The paper proposes a novel approach for formationcontainment control based on a dynamic event-triggering mechanism for multi-agent systems.The leader-leader and follower-follower communications are reduced by utilizing the distributed dynamic event-triggered framework.We consider two separate sets of design parameters:one set comprising control and dynamic event-triggering parameters for the leaders and a second set similar to the first one with different values for the followers.The proposed algorithm includes two novel stages of codesign optimization to simultaneously compute the two sets of parameters.The design optimizations are convex and use the weighted sum approach to enable a structured trade-off between the formation-containment convergence rate and associated communications.Simulations based on non-holonomic mobile robot multi-agent systems quantify the effectiveness of the proposed approach.
基金supported in part by National Natural Science Foundation of China (Grant No.10971167)
文摘In this paper,we give a reverse analog of the Bonnesen-style inequality of a convex domain in the surface X of constant curvature,that is,an isoperimetric deficit upper bound of the convex domain in X.The result is an analogue of the known Bottema's result of 1933 in the Euclidean plane E2.
基金supported by National Natural Science Foundation of China (Grant No.10871016)
文摘The purpose of this paper is to give a selective survey on recent progress in random metric theory and its applications to conditional risk measures.This paper includes eight sections.Section 1 is a longer introduction,which gives a brief introduction to random metric theory,risk measures and conditional risk measures.Section 2 gives the central framework in random metric theory,topological structures,important examples,the notions of a random conjugate space and the Hahn-Banach theorems for random linear functionals.Section 3 gives several important representation theorems for random conjugate spaces.Section 4 gives characterizations for a complete random normed module to be random reflexive.Section 5 gives hyperplane separation theorems currently available in random locally convex modules.Section 6 gives the theory of random duality with respect to the locally L0-convex topology and in particular a characterization for a locally L0-convex module to be L0-pre-barreled.Section 7 gives some basic results on L0-convex analysis together with some applications to conditional risk measures.Finally,Section 8 is devoted to extensions of conditional convex risk measures,which shows that every representable L∞-type of conditional convex risk measure and every continuous Lp-type of convex conditional risk measure(1 ≤ p < +∞) can be extended to an L∞F(E)-type of σ,λ(L∞F(E),L1F(E))-lower semicontinuous conditional convex risk measure and an LpF(E)-type of T,λ-continuous conditional convex risk measure(1 ≤ p < +∞),respectively.
文摘In terms of Caratheodory metric and Kobayashi metric, distortion theorems for biholomorphic convex mappings on bounded circular convex domains are given.
文摘Some properties for convex cones are discussed, which are used to obtain an equivalent condition and another important property for nearly cone-subconvexlike set-valued functions. Under the nearly cone-subconvexlikeness, some characterizations of the super efficiency are given in terms of scalarization and Lagrangian multipliers. Related results are generalized.
文摘Some properties of convex cones are obtained and are used to derive several equivalent conditions as well as another important property for nearly cone-subconvexlike set-valued functions. Under the assumption of nearly cone-subconvexlikeness,a Lagrangian multiplier theorem on Benson proper efficiency is presented. Related results are generalized.
基金supported by National Natural Science Foundation of China (Grant No. 10971167)
文摘We first estimate the containment measure of a convex domain to contain in another in a surface X of constant curvature.Then we obtain the analogue of the known Bonnesen isoperimetric inequality for convex domain in X.Finally we strengthen the known Bonnesen isoperimetric inequality.
基金supported by NSFC (60850005)NSF of Zhejiang Province(D7080080, Y7080185, Y607128)
文摘In this article, we prove that the symmetric function Fn（x,r）=∑i1＋i2＋……in=r（x1（i1x2^i2……xn^in）1/r is Schur harmonic convex for x ∈ R＋n and r ∈N -=（1, 2, 3,...} As its applications, some analytic inequalities are established.
文摘The growth theorem and the 1/2 covering theorem are obtained for the class of normalized biholomorphic convex mappings on bounded convex circular domains, which extend the corresponding results of Sufridge, Thomas, Liu, Gong, Yu, and Wang. The approach is new, which does not appeal to the automorphisms of the domains; and the domains discussed are rather general on which convex mappings can be studied, since the domain may not have a convex mapping if it is not convex.
基金supported by the Fund of Forestry 948project(2015-4-52)the Fundamental Research Funds for the Central Universities(2572017DB05)the Natural Science Foundation of Heilongjiang Province(C2017005)
文摘Detection of wood plate surface defects using image processing is a complicated problem in the forest industry as the image of the wood surface contains different kinds of defects. In order to obtain complete defect images, we used convex optimization(CO) with different weights as a pretreatment method for smoothing and the Otsu segmentation method to obtain the target defect area images. Structural similarity(SSIM) results between original image and defect image were calculated to evaluate the performance of segmentation with different convex optimization weights. The geometric and intensity features of defects were extracted before constructing a classification and regression tree(CART) classifier. The average accuracy of the classifier is 94.1% with four types of defects on Xylosma congestum wood plate surface: pinhole, crack,live knot and dead knot. Experimental results showed that CO can save the edge of target defects maximally, SSIM can select the appropriate weight for CO, and the CART classifier appears to have the advantages of good adaptability and high classification accuracy.
基金supported by the National Natural Science Foundation of China(Grant No.69874008).
文摘The problems of robust I2-I∞ and H∞ filtering for discrete-time systems with parameter uncertainty residing in a polytope are investigated in this paper. The filtering strategies are based on new robust performance criteria derived from a new result of parameter-dependent Lyapunov stability condition, which exhibit less conservativeness than previous results in the quadratic framework. The designed filters guaranteeing a prescribed I2-I∞ or H∞ noise attenuation level can be obtained from the solution of convex optimization problems, which can be solved via efficient interior point methods. Numerical examples have shown that the filter design procedures proposed in this paper are much less conservative than earlier results.
文摘In this paper we discuss a relatively general kind of iterative functional equation G(x,f(x), ...,f n (x)) = 0 (for allx ∈J), whereJ is a connected closed subset of the real number axis ?,G∈C m (J n+1, ?) andn ≥ 2. Using the method of approximating fixed points by small shift of maps, choosing suitable metrics on functional spaces and finding a relation between uniqueness and stability of fixed points of maps of general spaces, we prove the existence, uniqueness and stability ofCm solutions of the above equation for any integer m ≥ 0 under relatively weak conditions, and generalize related results in reference in different aspects.
