改变农村落后面貌的两种互补性发展模型

目前我国存在的一系列矛盾和问题,在相当程度上都是来自城乡二元结构转变的滞后。城乡二元结构包括城乡二元经济结构和城乡二元社会结构。发展中国家应如何改变由城乡二元经济结构所造成的农村经济落后状况,西方经济学家创建外生性发展与内生性发展两种模型。这两种模型似乎是相互对立的,实际上是相互补充的。这已被中国农村改革与发展的实践所检验了的。

投影松弛迭代的收敛性与收敛速度(英文)

本文讨论求解一般线性互补问题的投影松弛迭代法的收敛性,对于两类迭代算法—投影雅可比松弛和投影逐次超松弛,我们给出了一些收敛判定准则.此外,我们还得到了两类算法的收敛速度估计式.

Multisplitting and Schwarz Methods for Solving Linear Complementarity Problems

In this paper we consider some synchronous and asynchronous multisplitting and Schwarz methods for solving the linear complementarity problems. We establish some convergence theorems of the methods by using the concept of M-splitting.

浦东开发与舟山协调发展的浅见

浦东开发区的建立,是我国进一步对外开放又一新的战略步骤。舟山和浦东开发区,无论从历史到现在,从人缘、地缘来看,都有着十分紧密的联系。因此,浦东开发区的进展对于舟山市的经济发展将产生不容置疑的直接影响。 从区域经济观察,浦东开发区是长江三角州经济发展的主角,其它省市是配角,配角要支持和服务于主角,主角要带动配角一起腾飞,由此而构成共同的利益。这种利益关系,可以套用《红楼梦》里一句话:“一荣俱荣,一损俱损”加以比喻。诚然,浦东开发区有经济发达、技术力量雄厚的浦西作后盾,然而毕竟也有一些难以避免的弱点。这就是区域经济发展的互补性问题。从这个角度来说,舟山省海洋、海岛独特的自然资源,可以为浦东开发区服务;同时,舟山可以借浦东开发契机,在服务中加快发展自身的经济。

The Successive Approximation Broyden-like Algorithm for Nonlinear Complementarity Problems

In this paper, we present a new form of successive approximation Broyden-like algorithm for nonlinear complementarity problem based on its equivalent nonsmooth equations. Under suitable conditions, we get the global convergence on the algorithms. Some numerical results are also reported.

Smoothing Newton Algorithm for Nonlinear Complementarity Problem with a PFunction

By using a smoothing function,the P nonlinear complementarity problem(P NCP)can be reformulated as a parameterized smooth equation.A Newton method is proposed to solve this equation.The iteration sequence generated by the proposed algorithm is bounded and this algorithm is proved to be globally convergent under an assumption that the P NCP has a nonempty solution set.This assumption is weaker than the ones used in most existing smoothing algorithms.In particular,the solution obtained by the proposed algorithm is shown to be a maximally complementary solution of the P NCP without any additional assumption.

Filter-sequence of quadratic programming method with nonlinear complementarity problem function

A mechanism for proving global convergence in filter-SQP （sequence of quadratic programming） method with the nonlinear complementarity problem （NCP） function is described for constrained nonlinear optimization problem.We introduce an NCP function into the filter and construct a new SQP-filter algorithm.Such methods are characterized by their use of the dominance concept of multi-objective optimization,instead of a penalty parameter whose adjustment can be problematic.We prove that the algorithm has global convergence and superlinear convergence rates under some mild conditions.

Smoothing Inexact Newton Method for Solving P_0-NCP Problems

Based on a smoothing symmetric disturbance FB-function,a smoothing inexact Newton method for solving the nonlinear complementarity problem with P0-function was proposed.It was proved that under mild conditions,the given algorithm performed global and superlinear convergence without strict complementarity.For the same linear complementarity problem(LCP),the algorithm needs similar iteration times to the literature.However,its accuracy is improved by at least 4 orders with calculation time reduced by almost 50%,and the iterative number is insensitive to the size of the LCP.Moreover,fewer iterations and shorter time are required for solving the problem by using inexact Newton methods for different initial points.

Regularization Semismooth Newton Method for P_0-NCPs with Non-monotone Line Search

Based on the generalized Fischer-Burmeister function, Chen et al in 2008 put forward a regularization semismooth Newton method for solving the nonlinear complementarity problem with a P0-function. In this paper, we investigate the above algorithm with the monotone line search replaced by a non-monotone line search. It is shown that the non-monotone algorithm is well-defined, and is globally and locally superlinearly convergent under standard assumptions.

考虑共享出行的用户均衡交通分配模型

为了研究共享出行行为对交通分配问题的影响,本文提出一个基于路径的共享出行用户均衡交通分配模型.在该模型中,出行者不仅要选择从出发地到目的地的路径,而且还要进行模式选择,以达到最小化广义路径出行成本的目的.本文构建的考虑共享机制的交通分配模型引入两个假设:1)一个乘客只被一个共乘司机搭载,一个司机只载一个乘客;2)由于参与共享出行活动,共乘司机和乘客均可获得额外的共享出行奖励,此外共乘乘客还能得到共享出行成本折扣.这两个假设使得所构建的共享出行用户均衡模型更贴近现实.Braess网络中的数值结果分析了关键参数对均衡结果的影响,结果表明:共享出行成本优惠和共享出行奖励均是鼓励出行者参与共享出行活动的有效措施.

A New Successive Approximation Damped Newton Method for Nonlinear Complementarity Problems

In this paper, we present a new successive approximation damped Newton method for the nonlinear complementarity problem based on its equivalent nonsmooth equations. Under suitable conditions, we obtain the global convergence result of the proposed algorithms. Some numerical results are also reported.

GUS-property for Lorentz cone linear complementarity problems on Hilbert spaces

Given a real(finite-dimensional or infinite-dimensional) Hilbert space H with a Jordan product,we consider the Lorentz cone linear complementarity problem,denoted by LCP(T,Ω,q),where T is a continuous linear operator on H,ΩH is a Lorentz cone,and q ∈ H.We investigate some conditions for which the problem concerned has a unique solution for all q ∈ H(i.e.,T has the GUS-property).Several sufficient conditions and several necessary conditions are given.In particular,we provide two suficient and necessary conditions of T having the GUS-property.Our approach is based on properties of the Jordan product and the technique from functional analysis,which is different from the pioneer works given by Gowda and Sznajder(2007) in the case of finite-dimensional spaces.

Condensed form of complementarity formulation for discontinuous deformation analysis

While the classical discontinuous deformation analysis(DDA) is applied to the analysis of a given block system, one must preset stiffness parameters for artificial springs to be fixed during the open-close iteration. To a great degree, success or failure in applying DDA to a practical problem is dependent on the spring stiffness parameters, which is believed to be the biggest obstacle to more extensive applications of DDA. In order to evade the introduction of the artificial springs, this study reformulates DDA as a mixed linear complementarity problem(MLCP) in the primal form. Then, from the fact that the block displacement vector of each block can be expressed in terms of the contact forces acting on the block, the condensed form of MLCP is derived, which is more efficient than the primal form. Some typical examples including those designed by the DDA inventor are reanalyzed, proving that the procedure is feasible.

Tensor absolute value equations

This paper is concerned with solving some structured multi-linear systems, which are called tensor absolute value equations. This kind of absolute value equations is closely related to tensor complementarity problems and is a generalization of the well-known absolute value equations in the matrix case. We prove that tensor absolute value equations are equivalent to some special structured tensor complementary problems. Some sufficient conditions are given to guarantee the existence of solutions for tensor absolute value equations. We also propose a Levenberg-Marquardt-type algorithm for solving some given tensor absolute value equations and preliminary numerical results are reported to indicate the efficiency of the proposed algorithm.

A FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR P_*(κ) LINEAR COMPLEMENTARITY PROBLEM

This paper proposes a new infeasible interior-point algorithm with full-Newton steps for P_*(κ) linear complementarity problem(LCP),which is an extension of the work by Roos(SIAM J.Optim.,2006,16(4):1110-1136).The main iteration consists of a feasibility step and several centrality steps.The authors introduce a specific kernel function instead of the classic logarithmical barrier function to induce the feasibility step,so the analysis of the feasibility step is different from that of Roos' s.This kernel function has a finite value on the boundary.The result of iteration complexity coincides with the currently known best one for infeasible interior-point methods for P_*(κ) LCP.Some numerical results are reported as well.

A complementary formulation for traffic equilibrium problem with a new nonadditive route cost

Improviag transportation system is essential for all people in each city since transport plays a very important role. Using mathematical programming approach transport problem is an effective way to improve transportation system. In this paper, the traffic equilibrium problem （TEP） with a general nonadditive route cost function is studied. We formulate the route cost function for each route as a disutility function, which can evaluate route cost function flexibly and analyze the route toll conveniently. Furthermore, we present the TEP with a nonlinear complementary problem （NCP） formulation. The monotonicity and the existence with the NCP formulation are also given under relative assumptions.