Computability of Global Solutions to Factorable Nonconvex Programs: Part I. Convex Underestimating Problems,
Abstract
For nonlinear programming problems which are factorable, a computable procedure for obtaining tight underestimating convex programs is presented. This is used to exclude from consideration regions where the global minimizer cannot exist.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 07, 1975
- Accession Number
- ADA009223
Entities
People
- Garth Philip McCormick
Organizations
- George Washington University