Abstract
A variation of the Polak method of feasible directions for solving nonlinear programming problems is shown to be related to the Topkis and Veinott method of feasible directions. This new method is proven to converge to a Fritz John point under rather weak assumptions. Finally, numerical results show that the method converges with fewer iterations than that of Polak with a proper choice of parameters.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
