Abstract
There are well-known first-order sufficient conditions for a pointx 0 to be a strict locally optimal solution of a nonlinear programming problem. In this paper, we show that these conditions also guarantee thatx 0 is an isolated stationary point of the considered program provided a constraint qualification holds. This result has an interesting application to finite convergence of algorithms along the lines suggested by Al-Khayyal and Kyparisis.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
