Recently, we have proposed the discrete Lagrange-multiplier method (DLM) to solve satissability problems. Instead of restarting from a new starting point when the search reaches a local minimum in the objective space, the Lagrange multipliers of violated constraints in DLM provide a force to lead the search out of the local minimum and move it in a direction provided by the multipliers. In this...

where λ is the Lagrange multiplier and ψ = 0 the holonomic constraint. The first practical algorithm for constrained dynamics was called SHAKE [3]. In this algorithm the Lagrange multiplier was calculated from the viewpoint, that no exact discrete solution could be obtained. Thus the constraints were satisfied by inserting the discrete propagator into the holonomic constraint, ψ(t+ h) = 0. This...

    In this paper, a variational iteration method (VIM), which is a well-known method for solving nonlinear equations, has been employed to solve an inverse parabolic partial differential equation. Inverse problems in partial differential equations can be used to model many real problems in engineering and other physical sciences. The VIM is to construct correction functional using general Lagr...

Abstract With the development of space science in China, scale application payloads continues to increase, and demand for heat dissipation is also gradually increasing. The fluid loop thermal control a more efficient way dissipation. In order optimize effect system, this paper establishes model system converts it into constrained optimization problem. generalized Lagrange multiplier method used...

In the finite element method, a standard approach to mesh tying is to apply Lagrange multipliers. If the interface is curved, however, discretization generally leads to adjoining surfaces that do not coincide spatially. Straightforward Lagrange multiplier methods lead to discrete formulations failing a first-order patch test [12]. A least-squares method is presented here for mesh tying in the p...

In this paper, an importance sampling method – cross entropy method is presented to deal with solving support vector machines (SVM) problem for multiclass classification cases. Using one-against-rest (OAR) and one-against-one (OAO) approaches, several binary svm classifiers are constructed and combined to solve multiclass classification problems. For each binary SVM classifier, the cross entrop...

In this paper, a vaccination susceptible exposed infected recovered (VSEIR) model f o r tuberculosis in North Sumatera is discussed. The VSEIR model is formed by a system of nonlinear differential equations. The approximate solution of this model is obtained by using the step variational iteration method (SVIM) and variational iteration method (VIM). VIM used the general Lagrange multiplier in ...

The minimax concave plus penalty (MCP) has been demonstrated to be effective in nonconvex penalization for feature selection. In this paper we propose a novel construction approach for MCP. In particular, we show that MCP can be derived from a concave conjugate of the Euclidean distance function. This construction approach in turn leads us to an augmented Lagrange multiplier method for solving ...