A key idea for deterministic global optimization is the use of global feasible search, namely, algorithms that guarantee finding feasible solutions of nonconvex problems or prove that none exists. In this article, a set of conditions for global feasible search algorithms is established. The utility of these conditions is demonstrated on two algorithms that solve special problem classes globally. Also, a new model transformation is shown to convert a generalized polynomial problem into one of the special classes above. A flywheel design example illustrates the approach. A sequel article provides further computational details and design examples.
On Global Feasible Search for Global Design Optimization with Application to Generalized Polynomial Models
- Views Icon Views
- Share Icon Share
- Search Site
Lo, C., and Papalambros, P. Y. (September 1, 1995). "On Global Feasible Search for Global Design Optimization with Application to Generalized Polynomial Models." ASME. J. Mech. Des. September 1995; 117(3): 402–408. https://doi.org/10.1115/1.2826693
Download citation file: