constraint 
The new optimality condition doesn't use Luderer's regularity assumption and its Lagrangian multipliers don't depend on the particular elements in the superdifferentials of the object function and constraint functions.


Asymptotic surrogate constraint method and its convergence for a class of semiinfinite programming


A class of constrained semiinfinite minimax problem is transformed into a simple constrained problem, by means of discretization decomposition and maximum entropy method, making use of surrogate constraint.


A interior point scaling projected reduced Hessian method with combination of nonmonotonic backtracking technique and trust region strategy for nonlinear equality constrained optimization with nonegative constraint on variables is proposed.


The horizontal trust region subproblem in the algorithm is only a general trust region subproblem while the vertical trust region subproblem is defined by a parameter size of the vertical direction subject only to an ellipsoidal constraint.


The matrix equation AXB = E with the constraint PX = sXP is considered, where P is a given Hermitian matrix satisfying P2 = I and s = ±1.


Moreover, a similar problem of the matrix equation with generalized constraint is discussed.


Lower bounds and modified LPT algorithm for kpartitioning problems with partition matroid constraint


In this paper, the kpartitioning problem with partition matroid constraint is considered.


Based on an analysis of mechanism combination methods of a current mechanism system kinematic scheme, input/output kinematic behavior and their constraint relations were proposed to represent the kinematic behavior knowledge of a mechanism system.


Its intermediate design solution and the constraint relations between input and output are generated to fill the common blackboard.


Based on the variational constraint approach, the variational form of Reynolds equation in hydrodynamic lubrication is revised continuously to satisfy certain constraints in the cavitation zone of oil film field.


Research on constraintbased virtual assembly technologies


Several algorithms about the constraint treatment are submitted.


First, the automatic recognition algorithm based on the assembly relation is used to determine the position and orientation relation between two geometry elements of constraint whether they meet the given errors.


Second, to satisfy the new constraint, according to the positing solving algorithm, the position and orientation of an active part are modified with minimal adjustment after the part has satisfied the affirmed constraints.


Experiments have indicated that these algorithms have well supported constraint treatments in the IVAE and realized the closer combination of the virtual and the real assembly processes.


The kinematic constraint conditions and dynamic constraint conditions for elastic displacements are presented.


In particular, recent analyses of the isospin diffusion data in heavyion reactions have already put a stringent constraint on the nuclear symmetry energy around the nuclear matter saturation density.


We describe the capabilities, features, and main components of Gool, propose several techniques for geometric constraint handling, and discuss some of the implementation issues.

