Transformation or penalty function techniques have enjoyed wide popularity for the solution of nonlinear programming problems in recent years. Many methods have been proposed in this class, including the Method of Multipliers. In this paper we present two enhancements which may be used with any transformation technique. The first is a technique for direct handling of variable bounds, and the second is a problem scaling algorithm. Both techniques have been implemented in connection with a Method of Multipliers code, BIAS, and applied to 23 test problems. The numerical results indicate a significant increase in the robustness and overall efficiency of the transformation method employed.
Computational Enhancements to the Method of Multipliers
R. R. Root,
R. R. Root
IBM Corporation, Rochester, Minn.
K. M. Ragsdell
School of Mechanical Engineering, Purdue University, West Lafayette, Ind.
- Views Icon Views
- Share Icon Share
- Cite Icon Cite
- Search Site
Root, R. R., and Ragsdell, K. M. (July 1, 1980). "Computational Enhancements to the Method of Multipliers." ASME. J. Mech. Des. July 1980; 102(3): 517–523. https://doi.org/10.1115/1.3254778
Download citation file:
- Ris (Zotero)
- Reference Manager
Get Email Alerts
Special Issue: Machine Learning for Engineering Design
J. Mech. Des (November 2019)
Convolutional Neural Network Surrogate Models for the Mechanical Properties of Periodic Structures
J. Mech. Des (February 2020)