Dynamic Global Constraints in Backtracking Based Environments

Global constraints provide strong filtering algorithms to reduce the search space when solving large combinatorial problems. In this paper we propose to make the global constraints dynamic, i.e., to allow extending the set of constrained variables during search. We describe a generic dynamisation technique for an arbitrary monotonic global constraint and we compare it with the semantic-based dynamisation for the alldifferent constraint. At the end we sketch a dynamisation technique for non-monotonic global constraints. A comparison with existing methods to model dynamic problems is given as well.     

线性约束最优化的一个共轭投影梯度法

本结合共轭梯度法及梯度投影法的思想,建立线性等式约束最优化的一个新算法,称之为共轭投影梯度法。分别对二次凸目标函数和一般目标函数分析和论证了算法的重要性质和收敛性。     

Global Optimality Conditions in Maximizing a Convex Quadratic Function under Convex Quadratic Constraints

For the problem of maximizing a convex quadratic function under convex quadratic constraints, we derive conditions characterizing a globally optimal solution. The method consists in exploiting the global optimality conditions, expressed in terms of -subdifferentials of convex functions and -normal directions, to convex sets. By specializing the problem of maximizing a convex function over a convex set, we find explicit conditions for optimality.     

变质量单面完整约束系统Lie对称性的摄动与广义Hojman型绝热不变量

研究变质量单面完整约束系统Lie对称性的摄动与广义Hojman型绝热不变量.首先通过一般无限小变换下的Lie对称性得到广义Hojman型的守恒量；然后基于力学系统高阶绝热不变量的定义，研究小扰动作用下系统Lie对称性的摄动，得到系统广义Hojman型绝热不变量；最后举例说明结果的应用. 关键词： 变质量 单面完整约束 对称性 摄动 绝热不变量     

On the validity of the vakonomic model and the chetaev model for constraint dynamical systems

By analyzing the virtual work of reaction forces, we prove the failure of the vakonomic model in obtaining the correct equations of motion for nonholonomic mechanical systems. Only when the constraint is integrable can the actual equation of motion be obtained. We show that the null virtual work condition of reaction forces is a robust criterion on the validity of various models of analytical mechanics. For an illustration, classical examples are discussed.     

道路约束条件下的移动机器人跟踪

为提高移动机器人的位置估计精度和跟踪效果,提出一种基于道路约束条件下的移动机器人鲁棒约束H∞滤波(CHF)跟踪算法.首先,将机器人移动的道路网络作为跟踪的约束条件,并利用当前统计模型对机器人的运动进行建模.其次,将道路约束条件作为机器人跟踪的非线性状态约束,利用最小协方差估计推导了鲁棒CHF递推方程.通过拉格朗日乘子法对非线性约束优化估计问题进行求解,并利用约束信息对CHF算法的状态更新过程进行了改进.最后,通过对CHF算法和无约束的H∞滤波算法的跟踪性能进行了对比分析和验证.仿真结果表明,该算法可以实现机器人的跟踪,且跟踪精度优于HF算法.     

Nonlinear programming without a penalty function or a filter

A new method is introduced for solving equality constrained nonlinear optimization problems. This method does not use a penalty function, nor a filter, and yet can be proved to be globally convergent to first-order stationary points. It uses different trust-regions to cope with the nonlinearities of the objective function and the constraints, and allows inexact SQP steps that do not lie exactly in the nullspace of the local Jacobian. Preliminary numerical experiments on CUTEr problems indicate that the method performs well.      

Hamel’s paradox and the foundations of analytical dynamics

This paper deals with an explanation of a paradox posed by Hamel in his 1949 book on Theoretical Mechanics. The explanation deals with the foundations of mechanics and points to new insights into analytical dynamics.     

Feasibility in reverse convex mixed-integer programming

In this paper we address the problem of the infeasibility of systems defined by reverse convex inequality constraints, where some or all of the variables are integer. In particular, we provide a polynomial algorithm that identifies a set of all constraints critical to feasibility (CF), that is constraints that may affect a feasibility status of the system after some perturbation of the right-hand sides. Furthermore, we will investigate properties of the irreducible infeasible sets and infeasibility sets, showing in particular that every irreducible infeasible set as well as infeasibility sets in the considered system, are subsets of the set CF of constraints critical to feasibility.     

修理延迟的设备修如旧模型的可用度

本文通过将使用时间在可能发生故障的时刻划分成时间区间,对修如旧模型下的多部件系统,在修理延迟条件下,对各类故障在同一时间区间里相容的条件下导出了任意给定时刻设备的可用度函数,并对文[3]中的算法做了改进,得到了更精确更合理的结果