In the paper we introduce and study the explicit scheme of lagrangian multi- plier domain decomposition method dependent on time. The Uzawa algorithm is introduced to solve the interior displacement variables and the ...
详细信息
In the paper we introduce and study the explicit scheme of lagrangian multi- plier domain decomposition method dependent on time. The Uzawa algorithm is introduced to solve the interior displacement variables and the boundary multiplier variables. It will be shown that the condition number of the stiffness matrix of the lagrangian multiplier has a constant bound, i.e. O(1). The numerical experiments indicate that the method is very efficient.
A dual algorithm based on the smooth function proposed by Polyak (1988), for solving nonlinear programming problems with inequality constraints, is presented. The local convergence of the dual algorithm is established...
详细信息
A dual algorithm based on the smooth function proposed by Polyak (1988), for solving nonlinear programming problems with inequality constraints, is presented. The local convergence of the dual algorithm is established and the convergence rate is estimated. Numerical results given in tall paper show that this dual algorithm is effective for solving inequality constrained optimization problems.
暂无评论