Locating an Isolated Global Minimizer of a Constrained Nonconvex Program

Published Online:https://doi.org/10.1287/moor.5.3.435

Conditions are given which verify the existence and determine the location of an isolated local constrained minimizer of a constrained nonconvex program. An exact formula is given for the amount by which the value of the objective function at some point differs from the value at that isolated point. Further conditions are given which ensure that the local minimizer is a global minimizer.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.