This paper presents a new method, called the "aggregate function" method, for solvingnonlinear programming problems. At first, we use the "maximum" constraint in place of theoriginal constraint set...This paper presents a new method, called the "aggregate function" method, for solvingnonlinear programming problems. At first, we use the "maximum" constraint in place of theoriginal constraint set to convert a multi-constrained optimization problem to a non-smoothbut singly constrained problem; we then employ the surrogate constraint concept and themaximum entropy principle to derive a smooth function, by which the non-smooth maximumconstraint is approximated and the original problem is converted to a smooth and singly con-strained problem; furthermore, we develop a multiplier penalty algorithm. The presentalgorithm has merits of stable and fast convergence and ease of computer implementation,and is particularly suitable to solving a nonlinear programming problem with a large num-ber of constraints.展开更多
In this paper, we characterize the pointwise multiplier space M(D_τ, D_μ) of Dirichlet type spaces in the unit ball of C^n for the values of τ, μ in three cases: (i)τ【0, μ【0, (ii)τ【μ, (iii) τ≥μ,τ】n. an...In this paper, we characterize the pointwise multiplier space M(D_τ, D_μ) of Dirichlet type spaces in the unit ball of C^n for the values of τ, μ in three cases: (i)τ【0, μ【0, (ii)τ【μ, (iii) τ≥μ,τ】n. and construct two functions to show that M(D_τ)D_τ properly if τ≤n and M(D_τ)M(D_μ) properly if τ】μ and τ】n-1.展开更多
By utilizing the time difference of arrival （TDOA） and frequency difference of arrival （FDOA） measurements of signals received at a number of receivers, a constrained least-square （CLS） algorithm for estimating ...By utilizing the time difference of arrival （TDOA） and frequency difference of arrival （FDOA） measurements of signals received at a number of receivers, a constrained least-square （CLS） algorithm for estimating the position and velocity of a moving source is proposed. By utilizing the Lagrange multipliers technique, the known relation between the intermediate variables and the source location coordinates could be exploited to constrain the solution. And without requiring apriori knowledge of TDOA and FDOA measurement noises, the proposed algorithm can satisfy the demand of practical applications. Additionally, on basis of con- volute and polynomial rooting operations, the Lagrange multipliers can be obtained efficiently and robustly allowing real-time imple- mentation and global convergence. Simulation results show that the proposed estimator achieves remarkably better performance than the two-step weighted least square （WLS） approach especially for higher measurement noise level.展开更多
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.展开更多
In this paper, the authors first establish the connections between the Herz-type Triebel-Lizorkin spaces and the well-known Herz-type spaces; the authors then study the pointwise multipliers for the Herz-type Triebel-...In this paper, the authors first establish the connections between the Herz-type Triebel-Lizorkin spaces and the well-known Herz-type spaces; the authors then study the pointwise multipliers for the Herz-type Triebel-Lizorkin spaces and show that pseudo-differential operators are bounded on these spaces by using pointwise multipliers.展开更多
Let￠ ： Nn x [0,∞） -4 [0, ∞） be a function such that ￠（x,.） is an Orlicz function and ￠（.,t） ∈ Aloc∞（Nn） （the class of local weights introduced by Rychkov）. In this paper, the authors introduce a loca...Let￠ ： Nn x [0,∞） -4 [0, ∞） be a function such that ￠（x,.） is an Orlicz function and ￠（.,t） ∈ Aloc∞（Nn） （the class of local weights introduced by Rychkov）. In this paper, the authors introduce a local Musielak-Orlicz Hardy space h￠（Nn） by the local grand maximal function, and a local BMO-type space bmo￠（Nn） which is further proved to be the dual space of h￠（Nn）. As an application, the authors prove that the class of pointwise multipliers for the local BMO-type space bmo￠（Nn）, characterized by Nakai and Yabuta, is just the dual of LI（Rn） ＋ hФ0 （Rn）, where Ф is an increasing function on （0, co） satisfying some additional growth conditions and Ф0 a Musielak-Orlicz function induced by Ф. Characterizations of h￠（Rn）, including the atoms, the local vertical and the local nontangential maximal functions, are presented. Using the atomic char- acterization, the authors prove the existence of finite atomic decompositions achieving the norm in some dense subspaces of h￠（Rn）, from which, the authors further deduce some criterions for the boundedness on h￠（Rn） of some sublinear operators. Finally, the authors show that the local Riesz transforms and some pseudo-differential operators are bounded on h￠（Rn）.展开更多
基金Project supported by the National Natural Science Foundation of China.
文摘This paper presents a new method, called the "aggregate function" method, for solvingnonlinear programming problems. At first, we use the "maximum" constraint in place of theoriginal constraint set to convert a multi-constrained optimization problem to a non-smoothbut singly constrained problem; we then employ the surrogate constraint concept and themaximum entropy principle to derive a smooth function, by which the non-smooth maximumconstraint is approximated and the original problem is converted to a smooth and singly con-strained problem; furthermore, we develop a multiplier penalty algorithm. The presentalgorithm has merits of stable and fast convergence and ease of computer implementation,and is particularly suitable to solving a nonlinear programming problem with a large num-ber of constraints.
基金Supported by the National Natural Science Foundation of Chinathe National Education Committee Doctoral Foundation of China
文摘In this paper, we characterize the pointwise multiplier space M(D_τ, D_μ) of Dirichlet type spaces in the unit ball of C^n for the values of τ, μ in three cases: (i)τ【0, μ【0, (ii)τ【μ, (iii) τ≥μ,τ】n. and construct two functions to show that M(D_τ)D_τ properly if τ≤n and M(D_τ)M(D_μ) properly if τ】μ and τ】n-1.
基金supported by the National High Technology Research and Development Program of China (863 Program) (2010AA7010422 2011AA7014061)
文摘By utilizing the time difference of arrival （TDOA） and frequency difference of arrival （FDOA） measurements of signals received at a number of receivers, a constrained least-square （CLS） algorithm for estimating the position and velocity of a moving source is proposed. By utilizing the Lagrange multipliers technique, the known relation between the intermediate variables and the source location coordinates could be exploited to constrain the solution. And without requiring apriori knowledge of TDOA and FDOA measurement noises, the proposed algorithm can satisfy the demand of practical applications. Additionally, on basis of con- volute and polynomial rooting operations, the Lagrange multipliers can be obtained efficiently and robustly allowing real-time imple- mentation and global convergence. Simulation results show that the proposed estimator achieves remarkably better performance than the two-step weighted least square （WLS） approach especially for higher measurement noise level.
基金Research partially supported by the Education Department Foundation of Hunan Province(No.04C328)and the NSF of Zhejiang Province(No.M103104) Research partially supported by the NSF of Zhejiang Province(No.Y604569)and the STF of Education Department of China(No.204063).
文摘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.
基金Xu Jingshi was partially supported by NSF of Hunan in ChinaYang DaChun was partially supported by NNSF(10271015)and SEDF of China
文摘In this paper, the authors first establish the connections between the Herz-type Triebel-Lizorkin spaces and the well-known Herz-type spaces; the authors then study the pointwise multipliers for the Herz-type Triebel-Lizorkin spaces and show that pseudo-differential operators are bounded on these spaces by using pointwise multipliers.
基金supported by National Natural Science Foundation of China(Grant No.11171027)Program for Changjiang Scholars and Innovative Research Team in University of China
文摘Let￠ ： Nn x [0,∞） -4 [0, ∞） be a function such that ￠（x,.） is an Orlicz function and ￠（.,t） ∈ Aloc∞（Nn） （the class of local weights introduced by Rychkov）. In this paper, the authors introduce a local Musielak-Orlicz Hardy space h￠（Nn） by the local grand maximal function, and a local BMO-type space bmo￠（Nn） which is further proved to be the dual space of h￠（Nn）. As an application, the authors prove that the class of pointwise multipliers for the local BMO-type space bmo￠（Nn）, characterized by Nakai and Yabuta, is just the dual of LI（Rn） ＋ hФ0 （Rn）, where Ф is an increasing function on （0, co） satisfying some additional growth conditions and Ф0 a Musielak-Orlicz function induced by Ф. Characterizations of h￠（Rn）, including the atoms, the local vertical and the local nontangential maximal functions, are presented. Using the atomic char- acterization, the authors prove the existence of finite atomic decompositions achieving the norm in some dense subspaces of h￠（Rn）, from which, the authors further deduce some criterions for the boundedness on h￠（Rn） of some sublinear operators. Finally, the authors show that the local Riesz transforms and some pseudo-differential operators are bounded on h￠（Rn）.
