On convergence properties of a least-distance programming procedure for minimization problems under linear constraints

In Ref. 1, Bazaraa and Goode provided an algorithm for solving a nonlinear programming problem with linear constraints. In this paper, we show that this algorithm possesses good convergence properties.This paper was written under the guidance of Associate Professor C. Y. Wang. The author takes great pleasure in thanking him.     

An oracle based method to compute a coupled equilibrium in a model of international climate policy

This paper proposes a computational game-theoretic model for the international negotiations that should take place at the end of the period covered by the Kyoto protocol. These negotiations could lead to a self-enforcing agreement on a burden sharing scheme given the necessary global emissions limit that will be imposed when the real extent of climate change is known. The model assumes a non-cooperative behavior of the parties except for the fact that they will be collectively committed to reach a target on total cumulative emissions by the year 2050. The concept of normalized equilibrium, introduced by J.B. Rosen for concave games with coupled constraints, is used to characterize a family of dynamic equilibrium solutions in an m-player game where the agents are (groups of) countries and the payoffs are the welfare gains obtained from a Computable General Equilibrium (CGE) model. The model deals with the uncertainty about climate sensitivity by computing an S-adapted equilibrium. These equilibria are computed using an oracle-based method permitting an implicit definition of the payoffs to the different players, obtained through simulations performed with the global CGE model GEMINI-E3. Partly supported by GICC (French Ministry of Ecology), TOCSIN (EU-044287) and the Swiss-NSF NCCR-Climate program of the Swiss NSF. For helpful comments and discussions, we thank A. Bernard, P. Thalmann, and the anonymous referee.     

Monte Carlo and quasi-Monte Carlo sampling methods for a class of stochastic mathematical programs with equilibrium constraints

In this paper, we consider a class of stochastic mathematical programs with equilibrium constraints introduced by Birbil et al. (Math Oper Res 31:739–760, 2006). Firstly, by means of a Monte Carlo method, we obtain a nonsmooth discrete approximation of the original problem. Then, we propose a smoothing method together with a penalty technique to get a standard nonlinear programming problem. Some convergence results are established. Moreover, since quasi-Monte Carlo methods are generally faster than Monte Carlo methods, we discuss a quasi-Monte Carlo sampling approach as well. Furthermore, we give an example in economics to illustrate the model and show some numerical results with this example. The first author’s work was supported in part by the Scientific Research Grant-in-Aid from Japan Society for the Promotion of Science and SRF for ROCS, SEM. The second author’s work was supported in part by the United Kingdom Engineering and Physical Sciences Research Council grant. The third author’s work was supported in part by the Scientific Research Grant-in-Aid from Japan Society for the Promotion of Science.     

On Some Feasibility Conditions in MPEC

This article discusses feasibility conditions in mathematical programs with equilibrium constraints （MPECs）. The authors prove that two sufficient conditions guarantee the feasibility of these MPECs. The authors show that the two feasibility conditions are different from the feasibility condition in [2, 3], and show that the sufficient condition in [3] is stronger than that in [2].     

基于激光点云多条件约束的相机检校方法

为了克服相机检校对二维/三维检校场的依赖,提出一种基于激光点云多条件约束的相机检校方法。该方法通过对相机获取的多视影像进行光束法平差获得初始相机参数;利用影像点云与其最邻近的激光点云之间的位置关系,以共线方程为基础模型,建立多条件约束的相机检校数学模型;使用不等式约束的最小二乘方法平差迭代解算相机参数。将本文方法与基于三维控制场的检校精度进行了实验对比分析,结果表明本文方法与基于三维控制场的检校精度相当,两者反投影平均误差相差小于0.1 pixel,验证了本文方法在没有传统检校场的情况下进行相机检校的可行性。     

Singularity-free augmented Lagrangian algorithms for constrained multibody dynamics

After a general review of the methods currently available for the dynamics of constrained multibody systems in the context of numerical efficiency and ability to solve the differential equations of motion in singular positions, we examine the acceleration based augmented Lagrangian formulations, and propose a new one for holonomic and non-holonomic systems that is based on the canonical equations of Hamilton. This new one proves to be more stable and accurate that the acceleration based counterpart under repetitive singular positions. The proposed algorithms are numerically efficient, can use standard conditionally stable numerical integrators and do not fail in singular positions, as the classical formulations do. The reason for the numerical efficiency and better behavior under singularities relies on the fact that the leading matrix of the resultant system of ODEs is sparse, symmetric, positive definite, and its rank is independent of that of the Jacobian of the constraint equations. The latter fact makes the proposed method particularly suitable for singular configurations.     

Motion Planning for a Wheeled Robot (Kinematic Approximation)

The motion-planning problem for a wheeled robot is solved in kinematic approximation. The solution is given for robots with one and two steering wheels. The results of solving the problem for a specific system are compared with the results obtained by other authors__________Translated from Prikladnaya Mekhanika, Vol. 41, No. 2, pp. 91–102, February 2005.     

A method for calculating rheological and morphological properties of constant-volume polymer blend models in inhomogeneous shear fields

We show how to formulate two-point boundary-value problems in order to compute fully-developed laminar channel and tube flow profiles for viscoelastic fluid models. The formulation is applied to Couette and pressure-driven flows separately, or a combination of both. The application of this methodology is illustrated analytically for the Upper-Convected Maxwell Model, and it is applied computationally for the Phan-Thien/Tanner and Giesekus Models. Numerical solutions exist for the last two models [J.Y. Yoo, H.C. Choi, On the steady simple shear flows of the one-mode Giesekus fluid, Rheol. Acta 28 (1989) 13–24; P.J. Oliveira, F.T. Pinho, Analytical solution for fully developed channel and pipe flow of Phan-Thien–Tanner fluids, J. Fluid Mech. 387 (1999) 271–280; M.A. Alves, F.T. Pinho, P.J. Oliveira, Study of steady pipe and channel flows of a single-mode Phan-Thien–Tanner fluid, J. Non-Newtonian Fluid Mech. 101 (2001) 55–76], allowing verification of the computational technique. Subsequently, the computational algorithm is applied to the constant-volume polymer blend models of Maffettone and Minale [P.L. Maffettone, M. Minale, Equation of change for ellipsoidal drops in viscous flow, J. Non-Newtonian Fluid Mech. 84 (1999) 105–106 (Erratum), J. Non-Newtonian Fluid Mech. 78 (1998) 227–241] and Dressler and Edwards [M. Dressler, B.J. Edwards, The influence of matrix viscoelasticity on the rheology of polymer blends, Rheol. Acta 43 (2004) 257–282; M. Dressler, B.J. Edwards, Rheology of polymer blends with matrix-phase viscoelasticity and a narrow droplet size distribution, J. Non-Newtonian Fluid Mech. 120 (2004) 189–205]. Rheological and morphological properties of the model blends are thus obtained as functions of the spatial position within the channel, applied pressure drop, and shear rate at the wall.     

多工况多约束下离散变量桁架结构的拓扑优化设计

提出了一个多工况下受应力、位移约束的离散变量桁架结构的拓扑优化方法，给出了结构拓扑形式变更时的约束处理方法及杆件删除策略，使基结构设计空间的维数不断降低，达到最优拓扑，避免了奇异解的出现，在算例中指出了截面离散集和位移约束对最优拓扑的影响；算例给出了满意的拓扑优化解。