The authors prove that all n-th completely bounded cohomology groups of a nest algebra T(N) acting on a separable Hilbert space are trivial when the coefficients lie in any ultraweakly closed T(N)-bimodule contain...The authors prove that all n-th completely bounded cohomology groups of a nest algebra T(N) acting on a separable Hilbert space are trivial when the coefficients lie in any ultraweakly closed T(N)-bimodule containing the nest algebra. They also prove that Hcb^n(A, M) ≌ Hcb^n(A, M) for all n ≥ 1 and a CSL algebra .A with an ultraweakly closed .A-bimodul.M containing A.展开更多
This paper considers the formation control problem of multi-agent systems in a distributed fashion. Two cases of the information propagating topologies among multiple agents, characterized by graphics model, are consi...This paper considers the formation control problem of multi-agent systems in a distributed fashion. Two cases of the information propagating topologies among multiple agents, characterized by graphics model, are considered. One is fixed topology. The other is switching topology which represents the limited and less reliable information exchange. The local formation control strategies established in this paper are based on a simple modification of the existing consensus control strategies. Moreover, some existing convergence conditions are shown to be a special case of our model even in the continuous-time consensus case. Therefore, the results of this paper extend the existing results about the consensus problem.展开更多
The augmented Lagrangian function and the corresponding augmented Lagrangian method are constructed for solving a class of minimax optimization problems with equality constraints.We prove that,under the linear indepen...The augmented Lagrangian function and the corresponding augmented Lagrangian method are constructed for solving a class of minimax optimization problems with equality constraints.We prove that,under the linear independence constraint qualification and the second-order sufficiency optimality condition for the lower level problem and the second-order sufficiency optimality condition for the minimax problem,for a given multiplier vectorμ,the rate of convergence of the augmented Lagrangian method is linear with respect to||μu-μ^(*)||and the ratio constant is proportional to 1/c when the ratio|μ-μ^(*)||/c is small enough,where c is the penalty parameter that exceeds a threshold c_(*)>O andμ^(*)is the multiplier corresponding to a local minimizer.Moreover,we prove that the sequence of multiplier vectors generated by the augmented Lagrangian method has at least Q-linear convergence if the sequence of penalty parameters(ck)is bounded and the convergence rate is superlinear if(ck)is increasing to infinity.Finally,we use a direct way to establish the rate of convergence of the augmented Lagrangian method for the minimax problem with a quadratic objective function and linear equality constraints.展开更多
In this paper, by using a new projection, we construct a variant of Zhang’s algorithm and prove its convergence. Specially, the variant of Zhang’s algorithm has quadratic termination and superlinear convergence rale...In this paper, by using a new projection, we construct a variant of Zhang’s algorithm and prove its convergence. Specially, the variant of Zhang’s algorithm has quadratic termination and superlinear convergence rale under certain conditions. Zhang’s algorithm hasn’t these properties.展开更多
In this paper, a regularization Newton method for mixed complementarity problem(MCP) based on the reformulation of MCP in [1] is proposed. Its global convergence is proved under the assumption that F is a P0-function....In this paper, a regularization Newton method for mixed complementarity problem(MCP) based on the reformulation of MCP in [1] is proposed. Its global convergence is proved under the assumption that F is a P0-function. The main feature of our algorithm is that a priori of the existence of an accumulation point for convergence need not to be assumed.展开更多
Order unit normed linear spaces are a special type of regularly ordered normed linear spaces and therefore the first section is a short collection of the fundamental results on this type of normed linear spaces. The c...Order unit normed linear spaces are a special type of regularly ordered normed linear spaces and therefore the first section is a short collection of the fundamental results on this type of normed linear spaces. The connection between order unit normed linear spaces and base normed linear spaces within the category of regularly ordered normed linear spaces is described in Section 2, and Section 3 at last, contains the results on Banach limits in an arbitrary order unit normed linear space. It is shown that the original results on Banach limits are valid for a greater range.展开更多
This paper aims to present a fairly accessible generalization of several symmetric Gauss-Seidel decomposition based multi-block proximal alt ernating direction met hods of multipliers(ADMMs)for convex composite optimi...This paper aims to present a fairly accessible generalization of several symmetric Gauss-Seidel decomposition based multi-block proximal alt ernating direction met hods of multipliers(ADMMs)for convex composite optimization problems.The proposed method unifies and refines many constructive techniques that were separately developed for the computational efficiency of multi-block ADMM-type algor计hms.Specifically,the majorized augmented Lagrangian functions,the indefinite proximal terms,the inexact symmetrie Gauss-Seidel decomposition theorem,the tolerance criteria of approximately solving the subproblems,and the large dual step-lengths,are all incorporated in one algoi?计hmic framework,which we named as sGS-imiPADMM.From the popularity of convergent variants of multi-block ADMMs in recent years,especially for high-dimensional multi-block convex composite conic programming problems,the unification presen ted in this paper,as well as the corresponding convergence results,may have the great potential of facilitating the implemen tation of many multi-block ADMMs in various problem set tings.展开更多
Government macro-control through various policies is an important way to mitigate air pollution and greenhouse gases.Therefore,environmental tax is used worldwide as an important measure.However,few studies have consi...Government macro-control through various policies is an important way to mitigate air pollution and greenhouse gases.Therefore,environmental tax is used worldwide as an important measure.However,few studies have considered the interaction between carbon and environmental protection taxes.Additionally,different sectors differ in their energy structure,pollution emission intensity,and economic status,and previous studies rarely proposed differentiated environmental tax rates based at the sectoral level.A model framework combining the computable general equilibrium(CGE)model and Bayesian optimization(BO)algorithm is proposed to maximize GDP,meet environmental planning objectives,and explore the optimal environmental taxation scheme to realize the multi-objective optimization of the economy and environment.Meanwhile,this study compares the different impact mechanisms of environmental protection tax and carbon tax.It discusses the impacts of differentiated environmental tax rates in different sectors on the environment and economy.For example,the results show that the coordinated implementation of environmental protection and carbon tax policies and the sectoral differentiated environmental tax rates in China could better balance economic development and environmental governance.Additionally,the optimal taxation scheme could mitigate air pollution and greenhouse gases,promote economic growth,and realize sustainable economic and environmental development.Furthermore,the optimized taxation scheme positively affects the energy and industrial structures.展开更多
R. T. Rockafellar built a new general convex dual theory by introducing the conjugate function and the perturbation function. Following him, many other authors obtained some important results in generalized convex dua...R. T. Rockafellar built a new general convex dual theory by introducing the conjugate function and the perturbation function. Following him, many other authors obtained some important results in generalized convex dual programs and展开更多
在这篇论文,作者建议奶妈元的一个班(abbr。DY ) 在一般功能上面对不安与线搜索结合坡度方法;一致地凸的功能分别地。在主要方向 s k 被 DY 获得的地方,他们的 iterate 公式是 x k+1 = x k + α k (s k + ω k ) 结合坡度方法,ω k...在这篇论文,作者建议奶妈元的一个班(abbr。DY ) 在一般功能上面对不安与线搜索结合坡度方法;一致地凸的功能分别地。在主要方向 s k 被 DY 获得的地方,他们的 iterate 公式是 x k+1 = x k + α k (s k + ω k ) 结合坡度方法,ω k 是不安术语,;步尺寸α k 被不必然在限制趋于到零的线搜索决定。作者在温和条件下面证明这些方法的全球集中。初步的计算经验也被报导。展开更多
In this paper, we study the directional derivative, subderivative, and subdifferential of sup-type functions without any compactness assumption on the index set. As applications, we provide an estimate of the Lipschit...In this paper, we study the directional derivative, subderivative, and subdifferential of sup-type functions without any compactness assumption on the index set. As applications, we provide an estimate of the Lipschitz modulus for sup-type functions.展开更多
为非强迫的优化,一个新混合设计算法在纸被介绍。这个算法有一些吸引人的集中性质。Convergencetheory 能在▽ f (x) 是一致地连续的条件下面被获得。如果▽ f (x) 是连续地可辨的伪 convex,整个顺序重申没有任何另外的假设,收敛到...为非强迫的优化,一个新混合设计算法在纸被介绍。这个算法有一些吸引人的集中性质。Convergencetheory 能在▽ f (x) 是一致地连续的条件下面被获得。如果▽ f (x) 是连续地可辨的伪 convex,整个顺序重申没有任何另外的假设,收敛到这个问题的一个答案。而且,在适当条件下面,一个人证明顺序重申有一个簇点如果并且仅当Ω ~* ≠ 0。数字例子在这篇论文的结束被给。展开更多
In this paper,we consider a cone problem of matrix optimization induced by spectral norm(MOSN).By Schur complement,MOSN can be reformulated as a nonlinear semidefinite programming(NLSDP)problem.Then we discuss the con...In this paper,we consider a cone problem of matrix optimization induced by spectral norm(MOSN).By Schur complement,MOSN can be reformulated as a nonlinear semidefinite programming(NLSDP)problem.Then we discuss the constraint nondegeneracy conditions and strong second-order sufficient conditions of MOSN and its SDP reformulation,and obtain that the constraint nondegeneracy condition of MOSN is not always equivalent to that of NLSDP.However,the strong second-order sufficient conditions of these two problems are equivalent without any assumption.Finally,a sufficient condition is given to ensure the nonsingularity of the Clarke’s generalized Jacobian of the KKT system for MOSN.展开更多
This paper gives a dynamic concept and a new non-parametric method for evaluating returns to scale(RTS) of economic units with multiple inputs and outputs.It is frequently noticed that when we increase the input of ...This paper gives a dynamic concept and a new non-parametric method for evaluating returns to scale(RTS) of economic units with multiple inputs and outputs.It is frequently noticed that when we increase the input of a decision making unit(DMU) with a certain status of RTS,different status of RTS is observed.For example,when we increase the input of a DMU with constant RTS under the traditional method,a decreasing RTS is often observed instead of the expected constant RTS.We thus define the RTS of each DMU in both input expansion and contraction regions respectively.The research starts from transferring the production possibility set into the intersection form,by giving the explicit linear inequality representation of production frontiers.The RTS structural characteristics of DMUs' on the production frontier are described.Status of RTS of those DMUs on the production frontier include increasing RTS,constant RTS,decreasing RTS,saturated RTS and evidence of congestion.Necessary and suficient conditions for RTS evaluation are provided.The definition and evaluation method given here provide more detailed economic characteristics of DMU for policy makers.展开更多
Data with large dimensions will bring various problems to the application of data envelopment analysis(DEA).In this study,we focus on a“big data”problem related to the considerably large dimensions of the input-outp...Data with large dimensions will bring various problems to the application of data envelopment analysis(DEA).In this study,we focus on a“big data”problem related to the considerably large dimensions of the input-output data.The four most widely used approaches to guide dimension reduction in DEA are compared via Monte Carlo simulation,including principal component analysis(PCA-DEA),which is based on the idea of aggregating input and output,efficiency contribution measurement(ECM),average efficiency measure(AEC),and regression-based detection(RB),which is based on the idea of variable selection.We compare the performance of these methods under different scenarios and a brand-new comparison benchmark for the simulation test.In addition,we discuss the effect of initial variable selection in RB for the first time.Based on the results,we offer guidelines that are more reliable on how to choose an appropriate method.展开更多
基金Supported partially by NSF of China (10201007)National Tianyuan Foundation of China (A0324614)
文摘The authors prove that all n-th completely bounded cohomology groups of a nest algebra T(N) acting on a separable Hilbert space are trivial when the coefficients lie in any ultraweakly closed T(N)-bimodule containing the nest algebra. They also prove that Hcb^n(A, M) ≌ Hcb^n(A, M) for all n ≥ 1 and a CSL algebra .A with an ultraweakly closed .A-bimodul.M containing A.
基金the National Natural Science Foundation of China (No.60674071).
文摘This paper considers the formation control problem of multi-agent systems in a distributed fashion. Two cases of the information propagating topologies among multiple agents, characterized by graphics model, are considered. One is fixed topology. The other is switching topology which represents the limited and less reliable information exchange. The local formation control strategies established in this paper are based on a simple modification of the existing consensus control strategies. Moreover, some existing convergence conditions are shown to be a special case of our model even in the continuous-time consensus case. Therefore, the results of this paper extend the existing results about the consensus problem.
基金the National Natural Science Foundation of China(Nos.11991020,11631013,11971372,11991021,11971089 and 11731013)the Strategic Priority Research Program of Chinese Academy of Sciences(No.XDA27000000)Dalian High-Level Talent Innovation Project(No.2020RD09)。
文摘The augmented Lagrangian function and the corresponding augmented Lagrangian method are constructed for solving a class of minimax optimization problems with equality constraints.We prove that,under the linear independence constraint qualification and the second-order sufficiency optimality condition for the lower level problem and the second-order sufficiency optimality condition for the minimax problem,for a given multiplier vectorμ,the rate of convergence of the augmented Lagrangian method is linear with respect to||μu-μ^(*)||and the ratio constant is proportional to 1/c when the ratio|μ-μ^(*)||/c is small enough,where c is the penalty parameter that exceeds a threshold c_(*)>O andμ^(*)is the multiplier corresponding to a local minimizer.Moreover,we prove that the sequence of multiplier vectors generated by the augmented Lagrangian method has at least Q-linear convergence if the sequence of penalty parameters(ck)is bounded and the convergence rate is superlinear if(ck)is increasing to infinity.Finally,we use a direct way to establish the rate of convergence of the augmented Lagrangian method for the minimax problem with a quadratic objective function and linear equality constraints.
基金The subject is supported by Natural Science Foundation of China and Natural Science Foundation of Shandong Province.
文摘In this paper, by using a new projection, we construct a variant of Zhang’s algorithm and prove its convergence. Specially, the variant of Zhang’s algorithm has quadratic termination and superlinear convergence rale under certain conditions. Zhang’s algorithm hasn’t these properties.
基金This subject is supported by the NSF of China (10171055,10226022) NSF of Shandong province(Y2003A02)
文摘In this paper, a regularization Newton method for mixed complementarity problem(MCP) based on the reformulation of MCP in [1] is proposed. Its global convergence is proved under the assumption that F is a P0-function. The main feature of our algorithm is that a priori of the existence of an accumulation point for convergence need not to be assumed.
文摘Order unit normed linear spaces are a special type of regularly ordered normed linear spaces and therefore the first section is a short collection of the fundamental results on this type of normed linear spaces. The connection between order unit normed linear spaces and base normed linear spaces within the category of regularly ordered normed linear spaces is described in Section 2, and Section 3 at last, contains the results on Banach limits in an arbitrary order unit normed linear space. It is shown that the original results on Banach limits are valid for a greater range.
文摘This paper aims to present a fairly accessible generalization of several symmetric Gauss-Seidel decomposition based multi-block proximal alt ernating direction met hods of multipliers(ADMMs)for convex composite optimization problems.The proposed method unifies and refines many constructive techniques that were separately developed for the computational efficiency of multi-block ADMM-type algor计hms.Specifically,the majorized augmented Lagrangian functions,the indefinite proximal terms,the inexact symmetrie Gauss-Seidel decomposition theorem,the tolerance criteria of approximately solving the subproblems,and the large dual step-lengths,are all incorporated in one algoi?计hmic framework,which we named as sGS-imiPADMM.From the popularity of convergent variants of multi-block ADMMs in recent years,especially for high-dimensional multi-block convex composite conic programming problems,the unification presen ted in this paper,as well as the corresponding convergence results,may have the great potential of facilitating the implemen tation of many multi-block ADMMs in various problem set tings.
基金the National Key R&D Program of China(2018YFC0213600)National Natural Science Foundation of China(Grant No.71834004)+1 种基金MOE(Ministry of Education in China)Project of Humanities and Social Sciences(Grant No.21YJC630014)China Postdoctoral Science Foundation(Grant No.2021M692568)for its financial support.
文摘Government macro-control through various policies is an important way to mitigate air pollution and greenhouse gases.Therefore,environmental tax is used worldwide as an important measure.However,few studies have considered the interaction between carbon and environmental protection taxes.Additionally,different sectors differ in their energy structure,pollution emission intensity,and economic status,and previous studies rarely proposed differentiated environmental tax rates based at the sectoral level.A model framework combining the computable general equilibrium(CGE)model and Bayesian optimization(BO)algorithm is proposed to maximize GDP,meet environmental planning objectives,and explore the optimal environmental taxation scheme to realize the multi-objective optimization of the economy and environment.Meanwhile,this study compares the different impact mechanisms of environmental protection tax and carbon tax.It discusses the impacts of differentiated environmental tax rates in different sectors on the environment and economy.For example,the results show that the coordinated implementation of environmental protection and carbon tax policies and the sectoral differentiated environmental tax rates in China could better balance economic development and environmental governance.Additionally,the optimal taxation scheme could mitigate air pollution and greenhouse gases,promote economic growth,and realize sustainable economic and environmental development.Furthermore,the optimized taxation scheme positively affects the energy and industrial structures.
基金The project is supported by National Natural Science Foundation of China(70531040, 70871114), the 985 Research Grant of Renmin University of China, and The Hong Kong CERG Research Fund PolyU 5485/09H.
文摘R. T. Rockafellar built a new general convex dual theory by introducing the conjugate function and the perturbation function. Following him, many other authors obtained some important results in generalized convex dual programs and
基金supported by the National Natural Science Foundation of China under Grant Nos.10971118, 10701047 and 10901096the Natural Science Foundation of Shandong Province under Grant Nos. ZR2009AL019 and BS2010SF010
基金The work is supported by the National Natural Science Foundation of China under Grant No.10571106.
文摘在这篇论文,作者建议奶妈元的一个班(abbr。DY ) 在一般功能上面对不安与线搜索结合坡度方法;一致地凸的功能分别地。在主要方向 s k 被 DY 获得的地方,他们的 iterate 公式是 x k+1 = x k + α k (s k + ω k ) 结合坡度方法,ω k 是不安术语,;步尺寸α k 被不必然在限制趋于到零的线搜索决定。作者在温和条件下面证明这些方法的全球集中。初步的计算经验也被报导。
基金Supported by the National Natural Science Foundation of China(No.10571106,10671010)
文摘In this paper, we study the directional derivative, subderivative, and subdifferential of sup-type functions without any compactness assumption on the index set. As applications, we provide an estimate of the Lipschitz modulus for sup-type functions.
基金This research is mainly supported by the National Natural Science Foundation of China(Nos.91130007 and 91330206).
文摘In this paper,we consider a cone problem of matrix optimization induced by spectral norm(MOSN).By Schur complement,MOSN can be reformulated as a nonlinear semidefinite programming(NLSDP)problem.Then we discuss the constraint nondegeneracy conditions and strong second-order sufficient conditions of MOSN and its SDP reformulation,and obtain that the constraint nondegeneracy condition of MOSN is not always equivalent to that of NLSDP.However,the strong second-order sufficient conditions of these two problems are equivalent without any assumption.Finally,a sufficient condition is given to ensure the nonsingularity of the Clarke’s generalized Jacobian of the KKT system for MOSN.
基金supported by the National Natural Science Foundation of China (No. 70531040 and 70871114)the 985 Research Grant of Renmin University of Chinasupported by the Hong Kong CERG Research Fund PolyU 5515/10H and PolyU 5485/09H
文摘This paper gives a dynamic concept and a new non-parametric method for evaluating returns to scale(RTS) of economic units with multiple inputs and outputs.It is frequently noticed that when we increase the input of a decision making unit(DMU) with a certain status of RTS,different status of RTS is observed.For example,when we increase the input of a DMU with constant RTS under the traditional method,a decreasing RTS is often observed instead of the expected constant RTS.We thus define the RTS of each DMU in both input expansion and contraction regions respectively.The research starts from transferring the production possibility set into the intersection form,by giving the explicit linear inequality representation of production frontiers.The RTS structural characteristics of DMUs' on the production frontier are described.Status of RTS of those DMUs on the production frontier include increasing RTS,constant RTS,decreasing RTS,saturated RTS and evidence of congestion.Necessary and suficient conditions for RTS evaluation are provided.The definition and evaluation method given here provide more detailed economic characteristics of DMU for policy makers.
文摘Data with large dimensions will bring various problems to the application of data envelopment analysis(DEA).In this study,we focus on a“big data”problem related to the considerably large dimensions of the input-output data.The four most widely used approaches to guide dimension reduction in DEA are compared via Monte Carlo simulation,including principal component analysis(PCA-DEA),which is based on the idea of aggregating input and output,efficiency contribution measurement(ECM),average efficiency measure(AEC),and regression-based detection(RB),which is based on the idea of variable selection.We compare the performance of these methods under different scenarios and a brand-new comparison benchmark for the simulation test.In addition,we discuss the effect of initial variable selection in RB for the first time.Based on the results,we offer guidelines that are more reliable on how to choose an appropriate method.