摘要：This paper is concerned with engineering optimization problems involving a large number of design variables and constraints. We employ a quasiNewton version of FAIPA, the Feasible Arc Interior Point Algorithm for nonlinear constrained optimization. At each point, FAIPA defines a “feasible descent arc” and finds on this arc a new interior point with a lower objective. To compute the arc, three linear systems with the same matrix must be solved. This matrix includes the quasiNewton and the constraints derivatives matrices. One of the mains difficulties comes from the large memory requirements to store the quasi Newton matrix and constraints derivatives. The linear systems are solved iteratively and a limited memory quasi Newton formulation is employed, in such a way to avoid the storage of the systems matrix, of the quasiNewton matrix and of the constraints derivatives. Only the calculus and storage of a directional derivative vector of the constraints and of a gradient of a linear combination of the constraints is required. Numerical experiments with very large structural optimization problems show that the present approach is strong and efficient, requiring relatively modest computer resources. As an application we consider the free material optimization problem that minimizes the weight of a structure subject to mechanical constraints, such as displacement or stress. For planar structures the design variable are the thickness and the six components of the elasticity tensor.
