Welcome to Journal of University of Chinese Academy of Sciences,Today is

›› 2003, Vol. 20 ›› Issue (3): 290-295.DOI: 10.7523/j.issn.2095-6134.2003.3.005

Previous Articles     Next Articles

Research of Solving Bound Constrained Optimization of Nonlinear Programming with Orthogonal Design

WANG YuZhi, ZHANG JianFang   

  1. Graduate School, Chinese Academy of Sciences, Beijing 100039, China
  • Received:2002-09-10 Revised:2002-10-15 Online:2003-05-10

Abstract:

Introduces two methods called orthogonal array method and adding points orthogonal array method, which are based on the orthogonal design to solve bound constrained optimization of nonlinear programming. Methods are independent of the init ial points; the objective function need not be differentiable. Algorithms are simple and easy to be programed for running on a computer, and the running time is satisfactory. Some discussions are also given for a number of test ing problems.

Key words: orthogonal design, orthogonal array, bound constrained optimization of nonlinear programming

CLC Number: