期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
A Method for Solving Computer-Aided Product Design Optimization Problem Based on Back Propagation Neural Network 被引量:1
1
作者 周祥 何小荣 陈丙珍 《Chinese Journal of Chemical Engineering》 SCIE EI CAS CSCD 2004年第4期510-514,共5页
Because of the powerful mapping ability, back propagation neural network (BP-NN) has been employed in computer-aided product design (CAPD) to establish the property prediction model. The backward problem in CAPD is to... Because of the powerful mapping ability, back propagation neural network (BP-NN) has been employed in computer-aided product design (CAPD) to establish the property prediction model. The backward problem in CAPD is to search for the appropriate structure or composition of the product with desired property, which is an optimization problem. In this paper, a global optimization method of using the a BB algorithm to solve the backward problem is presented. In particular, a convex lower bounding function is constructed for the objective function formulated with BP-NN model, and the calculation of the key parameter a is implemented by recurring to the interval Hessian matrix of the objective function. Two case studies involving the design of dopamine β-hydroxylase (DβH) inhibitors and linear low density polyethylene (LLDPE) nano composites are investigated using the proposed method. 展开更多
关键词 computer-aided product design (CAPD) back propagation neural network (BP-NN) a BB algorithm convex lower bounding function interval Hessian matrix
下载PDF
PREDICTOR-CORRECTOR ALGORITHM FOR CONVEX QUADRATIC PROGRAMMING WITH UPPER BOUNDS
2
作者 GUO, TD WU, SQ 《Journal of Computational Mathematics》 SCIE CSCD 1995年第2期161-171,共11页
Predictor-corrector algorithm for linear programming, proposed by Mizuno et al.([1]), becomes the best well known in the interior point methods. The purpose of this paper is to extend these results in two directions. ... Predictor-corrector algorithm for linear programming, proposed by Mizuno et al.([1]), becomes the best well known in the interior point methods. The purpose of this paper is to extend these results in two directions. First, we modify the algorithm in order to solve convex quadratic programming with upper bounds. Second, we replace the corrector step with an iteration of Monteiro and Adler's algorithm([2]). With these modifications, the duality gap is reduced by a constant factor after each corrector step for convex quadratic programming. It is shown that the new algorithm has a O(root nL)-iteration complexity. 展开更多
关键词 EN QP PREDICTOR-CORRECTOR ALGORITHM FOR convex QUADRATIC PROGRAMMING WITH UPPER bounds
原文传递
On Drop and Weak Drop Properties for Bounded Closed Convex Sets*
3
作者 张子厚 《Journal of Mathematical Research and Exposition》 CSCD 1999年第4期667-672,共6页
In this paper we prove three equivalent conditions of bounded closed convexset K in Banach space to have the drop and weak drop properties. We also give fourequivalent conditions of Banach space and its dual space to ... In this paper we prove three equivalent conditions of bounded closed convexset K in Banach space to have the drop and weak drop properties. We also give fourequivalent conditions of Banach space and its dual space to have the drop and weak dropproperties. 展开更多
关键词 Bounded closed convex set drop property weak drop property.
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部