论文信息 - On the mathematical foundations of nondifferentiable optimization in engineering design

On the mathematical foundations of nondifferentiable optimization in engineering design

It is shown by example that a large class of engineering design problems can be transcribed into the form of a canonical optimization problem with inequality constraints involving mar functions. Such problems are commonly referred to as semi-infinite optimization problems. The bulk of this paper is devoted to the development of a mathematical theory for the construction of first order nondifferentiable optimization algorithms, related to phase I - phase II methods of feasible directions, which solve these semi-infinite optimization problems. The applicability of the theory is illustrated with examples that are relevant to engineering design.

E. Polak

[1] R. Hettich,et al. On quadratically convergent methods for semi-infinite programming , 1979 .

[2] Kenneth O. Kortanek,et al. Semi-Infinite Programming and Applications , 1983, ISMP.

[3] K. Kiwiel. Methods of Descent for Nondifferentiable Optimization , 1985 .

[4] M. Todd,et al. The Ellipsoid Method: A Survey , 1980 .

[5] C. C. Gonzaga,et al. On Constraint Dropping Schemes and Optimality Functions for a Class of Outer Approximations Algorithms , 1979 .

[6] E. Gilbert. An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set , 1966 .

[7] L. Armijo. Minimization of functions having Lipschitz continuous first partial derivatives. , 1966 .

[8] V. F. Dem'yanov,et al. Nondifferentiable Optimization , 1985 .

[9] F. Clarke. Optimization And Nonsmooth Analysis , 1983 .

[10] Balder Von Hohenbalken,et al. Simplicial decomposition in nonlinear programming algorithms , 1977, Math. Program..

[11] C. C. Gonzaga,et al. An improved algorithm for optimization problems with functional inequality constraints , 1980 .