论文信息 - A cut-map algorithm for design problems with parameter tolerances

A cut-map algorithm for design problems with parameter tolerances

The design problem of choosing a set of parameters so that inequality constraints are satisfied for a specified variation of parameter values about their nominal value is considered. Such problems occur when systems must be synthesized from components whose values are only known to a certain tolerance. Simple algorithms exist for such problems when the constraints are convex. This paper presents an algorithm which is valid for the nonconvex case. The algorithm utilizes concepts employed by Eaves and Zangwill in their generalized cutting plane algorithms.

D. Mayne | E. Polak | A. Voreadis

[1] B. Eaves,et al. Generalized Cutting Plane Algorithms , 1971 .

[2] John W. Bandler. Optimization of design tolerances using nonlinear programming , 1974 .

[3] John W. Bandler,et al. Worst Case Network Tolerance Optimization , 1975 .

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

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

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

[7] Robert K. Brayton,et al. A new algorithm for statistical circuit design based on quasi-newton methods and function splitting , 1979 .

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

[9] K. Madsen,et al. Algorithms for worst-case tolerance optimization , 1979 .