Abstract
In this paper, necessary and sufficient conditions for a local minimum to be global are derived. The main result is that a real function, defined on a subset of Rn, has the property that every local minimum is global if, and only if, its level sets are lower-semicontinuous point-to-set mappings.
Original language | English |
---|---|
Pages (from-to) | 183-190 |
Number of pages | 8 |
Journal | Journal of Optimization Theory and Applications |
Volume | 16 |
Issue number | 3-4 |
DOIs | |
State | Published - Aug 1975 |
Externally published | Yes |
Keywords
- Global optimality
- mathematical programming
- nonconvex programming
- nonlinear optimization
- point-to-set maps