论文信息 - An implementable algorithm for the optimal design centering, tolerancing, and tuning problem

An implementable algorithm for the optimal design centering, tolerancing, and tuning problem

An implementable master algorithm for solving optimal design centering, tolerancing, and tuning problems is presented. This master algorithm decomposes the original nondifferentiable optimization problem into a sequence of ordinary nonlinear programming problems. The master algorithm generates sequences with accumulation points that are feasible and satisfy a new optimality condition, which is shown to be stronger than the one previously used for these problems.

E. Polak

[1] J. Pinel. Computer-Aided Network Tuning , 1971 .

[2] Elijah Polak,et al. Computational methods in optimization , 1971 .

[3] P. Wolfe. Note on a method of conjugate subgradients for minimizing nondifferentiable functions , 1974 .

[4] F. Clarke. Generalized gradients and applications , 1975 .

[5] John W. Bandler,et al. A nonlinear programming approach to optimal design centering, tolerancing, and tuning , 1976 .

[6] Frank H. Clarke,et al. A New Approach to Lagrange Multipliers , 1976, Math. Oper. Res..

[7] P. Lopresti,et al. Optimum design of linear tuning algorithms , 1977 .

[8] R. Mifflin. Semismooth and Semiconvex Functions in Constrained Optimization , 1977 .

[9] Robert Mifflin,et al. An Algorithm for Constrained Optimization with Semismooth Functions , 1977, Math. Oper. Res..

[10] Alberto Sangiovanni-Vincentelli,et al. On optimization algorithms for engineering design problems with distributed constraints, tolerances and tuning , 1978 .

[11] D. Mayne,et al. An outer approximations algorithm for computer-aided design problems , 1979 .

[12] E. Polak,et al. Theoretical and computational aspects of the optimal design centering, tolerancing, and tuning problem , 1979 .

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